Results 1  10
of
259,936
Nonmonotonic modal logic of belief
"... We propose an alternative nonmonotonic modal formalism called nonmonotonic modal logic of belief. It is based on replacing the classical fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬ϕ}) with the belief fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬Mϕ}). The solutions of the belief fixpoint equation, ca ..."
Abstract
 Add to MetaCart
We propose an alternative nonmonotonic modal formalism called nonmonotonic modal logic of belief. It is based on replacing the classical fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬ϕ}) with the belief fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬Mϕ}). The solutions of the belief fixpoint equation
ManyValued NonMonotonic Modal Logics
, 1992
"... Among nonmonotonic systems of reasoning, nonmonotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been establi ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Among nonmonotonic systems of reasoning, nonmonotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
, 1990
"... Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns of ..."
Abstract

Cited by 624 (14 self)
 Add to MetaCart
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1008 (7 self)
 Add to MetaCart
the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
On Undecidability of Nonmonotonic Logic
"... Abstract. The degree of undecidability of nonmonotonic logic is investigated. A proof is provided that arithmetical but not recursively enumerable sets of sentences definable by nonmonotonic default logic are elements of Δn+1 but not Σn nor Πn for some n ≥ 1 in KleeneMostowski hierarchy of arithmet ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The degree of undecidability of nonmonotonic logic is investigated. A proof is provided that arithmetical but not recursively enumerable sets of sentences definable by nonmonotonic default logic are elements of Δn+1 but not Σn nor Πn for some n ≥ 1 in KleeneMostowski hierarchy
Results 1  10
of
259,936