(Enter summary)
Abstract: Some recent works rely on the intuitionistic theory of Hereditary Harrop formulas
to provide extensions for Horn clauses while preserving the logic paradigm. In
particular, an intuitionistic implication is used to provide some form of scoping.
However the lack of appropriate evaluation strategies, notably a strategy relying
on a forward-chaining search, has limited its application. This paper investigates
a resolution schema for propositional Hereditary Harrop formulas, extending the
resolution ... (Update)
Active bibliography (related documents): More All
0.5: Applications of Deontic Logic in Computer Science: A Concise.. - Wieringa, Meyer (1993)
(Correct)
0.3: Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller (1994)
(Correct)
0.2: Circumscribing Embedded Implications (Without Stratifications) - McCarty (1992)
(Correct)
Similar documents based on text: More All
0.4: A Step-to-Step Example of Negation Elimination in Hereditary.. - Momigliano
(Correct)
0.3: Specifying and Debugging Security Protocols in the hhf Fragment.. - Delzanno (2000)
(Correct)
0.2: A Clausal Form for the Completion of Logic Programs - James Harland Department (1991)
(Correct)
BibTeX entry: (Update)
@inproceedings{ huibonhoa94intuitionistic,
author = "Alain Hui-Bon-Hoa",
title = "Intuitionistic Implication and Resolution",
booktitle = "Symposium on Logic Programming",
pages = "409-423",
year = "1994",
url = "citeseer.ist.psu.edu/376919.html" }
Citations (may not include all citations):
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
257
Logic programming in a fragment of intuitionistic linear log..
- Hodas, Miller - 1994 ACM DBLP
129
The foundation of a generic theorem prover
- Paulson - 1989 ACM DBLP
82
Prolog: an extension of Prolog with hypothetical implication.. (context) - Gabbay - 1984
60
Contraction-free sequent calculi for intuitionistic logic (context) - Dyckhoff - 1992 DBLP
55
Clausal intuitionistic logic (context) - McCarty - 1988
54
Partial polymorphic type inference and higher-order unificat.. (context) - Pfenning - 1988 ACM DBLP
53
Implementing tactics and tacticals in a higher-order logic p..
- Felty - 1993 DBLP
43
Specifications as search keys for software libraries
- Rollins, Wing - 1991 DBLP
31
A Higher-Order Logic as the Basis for Logic Programming
- Nadathur - 1987 ACM
26
Extending definite clause grammars with scoping constructs (context) - Pareschi, Miller - 1990 ACM DBLP
20
Efficient bottomup computation of queries on stratified data.. (context) - Balbin, Port et al. - 1991
20
Abstract syntax and logic programming (context) - Miller - 1992 ACM DBLP
18
A proof procedure for the logic of Hereditary Harrop formula..
- Nadathur - 1993 ACM DBLP
17
Expressing database queries with intuitionistic logic
- Bonner, McCarty et al. - 1989 DBLP
14
Clausal intuitionistic logic II (context) - McCarty - 1988
13
Semantic interpretation as higher-order deduction
- Pereira - 1990 ACM DBLP
7
Hypothetical Datalog: complexity and expressibility
- Bonner - 1988
2
A language for legal discourse I: basic features (context) - McCarty - 1989
1
Intuitionistic resolution for a logic programming language w.. (context) - Hui-Bon-Hoa - 1994 ACM DBLP
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cis.upenn.edu.html): More
User-Controlled Physics-Based Animation for Articulated.. - Kokkevis, Metaxas, Badler (1996)
(Correct)
Semistructured Data - Buneman (1997)
(Correct)
A Hybrid Approach to Formal Verification Applied to an ATM.. - Clarke, Lee (1996)
(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