61.
Non-Commutativity and Expressive Deductive Logic Databases - S. Krajci; R. Lencses; J. Medina; M. Ojeda-Aciego; A. Valverde; P. Vojtas; P.J. Safarik
The procedural semantics of multi-adjoint logic programming is used for providing a model-theoretic semantics for a data model.
67.
Static Semantics For Normal and Disjunctive Logic Programs - Teodor Przymusinski Department; Teodor C. Przymusinski; Jack Minker
In this paper, we propose a new semantic framework for disjunctive logic programming by introducing static expansions of disjunctive programs. The class of static expansions extends both the classes of stable, well-founded and stationary models of normal programs and the class of minimal models of positive disjunctive programs. Any static expansion of a program P provides the corresponding semantics for P consisting of the set of all sentences logically implied by the expansion. We show that among all static expansions of a disjunctive program P there is always the least static expansion which we call the static completion P of...
68.
Static Semantics For Normal and Disjunctive Logic Programs - Teodor C. Przymusinski; Jack Minker
In this paper, we propose a new semantic framework for disjunctive logic programming by introducing static expansions of disjunctive programs. The class of static expansions extends both the classes of stable, well-founded and stationary models of normal programs and the class of minimal models of positive disjunctive programs. Any static expansion of a program P provides the corresponding semantics for P consisting of the set of all sentences logically implied by the expansion. We show that among all static expansions of a disjunctive program P there is always the least static expansion which we call the static completion P of...
69.
Static Semantics For Normal and Disjunctive Logic Programs - Teodor C. Przymusinski; Jack Minker
In this paper, we propose a new semantic framework for disjunctive logic programming by introducing static expansions of disjunctive programs. The class of static expansions extends both the classes of stable, well-founded and stationary models of normal programs and the class of minimal models of positive disjunctive programs. Any static expansion of a program P provides the corresponding semantics for P consisting of the set of all sentences logically implied by the expansion. We show that among all static expansions of a disjunctive program P there is always the least static expansion which we call the static completion P of...
71.
A Logic-Based Theory of Deductive Arguments - Philippe Besnard; Anthony Hunter
We explore a framework for argumentation (based on classical logic) in which an argument is a pair where the first item in the pair is a minimal consistent set of formulae that proves the second item (which is a formula). We provide some basic definitions for arguments, and various kinds of counter-arguments (defeaters). This leads us to the definition of canonical undercuts which we argue are the only defeaters that we need to take into account. We then motivate and formalise the notion of argument trees and argument structures which provide a way of exhaustively collating arguments and counter-arguments. We...
61.
