The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found (...) in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Dynamic doxastic logic (DDL) is used in connexion with theories of belief revision. Here we try to show that languages of DDL are suitable also for discussing aspects of default logic. One ingredient of our analysis is a concept of coherence-as-ratifiability.

This is a note from an AMC session on Jeff Horty's (2012) book *Reasons as Defaults*.

Currently there is hardly any connection between philosophy of science and Artificial Intelligence research. We argue that both fields can benefit from each other. As an example of this mutual benefit we discuss the relation between Inductive-Statistical Reasoning and Default Logic. One of the main topics in AI research is the study of common-sense reasoning with incomplete information. Default logic is especially developed to formalise this type of reasoning. We show that there is a striking resemblance (...) between inductive-statistical reasoning and default logic. A central theme in the logical positivist study of inductive-statistical reasoning such as Hempels Criterion of Maximal Specificity turns out to be equally important in default logic. We also discuss to what extent the relevance of the results of Logical Positivism to AI research could contribute to a reevaluation of Logical Positivism in general. (shrink)

This paper presents statistical default logic, an expansion of classical (i.e., Reiter) default logic that allows us to model common inference patterns found in standard inferential statistics, including hypothesis testing and the estimation of a populations mean, variance and proportions. The logic replaces classical defaults with ordered pairs consisting of a Reiter default in the first coordinate and a real number within the unit interval in the second coordinate. This real number represents an upper-bound (...) limit on the probability of accepting the consequent of an applied default and that consequent being false. A method for constructing extensions is then defined that preserves this upper bound on the probability of error under a (skeptical) non-monotonic consequence relation. (shrink)

Statistical Default Logic (SDL) is an expansion of classical (i.e., Reiter) default logic that allows us to model common inference patterns found in standard inferential statistics, e.g., hypothesis testing and the estimation of a population‘s mean, variance and proportions. This paper presents an embedding of an important subset of SDL theories, called literal statistical default theories, into stable model semantics. The embedding is designed to compute the signature set of literals that uniquely distinguishes each extension (...) on a statistical default theory at a pre-assigned error-bound probability. (shrink)

Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen’s system LK. Hence proving lower bounds for credulous reasoning will be as hard (...) as proving lower bounds for LK. On the other hand, we show an exponential lower bound to the proof size in Bonatti and Olivetti’s enhanced calculus for skeptical default reasoning. (shrink)

When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown (...) that this interpretation yields a semantics for default logic based on temporal epistemic models. A comparison between the various semantics for default logic will show the differences and similarities of these approaches and ours. (shrink)

We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates a number of default-beliefs of object-level formulas. We extend this framework by proposing a mechanism to reflect these defaults down. Such a reflection is seen as essentially having a temporal flavour: defaults derived (...) at the meta-level are projected as facts in a next object level state. In this way, we obtain temporal models for default reasoning in meta-level formalisms which can be conceived as labeled branching trees. Thus, descending the tree corresponds to shifts in time that model downward reflection, whereas the branching of the tree corresponds to ways of combining possible defaults. All together, this yields an operational or procedural semantics of reasoning by default, which admits one to reason about it by means of branching-time temporal logic. Finally, we define sceptical and credulous entailment relations based on these temporal models and we characterize Reiter extensions in our semantics. (shrink)

ABSTRACT Reiter's default logic is one of the most prominent and well-studied approaches to nonmonotonic reasoning. Its evolution has resulted in diverse variants enjoying many interesting properties. This process however seems to be diverging because it has led to default logics that are difficult to compare due to different formal characterizations—sometimes even dealing with different objects of discourse. This problem is addressed in this paper in two ways. One the one hand, we elaborate on the relationships between (...) different types of default logics and discuss their differences wrt some basic properties. In particular, we show how two recently proposed variants, namely rational and CA-default logic, are related to each other and existing default logics. As an interesting byproduct, we obtain a cumulative counterpart to Lukasiewicz' variant of default logic. The resulting system is insofar surprising since it necessitates to refine the canonical way of assuring cumulativity in default logics. On the other hand, we pursue an integrating approach. We give a translation embedding rational and CA-default logic into a recently developed framework for default logics. This allows us not only to classify these variants, but it moreover provides us with semantical underpinnings that have been lacking so far. (shrink)

A default theory can be seen as a way for representing a set of formulae, i.e., its extensions. In this paper, we characterize the sets of formulae that can be expressed by a default theory according to various semantics: justified, constrained, rational, cumulative, QDL, CADL, and two semantics with priorities. These characterizations imply some non-translatability results between semantics.

Lifschitz introduced the notion of defining extensions of predicate default theories not as absolute, but relative to a specified domain. We look specifically at default theories over a countable domain and show the set of default theories which possess an ω -extension is Σ 2 1 -complete. That the set is in Σ 2 1 is shown by writing a nearly circumscriptive formula whose ω -models correspond to the ω -extensions of a given default theory; similarly, (...) Σ 2 1 -hardness is established by a method for translating formulas into default theories in such a way that ω -models of the circumscriptive formula correspond to ω -extensions of the default theory. (shrink)

