Situation Calculus as Hybrid Logic: First Steps
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Query Answering in Description Logics: The Knots Approach
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Terminological reasoning in SHIQ with ordered binary decision diagrams
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
PHI: a logic-based tool for intelligent help systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A guide to the modal logics of knowledge and belief: preliminary draft
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Query answering in description logics with transitive roles
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
Reasoning about actions using description logics with general TBoxes
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Constructive formalization of hybrid logic with eventualities
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
The Nondeterministic Information Logic NIL is PSPACE-complete
Fundamenta Informaticae
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 6th Balkan Conference in Informatics
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 0.00 |
We briefly survey the major proposals for models of programs and show that they all lead to the same propositional theory of programs. Methods of algebraic logic dominate in the proofs. One of the connections made between the models, that involving language models, is quite counterintuitive. The common theory has already been shown to be complete in deterministic exponential time; we give here a simpler proof of the upper bound.