Updating logical databases
On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Complexity of Two-Variable Logic with Counting
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Complexity of the Two-Variable Fragment with Counting Quantifiers
Journal of Logic, Language and Information
On the update of description logic ontologies at the instance level
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Integrating Action Calculi and Description Logics
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Property persistence in the situation calculus
Artificial Intelligence
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
Journal of Automated Reasoning
WSSL: a fluent calculus-based language for web service specifications
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
Hi-index | 0.00 |
We consider a modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers. We mention several additional groups of axioms that can be introduced to capture taxonomic reasoning. We show that the regression operator in this framework can be defined similarly to regression in the Reiter's version of the situation calculus. Using this new regression operator, we show that the projection and executability problems are decidable in the modified version even if an initial knowledge base is incomplete and open. For an incomplete knowledge base and for context-dependent actions, we consider a type of progression that is sound with respect to the classical progression. We show that the new knowledge base resulting after our progression is definable in our modified situation calculus if one allows actions with local effects only. We mention possible applications to formalization of Semantic Web services.