In the context of verification of data-aware processes, a formal approach based on
satisfiability modulo theories (SMT) has been considered to verify parameterised safety …

This paper establishes a framework based on logic and automata theory in which to model
and automatically verify systems of multiple mobile agents moving in environments with …

Based on weighted possible-world semantics, Belle and Lakemeyer recently proposed the
logic DS, a probabilistic extension of a modal variant of the situation calculus with a model of …

Verification of Data-Aware Processes via Satisfiability Modulo Theories Page 1 123 LNBIP 470
Verification of Data-Aware Processes via Satisfiability Modulo Theories Alessandro Gianola …

By their very design, many robot control programs are non-terminating. This paper describes
a situation calculus approach to expressing and proving properties of non-terminating …

Belief-based programming is a probabilistic extension of the Golog programming language
family, where every action and sensing could be noisy and every test refers to the subjective …

Golog is an expressive high-level agent language that includes nondeterministic operators
which allow to leave some of the decisions to be made only at execution time. This so-called …

Traditional approaches to modeling and verification of systems based on model checking of
linear-time properties are usually propositional in nature (eg, LTL). However, many real …

Rich representation of knowledge and actions has been a goal that many AI researchers
pursue. Among all proposals, perhaps, the situation calculus by Reiter is the most widely …

We suggest to express policies for contingent planning by knowledge-based programs
(KBPs). KBPs, introduced by Fagin et al.(1995)[32], are high-level protocols describing the …