Learn More
1 i n t ro d u c t i o n Formal Logic can be used to represent knowledge of many kinds for many purposes. It can be used to formalize programs, program specifications, databases, legislation, and natural language in general. For many such applications of logic a representation of time is necessary. Although there have been several attempts to formalize the(More)
We present an abstract framework for default reasoning, which includes Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logics, and certain instances of circumscription as special cases. The framework can be understood as a gener-alisation of Theorist. The generalisation allows any theory formulated in a monotonic logic(More)
Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics(More)
The infancy of a programming language can be a trying period for all involved. The developers of the language and the early followers are usually fiercely dedicated to demonstrating they they have achieved a major accomplishment. They become a vocal and adamant elite, willing to testify with evangelical fervor that they have finally discovered the Royal(More)
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive" component and that can encompass multi-agent systems. We modify an earlier abductive proof procedure and embed it within an agent cycle. The proof procedure incorporates abduction, definitions(More)
We present a family of dialectic proof procedures for the admissibility semantics of assumption-based argumentation. These proof procedures are defined for any conventional logic formulated as a collection of inference rules and show how any such logic can be extended to a dialectic argumentation system. The proof procedures find a set of assumptions, to(More)