Results 1  10
of
5,507
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 626 (14 self)
 Add to MetaCart
of view are developed in parallel. The former point of view was pioneered by D. Gabbay in [10], while the latter has been advocated by Y. Shoham in [38]. Five such families are defined and characterized by representation theorems, relating the two points of view. One of the families of interest
Hybrid Logics: Characterization, Interpolation and Complexity
 Journal of Symbolic Logic
, 1999
"... Hybrid languages are expansions of propositional modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work (for example [BS98, BT98a, BT99]) has focussed on a more constrained system called H(#; @). We sho ..."
Abstract

Cited by 109 (36 self)
 Add to MetaCart
show in detail that H(#; @) is modally natural. We begin by studying its expressivity, and provide model theoretic characterizations (via a restricted notion of EhrenfeuchtFrasse game, and an enriched notion of bisimulation) and a syntactic characterization (in terms of bounded formulas). The key
Logical characterizations of heap abstractions
, 2003
"... Abstract. Shape analysis concerns the problem of determining “shape invariants” for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed, using an abstract interpretation based on 3valued firstorder logic. In ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
be characterized using formulas in firstorder logic with transitive closure. We also define a nonstandard (“supervaluational”) semantics for 3valued firstorder logic that is more precise than a conventional 3valued semantics, and demonstrate that it can be effectively implemented using existing theorem
The empirical case for two systems of reasoning
, 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract

Cited by 669 (4 self)
 Add to MetaCart
Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations
Logical Characterizations of LOGSPACE
"... Bounded arithmetic is a branch of mathematical logic which characterize various classes of computational complexity by fragments of arithmetical theories. On the other hand, descriptive complexity gives another logical method to characterize complexity classes. However, until recently, no ac ..."
Abstract
 Add to MetaCart
Bounded arithmetic is a branch of mathematical logic which characterize various classes of computational complexity by fragments of arithmetical theories. On the other hand, descriptive complexity gives another logical method to characterize complexity classes. However, until recently, no ac
Logical Characterizations of Complexity Classes
, 1997
"... Introduction Prior to 1974, results in finite model theory had appeared only sporadically, e.g., Trakhtenbrot's Theorem [74] and the 01 law for firstorder logic [23]: there had been no real concerted research effort. The main reason for this lack of development was that many of the fundament ..."
Abstract
 Add to MetaCart
Introduction Prior to 1974, results in finite model theory had appeared only sporadically, e.g., Trakhtenbrot's Theorem [74] and the 01 law for firstorder logic [23]: there had been no real concerted research effort. The main reason for this lack of development was that many
ON LOGICAL CHARACTERIZATION OF HENSELIANITY
, 2007
"... We give some sufficient conditions under which any valued field that admits quantifier elimination in the Macintyre language is henselian. Then, without extra assumptions, we prove that if a valued field of characteristic (0, 0) has a Zgroup as its value group and admits quantifier elimination in ..."
Abstract
 Add to MetaCart
We give some sufficient conditions under which any valued field that admits quantifier elimination in the Macintyre language is henselian. Then, without extra assumptions, we prove that if a valued field of characteristic (0, 0) has a Zgroup as its value group and admits quantifier elimination in the main sort of the DenefPas style language LRRP then it is henselian. In fact the proof of this suggests that a quite large class of DenefPas style languages is natural with respect to henselianity.
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract

Cited by 428 (122 self)
 Add to MetaCart
A prooftheoretic characterization of logical languages that form suitable bases for Prologlike programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide
Results 1  10
of
5,507