From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem

Thielscher, Michael

doi:10.1016/s0004-3702(99)00033-8

Cited by 96 publications

(50 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By using this assumption, we represent the state of a process enactment as a set of properties, called fluents holding at a time instant. We borrow the notion of fluent from action languages such as the Situation Calculus [25], the Event Calculus [20], or the Fluent Calculus [30], but we will present our semantics by following the structural operational approach often adopted in the field of programming languages. Formally, a state s ∈ States is a pair F, t , where F is a set of fluents and t is a time instant, that is, a non-negative integer.…”

Section: Operational Semanticsmentioning

confidence: 99%

Verifying Controllability of Time-Aware Business Processes

Angelis

Fioravanti

Meo

et al. 2017

Rules and Reasoning

View full text Add to dashboard Cite

Abstract. We present an operational semantics for time-aware business processes, that is, processes modeling the execution of business activities, whose durations are subject to linear constraints over the integers. We assume that some of the durations are controllable, that is, they can be determined by the organization that enacts the process, while others are uncontrollable, that is, they are determined by the external world.Then, we consider controllability properties, which guarantee the completion of the enactment of the process, satisfying the given duration constraints, independently of the values of the uncontrollable durations. Controllability properties are encoded by quantified reachability formulas, where the reachability predicate is recursively defined by a set of Constrained Horn Clauses (CHCs). These clauses are automatically derived from the operational semantics of the process.Finally, we present two algorithms for solving the so called weak and strong controllability problems. Our algorithms reduce these problems to the verification of a set of quantified integer constraints, which are simpler than the original quantified reachability formulas, and can effectively be handled by state-of-the-art CHC solvers.

show abstract

Section: Operational Semanticsmentioning

confidence: 99%

Verifying Controllability of Time-Aware Business Processes

Angelis

Fioravanti

Meo

et al. 2017

Rules and Reasoning

View full text Add to dashboard Cite

show abstract

“…There are, of course, alternate formalisms, such as the fluent calculus (Thielscher, 1999) and other closely related approaches, such as those based on dynamic logics (Gerbrandy & Groeneveld, 1997;Demolombe, 2003;Demolombe, Herzig, & Varzinczak, 2003;Van Ditmarsch, Herzig, & De Lima, 2007). In particular, the action modality of ES, which we inherit here, is taken from dynamic logic.…”

Section: Related Workmentioning

confidence: 99%

Multiagent Only Knowing in Dynamic Systems

Belle¹,

Lakemeyer²

2014

jair

View full text Add to dashboard Cite

The idea of "only knowing" a collection of sentences, as proposed by Levesque, has been previously shown to be very useful in characterizing knowledge-based agents: in terms of a specification, a precise and perspicuous account of the beliefs and non-beliefs is obtained in a monotonic setting. Levesque's logic is based on a first-order modal language with quantifying-in, thus allowing for de re versus de dicto distinctions, among other things. However, the logic and its recent dynamic extension only deal with the case of a single agent. In this work, we propose a first-order multiagent framework with knowledge, actions, sensing and only knowing, that is shown to inherit all the features of the single agent version. Most significantly, we prove reduction theorems by means of which reasoning about knowledge and actions in the framework simplifies to non-epistemic, non-dynamic reasoning about the initial situation.

show abstract

“…EC has been frequently used for event recognition -to the best of our knowledge, only in a logic programming form, as in (Chittaro and Dojat 1997; EC is related to other formalisms proposed in the literature of commonsense reasoning, such as the Situation Calculus (McCarthy and Hayes 1969;Reiter 2001), the action language C + (Giunchiglia et al 2004;Akman et al 2004), the fluent calculus (Thielscher 1999;Thielscher 2001) and Temporal Action Logics (Doherty et al 1998;Kvarnström 2005). Comparisons between formalisms for commonsense reasoning and proofs of equivalence between some of them may be found in (Kowalski and Sadri 1997; …”

Section: The Event Calculusmentioning

confidence: 99%

Logic-based event recognition

Artikis

Skarlatidis

Portet

et al. 2012

The Knowledge Engineering Review

View full text Add to dashboard Cite

Today's organisations require techniques for automated transformation of their large data volumes into operational knowledge. This requirement may be addressed by employing event recognition systems that detect events/activities of special significance within an organisation, given streams of 'low-level' information that is very difficult to be utilised by humans. Consider, for example, the recognition of attacks on nodes of a computer network given the TCP/IP messages, the recognition of suspicious trader behaviour given the transactions in a financial market, and the recognition of whale songs given a symbolic representation of whale sounds. Various event recognition systems have been proposed in the literature. Recognition systems with a logic-based representation of event structures, in particular, have been attracting considerable attention, because, among others, they exhibit a formal, declarative semantics, they have proven to be efficient and scalable, and they are supported by machine learning tools automating the construction and refinement of event structures. In this paper we review representative approaches of logic-based event recognition and discuss open research issues of this field. We illustrate the reviewed approaches with the use of a real-world case study: event recognition for city transport management.

show abstract

From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem

Cited by 96 publications

References 27 publications

Verifying Controllability of Time-Aware Business Processes

Verifying Controllability of Time-Aware Business Processes

Multiagent Only Knowing in Dynamic Systems

Logic-based event recognition

Contact Info

Product

Resources

About