Filters








342 Hits in 5.3 sec

A decision method for nonmonotonic reasoning based on autoepistemic reasoning

Ilkka Niemel�
1995 Journal of automated reasoning  
Prominent formalizations of nonmonotonic reasoning, such as default logic and circumscription, can be embedded into autoepistemic logic based on Lhierarchic expansions using simple local translations.  ...  Hence, the method can serve as a unified reasoning tool for a wide range of forms of nonmonotonic reasoning.  ...  We consider the propositional case and a rather general notion of minimal models.  ... 
doi:10.1007/bf00883929 fatcat:fybv5fvpyjbdbnuppyqogbigk4

The Fourth International Workshop on Nonmonotonic Reasoning

David W. Etherington, Henry A. Kautz
1994 The AI Magazine  
Formal semantics, closing the loop: Research in nonmonotonic reasoning has given rise to many novel semantic constructions: minimal models for circumscription, perfect models for logic programming, Computational  ...  Both Georg Gottlob (Technische Universitat Wien) and Jonathan Stillman (General Electric Research and Development Center) showed that a variety of propositional nonmonotonic-reasoning tasks are Σ P 2 complete  ... 
doi:10.1609/aimag.v15i3.1104 dblp:journals/aim/EtheringtonK94 fatcat:bkfffknjtneufc3o2zjsdlzwdu

Default Reasoning over Domains and Concept Hierarchies [chapter]

Pascal Hitzler
2004 Lecture Notes in Computer Science  
Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1].  ...  This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain.  ...  Amongst other things, they establish a sound and complete resolution rule and a form of disjunctive logic programming over domains. A corresponding semantic operator turns out to be Scott-continuous.  ... 
doi:10.1007/978-3-540-30221-6_27 fatcat:3hjbyv545jhrbfkmpl5da5kxfe

Default reasoning over domains and concept hierarchies [article]

Pascal Hitzler
2004 arXiv   pre-print
Rounds and G.-Q. Zhang (2001) have proposed to study a form of disjunctive logic programming generalized to algebraic domains.  ...  This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain.  ...  Amongst other things, they establish a sound and complete resolution rule and a form of disjunctive logic programming over domains. A corresponding semantic operator turns out to be Scott-continuous.  ... 
arXiv:cs/0409002v1 fatcat:da6xza4pr5c5hjukkz4pjoa64i

NONMONOTONIC REASONING BY INHIBITION NETS II

HANNES LEITGEB
2003 International Journal of Uncertainty Fuzziness and Knowledge-Based Systems  
In [6] it has been proved that the system CL (introduced by KLM[5], pp.186-189) of nonmonotonic reasoning is sound and complete with respect to the inferences drawn by interpreted finite hierarchical inhibition  ...  and complete with respect to one of the classes.  ...  antitone networks, relative to which P is both sound and complete as we will prove later.  ... 
doi:10.1142/s0218488503002454 fatcat:ejvi76cvnjbrrejly4dkefcj5i

Notes on Nonmonotonic Autoepistemic Propositional Logic

