Searching for Inductive Proofs in Second-Order Intuitionistic Logic (Extended Abstract) (1992)  (Make Corrections)  
L. Thorne McCarty

 @ NUS   Home/Search   Context   Related

 
View or download:
upenn.edu/pub/lprolog/Pr...McCarty.ps.Z
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  upenn.edu (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: ) L. Thorne McCarty Computer Science Department Rutgers University New Brunswick, NJ 08903, USA mccarty@cs.rutgers.edu 1 Introduction Several researchers have studied the problem of inductive reasoning about PROLOG programs, beginning with an early paper by Clark and Tarnlund [2]. The pioneering work of Kanamori and Seki [11] proposed an extended model of PROLOG execution and showed how this extended model could be used for program verification. A companion paper by Kanamori and Fujita [10]... (Update)

Similar documents (at the sentence level):
7.8%:   Circumscribing Embedded Implications (Without Stratifications) - McCarty (1992)   (Correct)

Active bibliography (related documents):   More   All
0.8:   An Intuitionistic Interpretation of Finite and Infinite.. - McCarty, van der Meyden (1993)   (Correct)
0.6:   The Complexity Of Querying Indefinite Information: Defined.. - van der Meyden (1992)   (Correct)
0.5:   Reasoning About Indefinite Actions - McCarty, van der Meyden (1992)   (Correct)

Similar documents based on text:   More   All
0.2:   Tutorial: Synthesis of Logic Programs - Lau, Wiggins   (Correct)
0.1:   Thought, Language, And Ontology: Essays in Memory of.. - Orilia, (eds.)   (Correct)
0.1:   Proofs by Program Transformations - Roychoudhury, Kumar, Ramakrishnan.. (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ mccarty-searching,
  author = "L. Thorne McCarty",
  title = "Searching for Inductive Proofs in Second-Order Intuitionistic Logic (Extended
    Abstract)",
  url = "citeseer.comp.nus.edu.sg/188013.html" }
Citations (may not include all citations):
759   Negation as failure (context) - Clark - 1978
451   Circumscription: A form of non-monotonic reasoning (context) - McCarthy - 1980
340   Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
297   Applications of circumscription to formalizing common-sense .. - McCarthy - 1986
166   Computing circumscription (context) - Lifschitz - 1985
166   An overview of PROLOG (context) - Nadathur, Miller - 1988
149   A logical analysis of modules in logic programming (context) - Miller - 1989
82   PROLOG: An extension of PROLOG with hypothetical implication.. (context) - Gabbay, Reyle - 1984
82   PROLOG: An extension of PROLOG with hypothetical implication (context) - Gabbay - 1985
55   Clausal intuitionistic logic (context) - McCarty - 1988
55   Clausal intuitionistic logic (context) - McCarty - 1988
47   Constructivism in Mathematics: An Introduction (context) - Troelstra, van Dalen - 1988
28   Circumscription implies predicate completion (context) - Reiter - 1982
28   A first-order theory of data and programs (context) - Clark, Tarnlund - 1977
23   Extracting logic programs from proofs that use extended PROL.. (context) - Fribourg - 1990
21   Explanation-based generalization as resolution theorem provi.. (context) - Kedar-Cabelli, McCarty - 1987
12   Formulation of induction formulas in verification of PROLOG .. (context) - Kanamori, Fujita - 1986
11   Reasoning about indefinite actions - McCarty, van der Meyden - 1992
8   Verification of PROLOG programs using an extension of execut.. (context) - Kanamori, Seki - 1986
6   Indefinite reasoning with definite rules (context) - McCarty, van der Meyden - 1991
4   Automatic inductive theorem-proving using PROLOG (context) - Hsiang, Srivas - 1987
4   Automatic generation of simplification lemmas for inductive .. (context) - Fribourg - 1991
4   Automated inductive reasoning about logic programs (context) - Elkan, McAllester - 1988
4   Circumscribing embedded implications (context) - McCarty - 1991
3   Computer Science Department (context) - McCarty, prototypes - 1992
1   Equivalence-preserving transformations of inductive properti.. (context) - Fribourg - 1988
1   Department of Computer Science (context) - Loveland, beyond et al. - 1988

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 at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.