Gopalan Nadathur, Donald W. Loveland  Home/Search
Context Related
Links: ACM | duke.edu/pub/dist/techre...199440.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One formulation of the concept of logic programming is the notion of Abstract Logic Programming Language, introduced in [MNPS91]. Central to that definition is uniform proof, which enforces the requirements of inference direction, including goal-directednes, and the duality of readings, declarative and procedural. This is achieved by associating logical connectives with search directives. We use this technology to investigate Disjunctive Logic Programming, an extension of traditional... (Update)
Context of citations to this paper: More
.... modification that has been studied in the past is the addition of the negation of the formula that is to be proved to the assumptions [NL95, Nad96]. This transformation is sound with respect to classical logic. We characterize the situations in which it also achieves the...
...observation (3) is that A and B both fail to satisfy the left focusing condition and hence the languages fail to satisfy DA and D S . In [NL95] Nadathur and Loveland examine the application of uniformity to disjunctive logic programming (Nadathur expands on the paper in...
Cited by: More
Disjunction and Modular Goal-directed Proof Search - Stone (Correct)
Indefinite Information in Modal Logic Programming - Stone (1999) (Correct)
On the Weakness of Conditional Equations in Algebraic.. - Schönegge, Kempe (Correct)
Similar documents (at the sentence level):
78.2%: Uniform Proofs and Disjunctive Logic Programming (Extended.. - Nadathur, al. (1995) (Correct)
9.7%: Uniform Provability in Classical Logic - Nadathur (1996) (Correct)
Active bibliography (related documents): More All
0.3: A Case-Analysis Approach To Disjunctive Logic Programming - Reed (1991) (Correct)
0.3: The Near-Horn Approach to Disjunctive Logic Programming - David Reed (1992) (Correct)
0.2: Semantics for Disjunctive Logic Programs with Explicit and.. - Minker, Ruiz (1994) (Correct)
Similar documents based on text: More All
0.3: Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan.. (1994) (Correct)
0.3: Finding Test-and-Treatment Procedures Using Parallel - Computation Louis Duval (Correct)
0.2: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1995) (Correct)
Related documents from co-citation: More All
5: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
4: Uniform provability in classical logic - Nadathur - 1996
4: Foundations of Disjunctive Logic Programming (context) - Lobo, Minker et al. - 1992
BibTeX entry: (Update)
Gopalan Nadathur and Donald W. Loveland. Uniform proofs and disjunctive logic programming. In Dexter Kozen, editor, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 148--155, San Diego, California, June 1995. IEEE Computer Society Press. http://citeseer.ist.psu.edu/nadathur95uniform.html More
@inproceedings{ nadathur95uniform,
author = "Gopalan Nadathur and Donald W. Loveland",
title = "Uniform Proofs and Disjunctive Logic Programming",
booktitle = "Proceedings of the Tenth Annual Symposium on Logic in Computer Science",
publisher = "IEEE Computer Society Press",
address = "San Diego, California",
editor = "D. Kozen",
pages = "148--155",
year = "1995",
url = "citeseer.ist.psu.edu/nadathur95uniform.html" }
Citations (may not include all citations):340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
312 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991 ACM DBLP
251 A logic programming language with lambda-abstraction - Miller - 1991
189 Foundations of Disjunctive Logic Programming (context) - Lobo, Minker et al. - 1992
185 On indefinite databases and the closed world assumption (context) - Minker - 1982 ACM DBLP
54 Inferring negative information from disjunctive databases (context) - Ross, Topor - 1988 ACM DBLP
44 Deduction in non-Horn databases (context) - Yahya, Henschen - 1985 DBLP
32 Near-Horn Prolog and beyond (context) - Loveland - 1991 ACM DBLP
25 Near-Horn Prolog (context) - Loveland - 1987 ACM DBLP
18 A proof procedure for the logic of hereditary Harrop formula.. - Nadathur - 1993 ACM DBLP
13 Extending the semantics of logic programs to disjunctive log.. - Lobo, Minker et al. - 1989
11 A near-Horn Prolog for compilation - Loveland, Reed - 1991 ACM DBLP
10 An alternative characterization of disjunctive logic program.. (context) - Reed, Loveland et al. - 1991 ACM DBLP
2 Stationary semantics for disjunctive logic programs and dedu.. (context) - Pryzmusinski - 1990 ACM DBLP
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html): More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994) (Correct)
A Notation for Lambda Terms II: Refinements and Applications - Nadathur (1994) (Correct)
I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC