Saturation, nonmonotonic reasoning and the closed-world assumption
Artificial Intelligence
The SUPREM architecture: a new intelligent paradigm
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
On the satisfiability of circumscription
Artificial Intelligence
Circumscription and implicit definability
Journal of Automated Reasoning
Journal of Computer and System Sciences
Data independent recursion in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Readings in nonmonotonic reasoning
On the computability of circumscription
Information Processing Letters
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
On computing restricted projections of representative instances
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
Existential second-order logic over strings
Journal of the ACM (JACM)
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
Second-Order Logic over Strings: Regular and Non-regular Fragments
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An incremental algorithm for generating all minimal models
Artificial Intelligence
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
An incremental algorithm for generating all minimal models
Artificial Intelligence
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
First-order expressibility and boundedness of disjunctive logic programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On the tractability of minimal model computation for some CNF theories
Artificial Intelligence
| Hi-index | 0.03 |
The effects of circumscribing first-order formulas are explored from a computational standpoint. First, extending work of V. Lifschitz, it is Shown that the circumscription of any existential first-order formula is equivalent to a first-order formula. After this, it is established that a set of universal Horn clauses has a first-order circumscription if and only if it is bounded (when considered as a logic program); thus it is undecidable to tell whether such formulas have first-order circumscription. Finally, it is shown that there arefirst-order formulas whode circumscription has a coNP-complete model-checking problem.