Marek A. Suchenek
2011 Zeszyty Naukowe  
Then it narrowly investigates minimal expansion semantics for autoepistemic propositional logic and its "only knowing" consequence operation CnAE.  ...  completeness theorem.  ...  More generally, one can use mapping H of Section 7 to translate the completeness theorem of prioritized closed-world assumption with respect to hierarchically minimal model semantics (thm. 5.5 in [SS90  ... 
doi:10.26348/znwwsi.6.74 doaj:c6340de35be34085b8bb73eec7d6a7e1 fatcat:li3oy2wacfgffklqj7cpniycpy

Two Logical Theories of Plan Recognition

W. Wobcke
2002 Journal of Logic and Computation  
The logics incorporate a sound and complete theory of temporal intervals based on Allen's approach, enabling the plan recognition agent to handle temporal information relating multiple observations.  ...  However, Ladkin and Maddux [32], in work cited in Ladkin [31] , claim that Allen's logic is complete  ...  My knowledge of situation semantics has been greatly enhanced by discussions with Greg Restall and Lawrence Cavedon; thanks also to David Israel and John Perry for hosting my sabbatical at CSLI.  ... 
doi:10.1093/logcom/12.3.371 fatcat:a7xg4aawu5el5msu2kgscxhtau

Page 2423 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
The appendix gives soundness and completeness proofs for the logic.  ...  Our approach also has a modular metatheory; sound- 03B General logic 2000d:03029 ness, completeness and normalization are proved uniformly for every logic in our class.  ... 

Interpreted Dynamical Systems and Qualitative Laws: from Neural Networks to Evolutionary Systems

Hannes Leitgeb
2005 Synthese  
correctly and, in a sense, even completely by qualitative laws that obey the rules of a nonmonotonic logic system.  ...  We show that the systems C and CL of nonmonotonic logic are adequate with respect to the corresponding description of the classes of interpreted ordered and interpreted hierarchical systems, respectively  ...  We have been able to prove soundness and completeness results for each of the cumulative systems of nonmonotonic logic in Kraus et al.  ... 
doi:10.1007/s11229-005-9086-5 fatcat:nz6y7ldy45fatp6k437d5lirhq

Logic-Based Knowledge Representation [chapter]

Franz Baader
1999 Lecture Notes in Computer Science  
After a short analysis of the requirements that a knowledge representation language must satisfy, we introduce Description Logics, Modal Logics, and Nonmonotonic Logics as formalisms for representing,  ...  At the end of each section, we brie y comment on the connection to Logic Programming.  ...  The propositional multi-modal logic K n extends propositional logic by n pairs of unary operators, which are called box and diamond operators.  ... 
doi:10.1007/3-540-48317-9_2 fatcat:udsbpeh5anenzcktptdb4g7w34

Nonmonotonic reasoning by inhibition nets☆☆This paper has been supported by the Austrian Research Fund FWF (SFB F012)

Hannes Leitgeb
2001 Artificial Intelligence  
It will be proven that the system CL (introduced by KLM in [Artificial Intelligence 44 (1990) 186-189]) of nonmonotonic logic is both sound and complete with respect to the inferences drawn by finite hierarchical  ...  The latter class of inhibition nets is shown to correspond to the class of finite, normal, hierarchical logic programs concerning dynamics, and also to the class of binary, layered, input-driven artificial  ...  , and of the "superposition" of states.  ... 
doi:10.1016/s0004-3702(01)00073-x fatcat:sha73gjqgbaopolgt5p524hblq

Computing minimal models by partial instantiation

Vadim Kagan, Anil Nerode, V.S. Subrahmanian
1996 Theoretical Computer Science  
It is also well known that the minimal models of logic programs are closely related to the so-called stable models of logic programs with nonmonotonic negation in clause bodies, as well as to circumscription  ...  In this paper, we show how, given any method M which correctly computes the set of minimal models of a propositional logic program, we can develop a strategy to compute truth in a minimal model of a disjunctive  ...  We thank the referee for useful comments, and for finding several errors.  ... 
doi:10.1016/0304-3975(94)00216-9 fatcat:cabzzl6khfhi7iqcufivsuippe

Forthcoming Papers

2001 Artificial Intelligence  
Learning logic programs with structured background knowledge The efficient learnability of restricted classes of logic programs is studied in the PAC framework of computational learning theory.  ...  For this purpose, we generalize well-known methods for constraint propagation, determination of consistency and computation of the minimal network from simpler schemes that only allow for binary relations  ...  It will be proven that the system CL (introduced by KLM in [Artificial Intelligence 44 (1990) 186-189] ) of nonmonotonic logic is both sound and complete with respect to the inferences drawn by finite  ... 
doi:10.1016/s0004-3702(01)00078-9 fatcat:42lyaie2lna2zbvmj6afulcyfq

Page 4936 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
We show that the inference rules for fuzzy functional dependencies are sound and complete.  ...  Summary: “We introduce a hierarchical structure for the represen- tation of fuzzy if-then rules of the type used in modeling fuzzy systems.  ... 

Is intractability of nonmonotonic reasoning a real drawback?

Marco Cadoli, Francesco M. Donini, Marco Schaerf
1996 Artificial Intelligence  
In particular, we prove that nonmonotonic formalisms such as circumscription and default logic allow for a much more compact and natural representation of propositional knowledge than propositional calculus  ...  We present prototypical scenarios where closed-world reasoning and well-founded semantics account for a faster, complete and unsound approximation of classical reasoning. * This is an extended and revised  ...  Acknowledgements The authors are grateful to the anonymous referees for their comments and suggestions.  ... 
doi:10.1016/s0004-3702(96)00009-4 fatcat:crif2n3jwnbvvfhdbjrejymstq
« Previous Showing results 1 — 15 out of 342 results