Mukesh Dalal  Home/Search
Context Related
| columbia.edu/pub/dalal/pap...tr95.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: columbia.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This document addresses some problems raised by the well-known intractability of deductive reasoning in even moderately expressive knowledge representation systems. Starting from boolean constraint propagation (BCP), a previously known linear-time incomplete reasoner for clausal propositional theories, we develop fact propagation (FP) to deal with non-clausal theories, after motivating the need for such an extension. FP is specified using a confluent rewriting systems, for which we present an... (Update)
Context of citations to this paper: More
...literals. Cadoli and Schaerf [SC95] obtained several reasoners by parameterizing j= RP by sets of propositions. However, we have shown [Dal95] that none of their incomplete reasoners is stronger than j . In a related work [Dal96] we have extended j to an anytime family 0...
...Tennenholtz 1993) ii. unit refutation completeness: del Val 1994) iii. directional extension: Dechter Rish 1994) iv. vivid form: (Dalal 1995) v. theory prime implicates: Marquis 1995) b) Definition of original methods (for non propositional formulae) i. propositional...
Cited by: More
An Almost Quadratic Class of Satisfiability Problems - Dalal (1996) (Correct)
Approximate Propositional Deduction - Dalal (1996) (Correct)
Anytime Families of Tractable Propositional Reasoners - Dalal (Correct)
Similar documents (at the sentence level):
54.3%: Tractable Reasoning In Knowledge Representation Systems - Dalal (1995) (Correct)
Active bibliography (related documents): More All
0.7: Semantics of an Anytime Family of Reasoners - Dalal (1996) (Correct)
0.5: On Goal-Directed Provability in Classical Logic - Harland (1994) (Correct)
0.3: Knowledge Compilation and Theory Approximation - Selman, Kautz (1996) (Correct)
Similar documents based on text: More All
0.3: A Survey of Graph Pebbling - Hurlbert (1999) (Correct)
0.2: Tagging and Alignment of Parallel Texts: - Current Status Of (Correct)
0.1: Preliminary Empirical Results on Anytime Propositional.. - Dalal, Yang (1997) (Correct)
Related documents from co-citation: More All
3: Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
3: Knowledge compilation using Horn approximations - Selman, Kautz - 1991
3: Introduction to Mathematical Logic (context) - Mendelson - 1964
BibTeX entry: (Update)
Mukesh Dalal, Tractable Reasoning In Knowledge Representation Systems, Ph.D. thesis, Graduate School, New Brunswick, New Jersey, May 1995. http://citeseer.ist.psu.edu/article/dalal95tractable.html More
@misc{ dalal95tractable,
author = "M. Dalal",
title = "Tractable Reasoning In Knowledge Representation Systems",
text = "Mukesh Dalal, Tractable Reasoning In Knowledge Representation Systems,
Ph.D. thesis, Graduate School, New Brunswick, New Jersey, May 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/article/dalal95tractable.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
1838 Foundations of Logic Programming (context) - Lloyd - 1987
1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988
788 Rewrite systems - Dershowitz, Jounnaud - 1990
534 The complexity of theorem proving procedures (context) - Cook - 1971
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
322 First-order logic and automated theorem proving (context) - Fitting - 1990
320 Hard and easy distribution of SAT problems - Mitchell, Selman et al. - 1992
309 Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
267 Network-based heuristics for constraint satisfaction problem.. (context) - Dechter, Pearl - 1987
267 Network-based heuristics for constraint satisfaction problem.. (context) - Dechter, Pearl - 1988
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
247 Confluent reductions: abstract properties and applications t.. (context) - Huet - 1980
200 Introduction to Mathematical Logic (context) - Mendelson - 1964
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
191 Algorithms for constraint satisfaction problems: A survey - Kumar - 1992
189 Foundations of disjunctive logic programming (context) - Lobo, Rajasekar - 1992
189 Solving time dependent planning problems (context) - Boddy, Dean - 1988
186 Constraint satisfaction (context) - Mackworth - 1987
183 A useful four-valued logic (context) - Belnap - 1977
166 Synthesizing constraint expressions (context) - Freuder - 1978
161 A logic of implicit and explicit belief (context) - Levesque - 1984
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
107 Foundations of assumption-based truth maintenance systems: P.. (context) - Reiter, de Kleer - 1987
97 Knowledge compilation using Horn approximations - Selman, Kautz - 1991
88 Two theses of knowledge representation: language restriction.. - Doyle, Patil - 1991
86 Foundations of a functional approach to knowledge representa.. (context) - Levesque - 1984
76 Making believers out of computers (context) - Levesque - 1986
72 A fundamental tradeoff in knowledge representation and reaso.. (context) - Levesque, Brachman - 1985
72 Many hard examples for resolution (context) - Szemeredi - 1988
71 Krypton: A functional approach to knowledge representation (context) - Brachman, Fikes et al. - 1983
45 Truth maintenance - McAllester - 1990
37 Tractable reasoning via approximation - Cadoli, Schaerf - 1992
32 A comparison of ATMS and CSP techniques (context) - de Kleer - 1989
31 An outlook on truth maintenance (context) - McAllester - 1980
28 Hierarchical knowledge bases and efficient disjunctive reaso.. - Borgida, Etherington - 1989
28 On theories with a combinatorial definition of equivalence (context) - Newman - 1942
27 Personal Communication (context) - Crawford - 1994
22 Domain abstraction and limited reasoning (context) - Imielinski - 1987
22 Completion and its applications (context) - Dershowitz - 1989
21 An efficient arc consistency algorithm for a class of CSP pr.. (context) - Deville, Hentenryck - 1991
20 Tractable approximate deduction using limited vocabularies (context) - Dalal, Etherington - 1992
17 Towards a theory of access-limited logic for knowledge repre.. - Crawford, Kuipers - 1989
16 Modern Applied Algebra (context) - Birkhoff, Bartee - 1970
16 Polynomially solvable satisfiability problems (context) - Gallo, Scutella - 1988
14 Constraint satisfaction - Dechter - 1991
12 Exploiting locality in a TMS (context) - de Kleer - 1990
12 Inference without chaining (context) - Frisch - 1987
11 Negation and proof by contradiction in access-limited logic - Crawford, Kuipers - 1991
10 Approximation in concept description languages (context) - Cadoli, Schaerf - 1992
7 Complexity tailored design: A new design methodology for dat.. - Imielinski, Meyden et al. - 1994
4 On generalized Horn formulas and k-resolution (context) - Buning - 1992
4 A short proof of the pigeon hole principle using extended re.. (context) - Cook - 1976
4 A systematic approach to relational database theory (context) - Imielinski, Lipski - 1982
4 Consistency in networks of relations (context) - Macworth - 1977
4 Update constraints for relational databases (context) - Griffin, Trickey et al. - 1992
3 and nothing but the truth: An indexed bibliography to the li.. (context) - Martins, the - 1991
3 Lucid representations - Davis - 1991
2 Personal Communication (context) - McCarty - 1995
1 Computability and Complexity (context) - Yasuhara - 1994
1 A sufficient condition for backtract-bounded search (context) - Freuder - 1985
1 the logic of relevance and neccessity (context) - Anderson, Belnap - 1975
1 A sufficient condition for backtract-free search (context) - Freuder - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.columbia.edu.html): More
Interfacing Oz with the PCTE OMS - Lee, Kaiser (1996) (Correct)
An Architecture for WWW-based Hypercode Environments - Kaiser, Dossick, Jiang, Yang (1996) (Correct)
Incremental Process Support for Code Reengineering: An .. - Kaiser, Heineman.. (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