Results 11 to 20 of about 1,092 (104)

Methods for Solving Necessary Equivalences [PDF]

, 2004
Nonmonotonic Logics such as Autoepistemic Logic, Reflective Logic, and Default Logic, are usually defined in terms of set-theoretic fixed-point equations defined over deductively closed sets of sentences of First Order Logic.
Brown, Frank
core  

Knowledge, Causality and Temporal Representation [PDF]

, 1992
In this paper, a formal semantic framework is developed in order to account for the temporal semantics of text. The theory is able to represent and reason about both semantic issues, which are independent of world knowledge (wk), and pragmatic issues,
Lascarides, Alex
core   +2 more sources

Representing Autoepistemic Logic in Modal Logic [PDF]

, 2003
The nonmonotonic logic called Autoepistemic Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5.
Brown, Frank
core  

Multi-Agent Only Knowing

, 2000
Levesque introduced a notion of ``only knowing'', with the goal of capturing certain types of nonmonotonic reasoning. Levesque's logic dealt with only the case of a single agent.
Halpern, Joseph Y., Lakemeyer, Gerhard
core   +2 more sources

Optimizing the computation of overriding

, 2015
We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and ...
BC Grau, E Sandewall, F Baader, F Baader, FM Donini, G Casini, G Casini, G Casini, L Giordano, L Giordano, PA Bonatti, PA Bonatti, PA Bonatti, PA Bonatti, R Stevens, T Lukasiewicz, TYC Woo, W Drabent   +17 more
core   +1 more source

Space Efficiency of Propositional Knowledge Representation Formalisms [PDF]

, 2000
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. 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.
Cadoli, M., Donini, F. M., Liberatore, P., Schaerf, M.   +3 more
core   +3 more sources

Multi-Agent Only-Knowing Revisited [PDF]

, 2010
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavior within a monotonic logic. Despite its appeal, all attempts to extend only-
Belle, Vaishak, Lakemeyer, Gerhard
core   +2 more sources

Knowledge Compilation of Logic Programs Using Approximation Fixpoint Theory

, 2015
To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015 Recent advances in knowledge compilation introduced techniques to compile \emph{positive} logic programs into propositional logic, essentially exploiting the ...
BART BOGAERTS, Cadoli, Darwiche, Fierens, GUY VAN DEN BROECK, Janhunen, Lin, Pelov, Strass   +8 more
core   +1 more source

Ultimate approximations in nonmonotonic knowledge representation systems [PDF]

, 2002
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering.
Denecker, Marc, Marek, Victor W., Truszczynski, Miroslaw   +2 more
core   +2 more sources

A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems [PDF]

, 2003
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p system, which allows for local inconsistency handling. We then characterise the
Franconi, Enrico, Kuper, Gabriel, Lopatenko, Andrei, Serafini, Luciano   +3 more
core   +3 more sources