Marco Cadoli, Marco Schaerf  Home/Search
Context Related
| dis.uniroma1.it/PU...cadoscha94.ps.gz dis.uniroma1.it/pu...cadoscha94.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: hermes.dis.uniroma...publications (more) From: hermes.dis.uniroma1.it...report96 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Multivalued logics have a long tradition in the philosophy and logic literature that originates from the work by / Lukaszewicz in the 20's. More recently, many AI researchers have been interested in this topic for both semantic and computational reasons. Multivalued logics have indeed been frequently used both for their semantic properties and as tools for designing tractable reasoning systems. We focus here on the computational aspects of multivalued logics. The main result of this paper is a... (Update)
Context of citations to this paper: More
.... lead to polynomial decision procedures and results of this kind were used in knowledge representation [46] An overview of related results is [16]. The NP complete satisfiability problems for regular formulas and Regular DPL exhibit the phase transition phenomena encountered in...
.... in [ Cadoli and Schaerf, 1995 ] for formulas in negation normal form, but is not extendable to formulas in arbitrary forms [ Cadoli and Schaerf, 1996 ] The good point of Schaerf and Cadoli s systems is that they present an incremental algorithm to test for S i entailment as...
Cited by: More
Logics for Approximate Reasoning: - Approximating Classical Logic (Correct)
Three-valued Logics for Inconsistency Handling - Konieczny, Marquis (Correct)
Approximate Belief Revision - Chopra, Parikh (2000) (Correct)
Active bibliography (related documents): More All
0.7: Tractable Reasoning via Approximation - Schaerf, Cadoli (1995) (Correct)
0.7: Approximate Inference in Default Logic and Circumscription - Cadoli, Schaerf (1992) (Correct)
0.2: Knowledge Compilation and Theory Approximation - Selman, Kautz (1996) (Correct)
Similar documents based on text: More All
0.3: Discovery of Multivalued Dependencies from Relations - Savnik, Flach (2000) (Correct)
0.3: Conley Index for Discrete Multivalued Dynamical Systems - Kaczynski, Mrozek (1997) (Correct)
0.3: Multivalued Image Segmentation Based on First Fundamental Form - Scheunders (Correct)
Related documents from co-citation: More All
4: Entailment: The Logic of Relevance and Necessity (context) - Anderson, Belnap - 1975
3: Approximate inference in default logic and circumscription - Cadoli, Schaerf - 1992
3: Tractable reasoning via approximation - Schaerf, Cadoli - 1995
BibTeX entry: (Update)
M. Cadoli and M. Schaerf. On the complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence, 18(1):29--50, 1997. http://citeseer.ist.psu.edu/cadoli97complexity.html More
@article{ cadoli96complexity,
author = "Marco Cadoli and Marco Schaerf",
title = "On the complexity of Entailment in Propositional Multivalued Logics",
journal = "Annals of Mathematics and Artificial Intelligence",
volume = "18",
number = "1",
pages = "29-50",
year = "1996",
url = "citeseer.ist.psu.edu/cadoli97complexity.html" }
Citations (may not include all citations):686 A Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
534 The complexity of theorem-proving procedures (context) - Cook - 1971
379 The complexity of relational query languages (context) - Vardi - 1982
312 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
183 A useful four-valued logic (context) - Belnap - 1977
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
161 A logic of implicit and explicit belief (context) - Levesque - 1984
150 Entailment: The Logic of Relevance and Necessity (context) - Anderson, Belnap - 1975
141 The complexity of finite functions (context) - Boppana, Sipser - 1990
99 Multivalued logics: A uniform approach to reasoning in artif.. (context) - Ginsberg - 1988
71 A logic for reasoning with inconsistency - Kifer, Lozinskii - 1992
66 A knowledge-level account of abduction (context) - Levesque - 1989
51 Fundamentals of data structures (context) - Horowitz, Sahni - 1976
36 Logic and the complexity of reasoning (context) - Levesque - 1988
34 Impossible possible worlds vindicated (context) - Hintikka - 1975
30 A four-valued semantics for terminological logic (context) - Patel-Schneider - 1989
28 A nonstandard approach to the logical omniscience problem - Fagin, Halpern et al. - 1990
19 Three-valued formalizations of non-monotonic reasoning and l.. (context) - Przymusinski - 1989
19 A decidable first-order logic for knowledge representation (context) - Patel-Schneider - 1990
12 Inference without chaining (context) - Frisch - 1987
10 Approximation in concept description languages (context) - Cadoli, Schaerf - 1992
10 Tractable meta-reasoning in propositional logics of belief (context) - Lakemeyer - 1987
9 Efficient propositional constraint propagation (context) - Dalal - 1992
8 Using model theory to specify AI programs (context) - Frisch - 1985
5 Approximate reasoning and non-omniscient agents (context) - Cadoli, Schaerf - 1992
Documents on the same site (http://hermes.dis.uniroma1.it/~schaerf/publications.html): More
Tractable Reasoning via Approximation - Schaerf, Cadoli (1995) (Correct)
A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993) (Correct)
Negation And Minimality In Disjunctive Databases - Schaerf (1995) (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