Journal article icon

Journal article

Reasoning under minimal upper bounds in propositional logic

Abstract:

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. However, as it appears, minimal models may not always be suitable to capture the intuitive semantics of a knowledge base, aiming intuitively at an exclusive interpretation of disjunctions of atoms, i.e., if possible then assign at most one of the disjuncts the value true in a model. In this paper, we consider an appro...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.tcs.2006.07.054

Authors


More by this author
Institution:
Vienna University of Technology
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Name:
Austrian Science Fund FWF
Grant:
Z29-N04
More from this funder
Name:
European Union Network of Excellence
Grant:
IST-2001-33570 COLOGNET
Publisher:
Elsevier
Journal:
Theoretical Computer Science More from this journal
Volume:
369
Issue:
1-3
Pages:
82–115
Publication date:
2006-12-01
DOI:
ISSN:
0304-3975
Language:
English
Keywords:
Subjects:
UUID:
uuid:f8b0be29-7c50-45c9-b456-603e11b6f36e
Local pid:
ora:10768
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP