Results 41 to 50 of about 763,157 (113)
Reflexive autoepistemic logic and logic programming
, 1993 Luı́s Moniz Pereira, Anil Nerode
semanticscholar +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Epistemic Entrenchment in Autoepistemic Logic
Fundamenta Informaticae, 1992A drawback of existing epistemic logics is their inability to deal with entrenchment of beliefs. All beliefs have equal status; none can be held more firmly than others. We present a bimodal logic that generalizes Levesque’s reconstruction of autoepistemic logic. In our system standard epistemic concepts can be represented, including the notion of only
Craig Boutilier
semanticscholar +3 more sources
Prioritized Autoepistemic Logic
European Conference on Logics in Artificial Intelligence, 1994An important problem in data and knowledge representation is the possibility of default rules that conflict. If the application of both of two default rules leads to a contradiction, they cannot both be applied. Systems that support the use of default rules may either remain indifferent or prioritize one rule over the other. In this paper a prioritized
J. Rintanen
semanticscholar +2 more sources
Decision Procedure for Autoepistemic Logic
CADE, 1988Autoepistemic logic is a nonmonotonic logic for modeling the beliefs of an ideally rational agent who reflects on his own beliefs. Autoepistemic logic has been lacking a decision procedure to answer the question: given a set of premises describing the beliefs of an agent does the agent believe a given formula (is the given formula derivable from the ...
I. Niemelä
semanticscholar +2 more sources
Formalization of Inheritance Reasoning in Autoepistemic Logic
Fundamenta Informaticae, 1990Current research in the area of nonmonotonic reasoning suggests that autoepistemic logic provides a general framework for formalizing commonsense reasoning in various domains of discourse. The goal of this paper is to investigate the suitability of autoepistemic logic for formalization of some forms of inheritance reasoning.
M. Gelfond, H. Przymusinska
semanticscholar +3 more sources
Revisiting quantification in autoepistemic logic
ACM Transactions on Computational Logic, 2002In this article, we introduce first-order autoepistemic logic. Our definition is semantical and is based on the intuition similar to that lying behind the definition of first-order default logic.
M. Kaminski, Guy Rey
semanticscholar +2 more sources
Stable Theories in Autoepistemic Logic
Fundamenta Informaticae, 1989 We investigate the operator producing a stable theory out of its objective part (A stable theory is a set of beliefs of a rational agent). We characterize the objective parts of stable theories. Finally, we discuss the predicate calculus case.
W. Marek
openalex +3 more sources
Decision Problems in Autoepistemic Logic
2010 International Conference on Computing, Control and Industrial Engineering, 2010In this paper we will prove the complexity of three main problems in the context of autoepistemic logic. The first problem is the question if a set of premise sum has a stable expansion. The second is if a given formula exists in at least one stable expansion, this problem is also known as brave reasoning.
Wei Gong, Jie Zhou
semanticscholar +2 more sources
Autoepistemic Logic and Introspective Circumscription
, 1994 We investigate the relationship between two epistemic nonmonotonic formalisms: autoepistemic logic and introspective circumscription. Finitely axiomatized autoepistemic theories are shown to be equivalent to the propositional case of introspective circumscription. This theorem is applied to the problem of relating the usual "minimizing" circumscription
Michael Gelfond +3 more
openalex +2 more sources
, 1991 We present in this paper a new logic, called dynamic autoepistemic logic (DAL), to catch the dynamic nature of the reasoner's introspection in autoepistemic logic. We show that (1) multiple levels of exceptions can be naturally represented, and (2) unintended expansions commonly occurring in autoepistemic logic can be removed. We impose polynomial-time
Kienchung Kuo
openalex +2 more sources