A Preferential Model Semantics For Default Logic

  title={A Preferential Model Semantics For Default Logic},
  author={Frans Voorbraak},
Shoham proposed a uniform approach to systems for nonmonotonic reasoning, which consists in considering standard logics augmented with a preference relation on the interpretations. Circumscription can easily seen to be a special case of this preference logic framework, but capturing default logic turned out to be, more difficult, and is even thought to be impossible by some researchers of nonmonotonic reasoning. In this paper a preferential model semantics for default logic is given, by… 
Preference-Based Semantics for Nonmonotonic Logics
The view is defended that the rationality of cumulative monotonicity does not imply that nonmonotonic logics have to be cumulative, but only that a rational agent should not believe a set of default rules that induces a noncumulative consequence operation.
A modal perspective on the computational complexity of attribute value grammar
This paper studies the complexity of the satisfiability problem for nine modal languages which mirror different aspects of AVS description formalisms, including the ability to express re-entrancy, the able to express generalisations, and theAbility to express recursive constraints.
The theory of syntactic domains
In this essay we develop a mathematical theory of syntactic domains with special attention to the theory of government and binding. Starting from an intrinsic characterization of command relations
Prefinitely Axiomatizable Modal and Intermediate Logics
Logics bounding finite axiomatizability and logics bounded finite model property in the lattice of intermediate logics and the lattICE of normal extensions of K4.3.
Bar recursion versus polymorphism
By constructing a counter, model we show that a certain appealing equation E has no solution in Girard's [1972] second order lambdacalculus (the so-called polymorphic, lambda calculus). The
Ramsey's theorem and the pigeonhole principle in intuitionistic mathematics
At first sight, the argument which F.P. Ramsey gave for (the infinite case of) his famous theorem from 1927, is hopelessly unconstructive. If suitably reformulated, the theorem is true
Generalized Kripke Models for Epistemic Logic
A generalization of Kripke models is proposed for systemizing the study of the many different epistemic notions that appear in the literature and a notion of justified true belief is explained in terms of them.
Splittings and the finite model property
  • M. Kracht
  • Mathematics
    Journal of Symbolic Logic
  • 1993
This paper proves that all iterated splittings of G have Imp, whereas in the other cases it will give explicit counterexamples, and introduces a proof technique which will give a positive answer for large classes of splitting frames.
A tractable algorithm for the wellfounded model
This paper presents the concise mathematical development of a quadratic-time algorithm for the wellfounded model of propositional general logic programs.


Interpolation in Fragments of Intuitionistic Propositional Logic
The following strong interpolation theorem is proved: if IpL }-A+B and A or B is in NNIL, then there is an interpolant I in KNIT, and this settles a question posed by A. Visser.
The logic of actual obligation. An alternative approach to deontic logic
In this paper we develop a system of deontic logic (LAO, the logic of actual obligation) with a rather limited scope: we are, only interested in obligations as far as they: are relevant for
Applications of constructive logic to sheaf constructions in toposes
The internal logic of a topos is exploited to give an easy proof of the fact that topologies in a topos form a locale and to give simple internal reformulations of two well-known variants of
Peano's Smart Children: A Provability Logical Study of Systems with Built-in Consistency
  • A. Visser
  • Mathematics
    Notre Dame J. Formal Log.
  • 1989
The systems studied in this article prove the same theorems (from the "extensional" point of view) as Peano Arithmetic, but are equipped with a self-correction procedure. These systems prove their
Non-monotonic reasoning : formalization of commonsense reasoning
Elements of monotonic logics foundations of non-monotonic reasoning approaches to non-monotonic reasoning modal non-monotonic logics default logic default logic circumscription approaches to closed
Circumscription formalizes conjectural reasoning that humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do.
Book review: Partiality, Truth and Persistence by Tore Langholm (Lecture Notes 15 Ctr. for the Study of Lang. and Information. University of Chicago Press)
Partiality, Truth and Persistence is the latest in a recent series of inexpensive, softcover lecture notes which deal with various aspects of logic and language. There are several works on natural
Kunnen wij elke machine verslaan?: Beschouwingen rondom Lucas' Argument
In this paper, we discuss Lucas's Argument, which purports to show that there is at least one thing, the producing-as-true of certain Godel sentences, in which we humans are, in principle, superior
Strictness analysis for POLYREC, a language with polymorphic and recursive types
This paper defines the functional language POLYREC with polymorphic and recursive types, and develops concrete and abstract interpretations for this language, based on complete partial orderings and complete lattices.