An algorithm to compute circumscription
Artificial Intelligence
Modal resolution in clausal form
Theoretical Computer Science
The complexity of existential quantification in concept languages
Artificial Intelligence
Characterizing diagnoses and systems
Artificial Intelligence
Modal logic
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating most specific concepts in description logics with existential restrictions
AI Communications - Special issue on KI-2001
Extending abduction from propositional to first-order logic
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
The description logic handbook
The Description Logic Handbook
The Description Logic Handbook
A survey on knowledge compilation
AI Communications
Combining Syntax and Semantics through Prime Form Representation
Journal of Logic and Computation
Prime implicates and prime implicants in modal logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Prime implicate normal form for ALC concepts
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Distributed reasoning in a peer-to-peer setting: application to the semantic web
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
A logical account of relevance
IJCAI'95 Proceedings of the 14th 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
Knowledge compilation for belief change
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Prime forms and minimal change in propositional belief bases
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be appropriately extended from propositional logic to the modal logic κ. We begin the paper by considering a number of potential definitions of clauses and terms for κ. The different definitions are evaluated with respect to a set of syntactic, semantic, and complexity-theoretic properties characteristic of the propositional definition. We then compare the definitions with respect to the properties of the notions of prime implicates and prime implicants that they induce. While there is no definition that perfectly generalizes the propositional notions, we show that there does exist one definition which satisfies many of the desirable properties of the propositional case. In the second half of the paper, we consider the computational properties of the selected definition. To this end, we provide sound and complete algorithms for generating and recognizing prime implicates, and we show the prime implicate recognition task to be Pspace-complete. We also prove upper and lower bounds on the size and number of prime implicates. While the paper focuses on the logic κ, all of our results hold equally well for multi-modal κ and for concept expressions in the description logic ALC.