Terminating Tableaux for Hybrid Logic with Eventualities

13 years 8 months ago

Download www.ps.uni-saarland.de

x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision procedures.

Mark Kaminski, Gert Smolka

Real-time Traffic

CADE 2010 | Decision Procedures | Elegant Correctness Proof | Logical Reasoning | Propositional Reasoning |

claim paper

» Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies

» Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse

» Lightweight hybrid tableaux

» Tableaux and Model Checking for Memory Logics

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	CADE
Authors	Mark Kaminski, Gert Smolka

Comments (0)

Sciweavers

Terminating Tableaux for Hybrid Logic with Eventualities

CADE 2010 | Decision Procedures | Elegant Correctness Proof | Logical Reasoning | Propositional Reasoning |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers