The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 1659 of Mathematical Reviews Vol. , Issue 94c
[page]
1994
Mathematical Reviews
Preserved Fulltext
The author considers the complexity of model-checking for propo- sitional circumscription. ...
The paper gives a detailed analysis of the complexity of model- checking for propositional circumscriptive formulas, for different sets S of logical connectives used in formulas. ...
Complexity of Nested Circumscription and Nested Abnormality Theories
[article]
2002
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (NATs) as a tool for modular ...
Finally, we also study extensions of NATs and briefly address the complexity in the first-order case. Our results give insight into the "cost" of using L_CIRC (resp. ...
We are grateful to the referees of the preliminary conference version of this paper, which had a number of useful suggestions for improvements. ...
arXiv:cs/0207072v1
fatcat:lcl3amf7pjh7lmt2zhhj4eptn4
Checking the Size of Circumscribed Formulae
2014
International Journal of Advanced Research in Artificial Intelligence (IJARAI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, the complexity of deciding whether CIRC(T ) is equivalent to a formula of size bounded by k is studied. ...
The circumscription of a propositional formula T may not be representable in polynomial space, unless the polynomial hierarchy collapses. ...
ACKNOWLEDGEMENTS The author expresses his profound gratitude to Roberto Baldoni and Marco Schaerf for their unvaluable suggestions during the writing of this article. ...
doi:10.14569/ijarai.2014.031205
fatcat:35smqqgyt5etjhw7mgwpnuvgae
Inverse Circumscription
2003
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This pa per formalizes and studies the inverse circumscription problem, which (roughly speaking) is to de cide, given a set of models, if there exists a formula whose circumscription describes the input ...
Inverse (or identification) problems involve decid ing whether or not an explicitly given set of data points have an implicit description, for instance, in the form of a constraint network. ...
The author wishes to thank Bart Selman for useful discussions and suggestions, and Joe Halpern for his advice on the preparation of the final version of this paper. ...
dblp:conf/ijcai/Chen03
fatcat:asla3oerx5civdmbz3tivwj2ye
On the counting complexity of propositional circumscription
2008
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Propositional circumscription, asking for the minimal models of a Boolean formula, is an important problem in artificial intelligence, in data mining, in coding theory, and in the model checking based ...
We consider the counting problems of propositional circumscription for several subclasses with respect to the structure of the formula. ...
On the other hand, the counting complexity of circumscription for Horn and 2affine formulas is in FP. ...
doi:10.1016/j.ipl.2007.11.006
fatcat:r2rvndeohvaf3o3fs4oy6dt2he
On compact representations of propositional circumscription
1997
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We find necessary and sufficient conditions for the existence of polynomial-size representations (formulae, data structures) equivalent to the circumscription of T in the three cases. ...
In this paper we investigate the size of representations (formulae, data structures) equivalent to the circumscription of a propositional formula 7', taking into account three different definitions of ...
Acknowledgements The authors are grateful to Pierluigi Crescenzi for an interesting discussion on the non-uniform polynomial hierarchy and to Phokion Kolaitis for suggesting to us to investigate "inverse ...
doi:10.1016/s0304-3975(96)00182-x
fatcat:6hnlknoxznbqzgek2ye4rjzqk4
The Complexity of Circumscriptive Inference in Post's Lattice
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
With its help, we determine the complexity of circumscriptive inference for all but two possible classes of Boolean functions. ...
In this paper, we study the computational complexity of several formalizations of inference in propositional circumscription for the case that the knowledge base is described by a propositional theory ...
We determine the complexity of inference of a B-formula from the circumscription of a set of B-formulae, written CircINF(B), for all finite sets B, except for the case that only affine functions based ...
doi:10.1007/978-3-642-04238-6_25
fatcat:nclnbcn5q5hanhknwawmkifzai
The Complexity of Circumscriptive Inference in Post's Lattice
2011
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
With its help, we determine the complexity of circumscriptive inference for all but two possible classes of Boolean functions. ...
In this paper, we study the computational complexity of several formalizations of inference in propositional circumscription for the case that the knowledge base is described by a propositional theory ...
We determine the complexity of inference of a B-formula from the circumscription of a set of B-formulae, written CircINF(B), for all finite sets B, except for the case that only affine functions based ...
doi:10.1007/s00224-010-9311-6
fatcat:dyjuk3c3kfbelpd5zhp2zoub3e
Space Efficiency of Propositional Knowledge Representation Formalisms
2000
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, we consider formalisms for nonmonotonic reasoning, such as circumscription and default logic, as well as belief revision operators and the stable model semantics for logic programs with ...
Intuitively, the space efficiency of a formalism F in representing a certain piece of knowledge A, is the size of the shortest formula of F that represents A. ...
Acknowledgments This paper is an extended and revised version of a paper by the same authors appeared in the proceedings of the fifth international conference on the principles of knowledge representation ...
doi:10.1613/jair.664
fatcat:mimtpnqjwfbzbnuycb6uv4lwqe
A survey of complexity results for non-monotonic logics
1993
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We not only give results about the tractability/intractability of the individual problems but we also analyze sources of complexity and explain intuitively the nature of easy/hard cases. ...
This paper surveys the main results appearing in the literature on the computational complexity of non-monotonic inference tasks. ...
Model Checking Kolaitis and Papadimitriou [771 noticed that the complexity of circumscription seems to arise even in the problem of model checking. ...
doi:10.1016/0743-1066(93)90029-g
fatcat:iewbxiclhbbwzeayv6esr2c5ei
System f2lp – Computing Answer Sets of First-Order Formulas
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Based on the relationship between stable models and circumscription, f2lp can also serve as a reasoning engine for general circumscriptive theories. ...
We present an implementation of the general language of stable models proposed by Ferraris, Lee and Lifschitz. ...
This work was partially supported by the National Science Foundation under Grant IIS-0839821. ...
doi:10.1007/978-3-642-04238-6_51
fatcat:pgvvrlmkbvdyzpt2jrjepgrhaq
Complexity of Non-Monotonic Logics
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
objects (e.g., models of a formula) but asks for their number. ...
We describe complexity results for fragments of logical languages obtained by either restricting the allowed set of operators (e.g., forbidding negations one might consider only monotone formulae) or by ...
Key to the classification is that if the set B of all available Boolean functions is monotone, then the circumscriptive model checking problem Turing-reduces to the the model checking problem for monotone ...
arXiv:1009.1990v1
fatcat:wxlr4opy2rez7mgoo2pdcq3fyu
Propositional circumscription and extended closed-world reasoning are ΠP2-complete
1993
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgment The authors are grateful to the referees for suggesting improvements to the draft of this paper. ...
Other complexity results concerning model checking are provided by Kolaitis and Papadimitriou in [ 181. ...
Lemma 3.1 also marks a boundary of the complexity of deduction from the minimal models of a theory T that is in KNF for constant k. Indeed, for k = 2, deduction is no longer II! ...
doi:10.1016/0304-3975(93)90073-3
fatcat:6wn6wewv5jew3iqrecuoig4ihq
Knowledge Forgetting in Circumscription: A Preliminary Report
2015
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
A sound and complete algorithm for the forgetting is developed and an analysis of computational complexity is given. ...
Several useful properties of the new forgetting are proved, which demonstrate suitability of the forgetting for circumscription. ...
Acknowledgement We thank reviewers for their helpful comments. ...
doi:10.1609/aaai.v29i1.9419
fatcat:p5f255hm2be47iqeri5eqrkc4i
Reasoning under minimal upper bounds in propositional logic
2006
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On the other hand, we also present cases of lower complexity, and in particular cases in which the complexity is located, just as for ordinary minimal model reasoning, at the second level of the Polynomial ...
Reasoning from the minimal models of a theory, as fostered by circumscription, is in the area of Artificial Intelligence an important method to formalize common sense reasoning. ...
Acknowledgments We thank our colleagues and readers of preliminary versions of this paper, as well as the referees for their useful comments. ...
doi:10.1016/j.tcs.2006.07.054
fatcat:ecmaj6kbl5a6fp7iooryqok3gm
« Previous
Showing results 1 — 15 out of 1,450 results