Anti-prenexing and prenexing for modal logics

Authors:
Cláudia Nalon;Clare Dixon
Affiliations:
Departamento de Ciência da Computação, Universidade de Brasília, Brasília DF, Brazil;Department of Computer Science, University of Liverpool, Liverpool, United Kingdom
Venue:
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Year:
2006

Citing 6
Cited 1

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Reasoning about knowledge

Reasoning about knowledge
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
On the Value of Antiprenexing

LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge

TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)

Clausal resolution for normal modal logics

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient proof methods for normal modal logics are highly desirable, as such logical systems have been widely used in computer science to represent complex situations. Resolution-based methods are often designed to deal with formulae in a normal form and the efficiency of the method (also) relies on how efficient (in the sense of producing fewer and/or shorter clauses) the translation procedure is. We present a normal form for normal modal logics and show how the use of simplification, for specific normal logics, together with anti-prenexing and prenexing techniques help us to produce better sets of clauses.