Disjunctive Logic Programming

Download Disjunctive Logic Programming PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Disjunctive Logic Programming book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page

Foundations Of Disjunctive Logic Programming

Foundations Of Disjunctive Logic Programming written by Jorge Lobo and has been published by MIT Press (MA) this book supported file pdf, txt, epub, kindle and other format this book has been release on 1992 with Computers categories.

This monograph provides an intensive course for graduate students in computer science, as well as others interested in extensions of logic programming, on the theoretical foundations of disjunctive logic programming. Disjunctive logic programming permits the description of indefinite or incomplete information through a disjunction of atoms in the head of a clause. The authors describe model theoretic semantics, proof theoretic semantics, and fix point semantics for disjunctive and normal disjunctive programs (a normal disjunctive program permits negated atoms in the body of a clause) and present theories of negation. They conclude with selected applications to knowledge databases. Jorge Lobo is Assistant Professor in Computer Science at the University of Illinois, Chicago Circle. Jack Minker is Professor in the Department of Computer Science and Institute for Advanced Computer Studies at the University of Maryland. Arcot Rajasekar is Assistant Professor in the Computer Science Department at the University of Kentucky. Contents: Introduction and Background. Definitions and Terminology. Declarative Semantics. Proof Theory. Negation. Weak Negation. Normal Logic Programs. Procedural Semantics: Normal Programs. Disjunctive Databases. Applications.

Disjunctive Logic Programming

Disjunctive Logic Programming written by Jorge Lobo and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1994 with Disjunction (Logic) categories.

Disjunctive Logic Programming With Constraints And Its Applications

Disjunctive Logic Programming With Constraints And Its Applications written by Frieder Stolzenburg and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1998 with categories.

Disjunctive Logic Programming

Disjunctive Logic Programming written by Jorge Lobo and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1994 with Logic programming categories.

A Quantitative Extension Of Disjunctive Logic Programming

A Quantitative Extension Of Disjunctive Logic Programming written by Cristinel Mateis and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1998 with categories.

A Case Analysis Approach To Disjunctive Logic Programming

A Case Analysis Approach To Disjunctive Logic Programming written by David W. Reed and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1992 with Logic programming categories.

The Near Horn Approach To Disjunctive Logic Programming

The Near Horn Approach To Disjunctive Logic Programming written by Donald W. Loveland and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1991 with categories.

Studies On Disjunctive Logic Programming

Studies On Disjunctive Logic Programming written by Chiaki Sakama and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1994 with categories.

On The Semantics Of Disjunctive Logic Programs

On The Semantics Of Disjunctive Logic Programs written by Athanasios Tsouanas and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014 with categories.

In this thesis, we study denotational semantics (model-theoretic andgame-theoretic) of four logic programming languages:- LP which is the most restrictive one;- DLP which extends LP by allowing disjunctions;- LPN which extends LP by allowing negations; and- DLPN which allows both.The three main contributions of this dissertation can be summarized as follows:(1) An abstract framework for logic programming semantics is definedand all semantic approaches that we study are placed within this framework.We define the general notion of a truth value space as an appropriate algebraicstructure that satisfies a set of axioms.The booleans form the canonical example of such a space, but we need toconsider much more general ones when dealing with negation-as-failure. Forthis we define and study an infinite family of spaces, parametrized over anordinal number.(2) A game semantics for LP was defined in 1986 and further studied in 1998.Then in 2005 it was extended for the case of LPN programs.Here a game semantics for DLP programs is developed in full detail; we provethat it is sound and complete with respect to the standard, minimal modelssemantics of Minker.(3) We define a semantic operator which transforms any given abstractsemantics of a non-disjunctive language to a semantics of the"corresponding" disjunctive one. We exhibit the correctness of thistransformation by proving that it preserves equivalences of semantics,and we present some applications of it, obtaining new game semantics forDLPN, among others.

Splitting As A Source Of Parallelism In Disjunctive Logic Programs

Splitting As A Source Of Parallelism In Disjunctive Logic Programs written by Ulrich Furbach and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1991 with Logic programming categories.

Abstract: "During the last years there is a growing interest in logic programming by means of full first-order predicate logic presented by non-Horn clauses. There is work aiming at a semantic characterization of those 'disjunctive logic programs, ' e.g. Minker and Rajasekar ([MR90, MR88]) investigated fixpoint semantics and proof-procedures, the latter was done also by others like Herre ([Her88]), Casanova et. al. ([CGS89]) and the author ([Fur91]). As another somewhat different approach Loveland came with the idea of near-Horn programs ([Lov87]) and of using the splitting rule as a base for an efficient implementation ([Lov78]). A very similar idea was presented in [CEFB84], where a matrix reduction method from Prawitz was used to construct Horn programs. We propose the use of the splitting rule in a very straightforward manner, namely for splitting a given disjunctive program into a set of Horn clause programs, which can be processed in parallel. We would like to discuss a sketch of such a parallel evaluation model, although we do not have a fully formal treatment, in particular we do not have proofs of correctness and completeness of our method. We believe that this approach is interesting for several reasons: It can be seen as a very moderate, i.e. coarse grain form of and-parallelism. Thus, problems concerning the choice of subgoals to be processed in parallel are avoided; here it is a priori clear, where to split the program clauses. Besides the possibility of parallel evaluation this approach offers the advantage that SLD-based interpreters can be used to process disjunctive (and hence first-order) logic programs. NearHorn-PROLOG proof-procedures can be understood as a sequential implementation of our model."