First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
First-order modal logic
Modal logic
Types, Tableaus, and Godel's God
Types, Tableaus, and Godel's God
Natural Deduction for First-Order Hybrid Logic
Journal of Logic, Language and Information
Testing XML constraint satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
COMMON-SENSE SPATIAL REASONING FOR INFORMATION CORRELATION IN PERVASIVE COMPUTING
Applied Artificial Intelligence
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Combining logics in simple type theory
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Business process monitoring with BPath
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Verifying the modal logic cube is an easy task: for higher-order automated reasoners
Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners
Verification, induction termination analysis
A hybrid logic for commonsense spatial reasoning
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Combining and automating classical and non-classical logics in classical higher-order logics
Annals of Mathematics and Artificial Intelligence
Automated reasoning about metric and topology
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Higher-order aspects and context in SUMO
Web Semantics: Science, Services and Agents on the World Wide Web
| Hi-index | 0.00 |
We present a (sound and complete) tableau calculus for Quantified Hybrid Logic (QHL). QHL is an extension of orthodox quantified modal logic: as well as the usual 驴 and 驴 modalities it contains names for (and variables over) states, operators @s for asserting that a formula holds at a named state, and a binder 驴 that binds a variable to the current state. The first-order component contains equality and rigid and non-rigid designators. As far as we are aware, ours is the first tableau system for QHL.Completeness is established via a variant of the standard translation to first-order logic. More concretely, a valid QHL-sentence is translated into a valid first-order sentence in the correspondence language. As it is valid, there exists a first-order tableau proof for it. This tableau proof is then converted into a QHL tableau proof for the original sentence. In thisway we recycle a well-known result (completeness of first-order logic) instead of a well-known proof.The tableau calculus is highly flexible.We only present it for the constant domain semantics, but slight changes render it complete for varying, expanding or contracting domains. Moreover, completeness with respect to specific frame classes can be obtained simply by adding extra rules or axioms (this can be done for every first-order definable class of frames which is closed under and reflects generated subframes).