L. Thorne McCarty  Home/Search
Context
Related
| uky.edu/pub/lpnmr/mccarty2.ps.gz uky.edu/pub/lpnmr/mccarty2.ps.gz 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: uky.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is a study of circumscription, not in classical logic, as usual, but in intuitionistic logic. We first review the intuitionistic circumscription of Horn clause logic programs, which was discussed in previous work, and we then consider the larger class of embedded implications . The ordinary circumscription axiom turns out to be inappropriate for this class of rules, and we analyze two alternatives: (1) prioritized circumscription, which works for stratified embedded implications; and ... (Update)
Active bibliography (related documents): More All
1.4: An Intuitionistic Interpretation of Finite and Infinite.. - McCarty, van der Meyden (1993) (Correct)
1.3: Searching for Inductive Proofs in Second-Order Intuitionistic.. - McCarty (1992) (Correct)
0.7: The Complexity Of Querying Indefinite Information: Defined.. - van der Meyden (1992) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.7: Circumscription and Disjunctive Logic Programming - Minker, Lobo, Rajasekar (1991) (Correct)
0.7: Point-Sensitive Circumscription - Amir (1997) (Correct)
0.7: Pointwise Circumscription Revisited - Amir (Correct)
BibTeX entry: (Update)
@misc{ mccarty-circumscribing,
author = "L. Thorne McCarty",
title = "Circumscribing Embedded Implications (Without Stratifications)",
url = "citeseer.ist.psu.edu/mccarty92circumscribing.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
759 Negation as failure (context) - Clark - 1978
451 Circumscription: A form of non-monotonic reasoning (context) - McCarthy - 1980
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
312 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
297 Applications of circumscription to formalizing common-sense .. - McCarthy - 1986
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1991
248 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
198 Structure and complexity of relational queries - Chandra, Harel - 1982
166 Computing circumscription (context) - Lifschitz - 1985
166 An overview of PROLOG (context) - Nadathur, Miller - 1988
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979
150 Entailment: The Logic of Relevance and Necessity (context) - Anderson, Belnap - 1975
149 A logical analysis of modules in logic programming (context) - Miller - 1989
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
115 The alternating fixpoint of logic programs with negation (context) - Van Gelder - 1989
82 PROLOG: An extension of PROLOG with hypothetical implication (context) - Gabbay - 1985
82 PROLOG: An extension of PROLOG with hypothetical implication.. (context) - Gabbay, Reyle - 1984
73 Relevance logic and entailment (context) - Dunn - 1986
55 Clausal intuitionistic logic (context) - McCarty - 1988
55 Clausal intuitionistic logic (context) - McCarty - 1988
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinski - 1988
53 Lexical scoping as universal quantification - Miller - 1989
52 the declarative semantics of logic programs with negation (context) - Lifschitz - 1988
48 Semantical analysis of intuitionistic logic (context) - Kripke - 1965
48 and generic modules for logic programming (context) - Goguen, Meseguer et al. - 1986
47 Constructivism in Mathematics: An Introduction (context) - Troelstra, van Dalen - 1988
28 Semantics for relevant logics (context) - Urquhart - 1972
28 Circumscription implies predicate completion (context) - Reiter - 1982
23 Model Theory and Forcing (context) - Fitting - 1969
20 Why horn formulas matter in computer science: Initial struct.. (context) - Makowsky - 1985
20 A language for legal discourse (context) - McCarty - 1989
17 Expressing Database Queries with Intuitionistic Logic - Bonner, McCarty et al. - 1989
14 Adding negation-as-failure to intuitionistic logic programmi.. - Bonner, McCarty - 1990
13 A Study of Nonmonotonic Reasoning (context) - Lin - 1991
12 A proof-theoretic approach to logic programming (context) - Hallnass, Schroeder-Heister - 1990
12 Formulation of induction formulas in verification of PROLOG .. (context) - Kanamori, Fujita - 1986
12 A proof-theoretic approach to logic programming: II (context) - Hallnass, Schroeder-Heister - 1991
12 A logic for hypothetical reasoning - Bonner - 1988
11 Reasoning about indefinite actions - McCarty, van der Meyden - 1992
9 Recursively indefinite databases (context) - van der Meyden - 1990
9 Hypothetical Datalog: Negation and linear recursion - Bonner - 1989
8 ein reduzierter intuitionistischer formalismus (context) - Johansson - 1937
7 Hypothetical Datalog: Complexity and Expressibility - Bonner - 1988
6 A definite clause version of categorial grammar - Pareschi - 1988
6 Indefinite reasoning with definite rules (context) - McCarty, van der Meyden - 1991
4 Relevant logic programming (context) - Bollen - 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 - 1993
3 Proving inductive properties of PROLOG programs in secondord.. (context) - McCarty - 1993
1 the strong completion of logic programs (context) - Dung - 1990
1 Strong circumscription specifies the stable semantics of log.. (context) - Dung - 1990
1 An intuitionistic interpretation of finite and infinite fail.. - McCarty, van der Meyden - 1993
1 Hypothetical reasoning and definitional reflection in logic .. (context) - Schroeder-Heister - 1990
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.mscf.uky.edu.html): More
On Lambert's W Function - Corless, Gonnet, Hare, Jeffrey (1993) (Correct)
TCP and UDP with Bigger Addresses (TUBA), A Simple Proposal for.. - Callon (1992) (Correct)
Proving Properties of States in the Situation Calculus - Reiter (1993) (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