Matthew Stone  Home/Search
Context Related
| rutgers.edu/~mdstone/pubs/lp.pdf 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: rutgers.edu/~mdstone/cr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Logic Programming Logic programming languages embody simple, specific search procedures for building proofs. At each step in logic programming search, the goal is to find a way to use the available assumptions to establish a specific query. If the query is complex, its logical structure directly determines the available alternatives for search. Thus, logical symbols in queries can be seen as instructions for decomposing and transforming the search problem that the interpreter faces. Similarly, ... (Update)
Context of citations to this paper: More
.... chosen arbitrarily (or # must be true, on assumptions #) A version of this calculus, specialized for logic programming search, is developed in [26]. I now sketch how the resulting logic programming interpreter derives (17) from (16) It begins by decomposing the goal, repeated...
...for implementing deduction. And in order to suggest and facilitate results about specialized inference algorithms, such as [Stone, 1999a, Stone, 1999c] we avoid definitions for logical connectives, we represent worlds using prefix terms, denoting paths of...
Cited by: More
First-order Multi-Modal Deduction - Stone (Correct)
Towards a Computational Account of Knowledge, Action and .. - Matthew Stone Department (2000) (Correct)
Similar documents (at the sentence level):
26.4%: Disjunction and Modular Goal-directed Proof Search - Stone (Correct)
Active bibliography (related documents): More All
0.9: Communicative Intentions and Conversational Processes in.. - Stone (2002) (Correct)
0.5: Efficient Constraints on Possible Worlds for Reasoning about.. - Stone (1997) (Correct)
0.3: Strong Cut-Elimination for Constant Domain First-Order S5 - Wansing (1995) (Correct)
Similar documents based on text: More All
0.4: Reference to Possible Worlds - Stone (1999) (Correct)
0.3: Applying Theories of Communicative Action in Generation Using.. - Matthew Stone (1997) (Correct)
0.3: Representing Scope in Intuitionistic Deductions - Stone (1997) (Correct)
Related documents from co-citation: More All
2: Proof Methods for Modal and Intuitionistic Logics (context) - Fitting - 1983
2: i Laurea, Fac. Ingegneria, Univ. di Roma "La Sapienza (context) - Massacci, automatico - 1993
2: Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
BibTeX entry: (Update)
Matthew Stone. Indefinite information in modal logic programming. RUCCS Technical Report 56, Rutgers University, 1999. http://citeseer.ist.psu.edu/stone99indefinite.html More
@misc{ stone99indefinite,
author = "M. Stone",
title = "Indefinite information in modal logic programming",
text = "Matthew Stone. Indefinite information in modal logic programming. RUCCS
Technical Report 56, Rutgers University, 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/stone99indefinite.html" }
Citations (may not include all citations):340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1994
242 Proof Methods for Modal and Intuitionistic Logics (context) - Fitting - 1983
176 A correspondence theory for terminological logics: prelimina.. - Schild - 1991
149 A logical analysis of modules in logic programming (context) - Miller - 1989
142 Logic programming with focusing proofs in linear logic - Andreoli - 1992
120 Planning text for advisory dialogues: capturing intentional .. - Moore, Paris - 1993
94 Definite reference and mutual knowledge (context) - Clark, Marshall - 1981
92 Present and Future (context) - Prior - 1967
81 A multiple-conclusion meta-logic - Miller - 1994
60 Semantics-based translation methods for modal logics (context) - Ohlbach - 1991
42 Modal theorem proving: an equational viewpoint (context) - Auffray, Enjalbert - 1992
32 Near-horn Prolog and beyond (context) - Loveland - 1991
26 Proof search in first-order linear logic and other cut-free .. - Lincoln, Shankar - 1994
23 Knowledge preconditions for plans - Davis - 1994
22 the unity of logic (context) - Girard - 1993
22 Semantics for propositional attitudes (context) - Hintikka - 1971
21 First-order modal logic theorem proving and functional simul.. (context) - Nonnengart - 1993
21 Presupposition projection as anaphora resolution (context) - van der Sandt - 1992
20 A general framework for modal deduction - Frisch, Scherl - 1991
19 Textual economy through close coupling of syntax and semanti.. - Stone, Webber - 1998
19 Modality in Dialogue: Planning (context) - Stone
18 Gentzen method in modal calculi (context) - Onishi, Matsumoto - 1957
17 The organisation of purposeful dialogues (context) - Power - 1977
16 Semantical analysis of modal logic (context) - Kripke - 1963
16 A multimodal logic to define modules in logic programming (context) - Baldoni, Giordano et al. - 1993
15 Automated Proof Search in Non-Classical Logics: Efficient Ma.. (context) - Wallen - 1990
15 Tableau methods of proof for modal logics (context) - Fitting - 1972
15 Modeling the interaction between speech and gesture - Cassell, Stone et al. - 1994
15 Proof-search in intuitionistic logic based on constraint sat.. - Voronkov - 1996
14 Multimodal logic programming using equational and order-sort.. (context) - Debart, Enjalbert et al. - 1992
13 Structuring logic programs: A modal approach (context) - Giordano, Martelli - 1994
13 The Production of Language in Dialogue: A Computational Mode.. (context) - Houghton - 1986
12 A framework for modal logic programming - Baldoni, Giordano et al. - 1996
12 A hybrid reasoning model for indirect answers - Green, Carberry - 1994
9 Uniform provability in classical logic - Nadathur - 1998
8 MOLOG: A system that extends PROLOG with modal logic (context) - Cerro - 1986
8 Labelled modal logics: Quantifiers - Basin, Matthews et al. - 1998
6 Uniform proofs and disjunctive logic programming - Nadathur, Loveland - 1995
6 Abductive planning with sensing (context) - Stone
5 Permutation of inferences in Gentzen's calculi LK and LJ (context) - Kleene - 1951
5 Towards a computational account of knowledge (context) - Stone - 2000
5 Interrelating interpretation and generation in an abductive .. - Thomason, Hobbs - 1997
4 Representing scope in intuitionistic deductions - Stone
4 Provability in Logic (context) - Kanger - 1957
3 meaning and implicature (context) - Thomason - 1990
1 First-order multi-modal deduction - Stone
Documents on the same site (http://www.cs.rutgers.edu/~mdstone/cr.html):
First-order Multi-Modal Deduction - Stone (Correct)
Representing Communicative Intentions in Collaborative.. - Matthew Stone Department (2001) (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