Integrating Action Calculi and Description Logics

@inproceedings{Drescher2007IntegratingAC,
  title={Integrating Action Calculi and Description Logics},
  author={Conrad Drescher and Michael Thielscher},
  booktitle={KI},
  year={2007}
}
General action languages, like e.g. the Situation Calculus, use full classical logic to represent knowledge of actions and their effects in dynamic domains. Description Logics, on the other hand, have been developed to represent static knowledge with the help of decidable subsets of first order logic. In this paper, we show how to use Description Logic as the basis for a decidable yet still expressive action formalism. To this end, we use ABoxes as decidable state descriptions in the basic… 

Actions Over a Constructive Semantics for Description Logics

TLDR
This work addresses the problems of determining executability of an action, building the state obtained by an action application and checking its consistency: it presents an algorithm to solve the latter two problems.

A Family of Dynamic Description Logics for Representing and Reasoning About Actions

TLDR
This paper proposes a family of dynamic description logics DDL(X@), which not only offers considerable expressive power going beyond many action formalisms which are propositional, but also provides decidable reasoning services for actions described by it.

A description logic based situation calculus

TLDR
It is shown that the regression operator in this modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers can be defined similarly to regression in Reiter’s version ofThe situation calculus.

Bridging the gap between classical logic based formalisms and logic programs

TLDR
The integration of DLs and ASP presented in this dissertation provides a framework for integrating rules and ontologies for the semantic web, which enables us to perform nonmonotonic reasoning with DL knowledge bases.

Combining Event Calculus and Description Logic Reasoning via Logic Programming

TLDR
A knowledge representation language that combines Kowalski’s event calculus with description logic in a logic programming framework to provide the user with an expressive language for modelling and analysing systems that evolve over time is introduced.

Kripke semantics and tableau procedures for constructive description logics.

In this work we present the decidable constructive description logic KALC: the logic is based on a Kripke-style semantics for the language of the description logic ALC and it is directly inspired by

Foundations of instance level updates in expressive description logics

Advanced Reasoning about Dynamical Systems

TLDR
A modified fragment of the situation calculus is proposed that can assure decidable reasoning and has potential applications to Semantic Web services and a framework to handle large taxonomies of actions compactly is developed.

A Note on Semantic Web Services Specification and Composition in Constructive Description Logics

TLDR
A declarative service language and a calculus for service composition are proposed and it is shown by means of an example how this calculus can be used to compose Webservices and the problem of automatic service synthesis is discussed.

Putting ABox Updates into Action

TLDR
This paper addresses two issues from a practical point of view: iterated update operations result in very large Boolean ABoxes, which, however, contain a huge amount of redundant information.

References

SHOWING 1-10 OF 24 REFERENCES

Description Logic Actions with general TBoxes: a Pragmatic Approach

TLDR
A DL action formalism that admits general TBoxes is defined, an approach to addressing the ramification problem that is introduced in this way is proposed, and a detailed investigation of the decidability and computational complexity of reasoning in this formalism is performed.

Integrating Description Logics and Action Formalisms: First Results

TLDR
This paper performs a detailed investigation of how the choice of the DL influences the complexity of the standard reasoning tasks executability and projection in the corresponding action formalism.

Decidable Reasoning in a Modified Situation Calculus

TLDR
A modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers is considered, showing that the projection and executability problems are decidable in the modified version even if an initial knowledge base is incomplete and open.

A Logic For Decidable Reasoning About Services

TLDR
A modified version of the situation calculus is considered using a two-variable fragment of the first-order logic extended with counting quantifiers and it is shown that the projection problem is deci dable in the modified version.

Reconciling Situation Calculus and Fluent Calculus

TLDR
A formal translation between domain axiomatizations of the Situation Calculus and the Fluent Calculus is developed and presented, which allows an automatic translation of Golog domain descriptions and execution of GOLOG programs with FLUX.

Updating Description Logic ABoxes

TLDR
This paper considers the problem of updating ABoxes when the state changes and analyzes such basic ABox updates in several standard DLs by investigating whether the updated ABox can be expressed in these DLs and, if so, whether it is computable and what is its size.

On the Update of Description Logic Ontologies at the Instance Level

TLDR
This work provides a general semantics for instance level update in Description Logics, and shows that DL-Lite is closed with respect to instancelevel update, in the sense that the result of an update is always expressible as a new DL- lite ABox.

The Description Logic Handbook: Theory, Implementation, and Applications

TLDR
This new edition of The Description Logic Handbook provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications.

Embracing Causality in Specifying the Indirect Effects of Actions

TLDR
A new ternary predicate Caused is introduced into the situation calculus: Caused (p,v,s) if the proposition p is caused (by something unspecified) to have the truth value v in the state s, which can represent not only action-triggered causal statements such as that the action load causes the gun to be loaded, but also fluent- Triggered ones such as the fact that the switch is in the up position causes the lamp to be on.

Ramification and Causality