Results 1  10
of
1,098,639
More on modal aspects of default logic
 Fundamenta Informaticae
, 1992
"... Abstract. Investigations of default logic have been so far mostly concerned with the notion of an extension of a default theory. It turns out, however, that default logic is much richer. Namely, there are other natural classes of objects that might be associated with default reasoning. We study two ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
such classes of objects with emphasis on their relations with modal nonmonotonic formalisms. First, we introduce the concept of a weak extension and study its properties. It has long been suspected that there are close connections between default and autoepistemic logics. The notion of weak extension allows us
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 1308 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
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 1012 (7 self)
 Add to MetaCart
possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1042 (73 self)
 Add to MetaCart
programs and disjunctive databases more easily when classical negation is available. Computationally, classical negation can be eliminated from extended programs by a simple preprocessor. Extended programs are identical to a special case of default theories in the sense of Reiter. 1
Applications Of Circumscription To Formalizing Common Sense Knowledge
 Artificial Intelligence
, 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract

Cited by 532 (12 self)
 Add to MetaCart
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects
Bayesian Description Logics. In:
 Proc. of DL’14. CEUR Workshop Proceedings,
, 2014
"... Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints; moda ..."
Abstract

Cited by 395 (49 self)
 Add to MetaCart
; modal, epistemic, and temporal operators; probabilities and fuzzy logic; and defaults. On the other hand, it considers nonstandard inference problems for Description Logics, i.e., inference problems thatunlike subsumption or instance checkingare not available in all systems, but have turned out
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 455 (102 self)
 Add to MetaCart
problems of lower complexity in a simpler and more natural fashion. This paper presents the DLV system, which is widely considered the stateoftheart implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 454 (37 self)
 Add to MetaCart
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting
Modal Interpretations of Default Logic
"... In the paper we study a new and natural modal interpretation of defaults. We show that under this interpretation there are whole families of modal nonmonotonic logics that accurately represent default reasoning. One of these logics is used in a definition of possibleworlds semantics for default log ..."
Abstract
 Add to MetaCart
In the paper we study a new and natural modal interpretation of defaults. We show that under this interpretation there are whole families of modal nonmonotonic logics that accurately represent default reasoning. One of these logics is used in a definition of possibleworlds semantics for default
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 272 (12 self)
 Add to MetaCart
are preserved under partial isomorphism, by a simple induction. More precisely, one proves, for any assignment A and any partial isomorphism IÎI which is defined on the Avalues for all variables x 1 , ..., x k , that M, A = f iff N , IoA = f . The crucial step in the induction is the quantifier case
Results 1  10
of
1,098,639