We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the form if not-A, thenA, should not hold, since the conditional’s antecedent not-A contradicts its consequent A. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event $${A| \overline{A}}$$ A | A ¯ is $${p(A| \overline{A})=0}$$ p ( A | A ¯ ) (...) = 0. In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms of suitable probabilistic constraints on conditional events. In the second approach we study connexivity within the coherence framework of compound conditionals, by interpreting connexive principles in terms of suitable conditional random quantities. After developing notions of validity in each approach, we analyze the following connexive principles: Aristotle’s theses, Aristotle’s Second Thesis, Abelard’s First Principle, and Boethius’ theses. We also deepen and generalize some principles and investigate further properties related to connexive logic (like non-symmetry). Both approaches satisfy minimal requirements for a connexive logic. Finally, we compare both approaches conceptually. (shrink)

We show that modal logics characterized by a class of frames satisfying the insertion property are suitable for Reiter's default logic. We refine the canonical fix point construction defined by Marek, Schwarz and Truszczyński for Reiter's default logic and thus we addrress a new paradigm for nonmonotonic logic. In fact, differently from the construction defined by these authors. we show that suitable modal logics for such a construction must indeed contain K D4. When reflexivity is (...) added to the modal logic used for the fix point construction then we come to the Marek Schwarz and Truszczyński framework for Reiter's default logic. Our framework, in fact, is appropriate also to the family of modal logics in between S4 and S4f. If, instead, reflexivity is dropped, then we show that a new family of modal logics is gained, namely the modal logics in between KD4 and KD4Z. The upper bound can be extended to the modal logic KD4LZ whenever the propositional language taken into account is finite. (shrink)

This paper introduces a generalization of Reiter’s notion of “extension” for default logic. The main difference from the original version mainly lies in the way conflicts among defaults are handled: in particular, this notion of “general extension” allows defaults not explicitly triggered to pre-empt other defaults. A consequence of the adoption of such a notion of extension is that the collection of all the general extensions of a default theory turns out to have a nontrivial algebraic structure. (...) This fact has two major technical fall-outs: first, it turns out that every default theory has a general extension; second, general extensions allow one to define a well-behaved, skeptical relation of defeasible consequence for default theories, satisfying the principles of Reflexivity, Cut, and Cautious Monotonicity formulated by D. Gabbay. (shrink)

We present a straightforward embedding of modal nonmonotonic logics into default logic.

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of (...) default reasoning in System . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

Language employs various coordinators to connect propositions, a subset of which are “logical” in nature and thus analogous to the truth operators of formal logic. We here focus on two linguistic connectives and their negations: conjunction _and_ and (inclusive) disjunction _or_. Linguistic connectives exhibit a truth-conditional component as part of their meaning (their semantics), but their use in context can give rise to various implicatures and presuppositions (the domain of pragmatics) as well as to inferences that go beyond semantic/pragmatic (...) properties (the result of reasoning processes). We provide a comprehensive review of the role of the logical connectives in language and argue that three sets of factors—semantic, pragmatic, and those related to reasoning—are separate and separable, though some details may differ cross-linguistically. As a way to showcase the argument, we present two experiments in language comprehension in Spanish wherein pragmatic content was minimised and reasoning processes neutered, thus potentially highlighting what might be the default meanings of the connectives under study. In Experiment 1 we show that the conjunctive reading of inclusive disjunction is available in positive contexts other than in syntactically intricate cases such as downward entailing and free choice contexts, contrary to what has been claimed in the literature. In Experiment 2 we show that negated conjunctions and disjunctions in Spanish can easily receive the same interpretation when contrasted against the same context and, moreover, that these interpretations match those available in English, despite claims from the literature that linguistic connectives and local negation interact differently in English and Romance languages. (shrink)

We study a probabilistic logic based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence). We examine probabilistic conditional knowledge bases associated with imprecise probability assessments defined on arbitrary families of conditional events. We introduce a notion of conditional interpretation defined directly in terms of precise probability assessments. We also examine a property of strong satisfiability which is related to the notion of toleration well known in default reasoning. In our framework we (...) give more general definitions of the notions of probabilistic consistency and probabilistic entailment of Adams. We also recall a notion of strict p-consistency and some related results. Moreover, we give new proofs of some results obtained in probabilistic default reasoning. Finally, we examine the relationships between conditional probability rankings and the notions of g-coherence and g-coherent entailment. (shrink)

This book presents adaptive logics as an intuitive and powerful framework for modeling defeasible reasoning. It examines various contexts in which defeasible reasoning is useful and offers a compact introduction into adaptive logics. The author first familiarizes readers with defeasible reasoning, the adaptive logics framework, combinations of adaptive logics, and a range of useful meta-theoretic properties. He then offers a systematic study of adaptive logics based on various applications. The book presents formal models for defeasible reasoning stemming from different contexts, (...) such as default reasoning, argumentation, and normative reasoning. It highlights various meta-theoretic advantages of adaptive logics over other logics or logical frameworks that model defeasible reasoning. In this way the book substantiates the status of adaptive logics as a generic formal framework for defeasible reasoning. (shrink)

Based on a close study of benchmark examples in default reasoning, such as Nixon Diamond, Penguin Principle, etc., this paper provides an in depth analysis of the basic features of default reasoning. We formalize default inferences based on Modus Ponens for Default Implication, and mark the distinction between "local inferences"(to infer a conclusion from a subset of given premises) and "global inferences"(to infer a conclusion from the entire set of given premises). These conceptual analyses are captured (...) by a formal semantics that is built upon the set-selection function technique. A minimal logic system M of default reasoning that accommodates Modus Ponens for Default Implication and suitable for local inferences is proposed, and its soundness is proved. (shrink)