Marco Schaerf, Marco Cadoli  Home/Search
Context Related
Links: ACM DBLP | dis.uniroma1.it/PU...schacado93.ps.gz dis.uniroma1.it/pu...schacado93.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: dis.uniroma1.it...lications.shtml (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Problems in logic are well-known to be hard to solve in the worst case. Two different strategies for dealing with this aspect are known from the literature: language restriction and theory approximation. In this paper we are concerned with the second strategy. Our main goal is to define a semantically well-founded logic for approximate reasoning, which is justifiable from the intuitive point of view, and to provide fast algorithms for dealing with it even when using expressive languages. We... (Update)
Cited by: More
Computing Discrete Fréchet Distance - Eiter, Mannila (1994) (Correct)
Taking the Relative Significance of Inconsistencies into Account - Hunter (Correct)
Probable Consistency Checking For Sets Of Propositional Clauses - Hunter (Correct)
Active bibliography (related documents): More All
2.4: Approximate Inference in Default Logic and Circumscription - Cadoli, Schaerf (1992) (Correct)
0.7: On the Complexity of Entailment in Propositional Multivalued.. - Cadoli, Schaerf (1997) (Correct)
0.6: A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993) (Correct)
Similar documents based on text: More All
0.4: Logic Programming and Autoepistemic Logics: New Relations and.. - Schaerf (1992) (Correct)
0.4: Space Efficiency of Propositional Knowledge Representation.. - Cadoli, al. (2000) (Correct)
0.4: Query Answering in Concept-Based Knowledge Representation.. - Schaerf (1994) (Correct)
Related documents from co-citation: More All
12: A logic of implicit and explicit belief (context) - Levesque - 1984
10: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
8: Computing approximate diagnoses by using approximate entailment - Teije, van Harmelen - 1996
BibTeX entry: (Update)
M. Schaerf and M. Cadoli. Tractable reasoning via approximation. AIJ, 74:1--62, 1995. http://citeseer.ist.psu.edu/schaerf95tractable.html More
@article{ schaerf95tractable,
author = "Marco Schaerf and Marco Cadoli",
title = "Tractable Reasoning via Approximation",
journal = "Artificial Intelligence",
volume = "74",
number = "2",
pages = "249-310",
year = "1995",
url = "citeseer.ist.psu.edu/schaerf95tractable.html" }
Citations (may not include all citations):815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977 DBLP
634 A machine oriented logic based on the resolution principle (context) - Robinson - 1965
534 The complexity of theorem-proving procedures (context) - Cook - 1971 ACM DBLP
480 An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985 DBLP
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960 ACM DBLP
402 An analysis of time-dependent planning (context) - Dean, Boddy - 1988
343 Modal Logic: an introduction (context) - Chellas - 1980
267 Network-based heuristics for constraint-satisfaction problem.. (context) - Dechter, Pearl - 1988 ACM DBLP
231 CLASSIC: A structural data model for objects - Borgida, Brachman et al. - 1989 ACM DBLP
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967 ACM
207 Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991 ACM DBLP
197 The complexity of concept languages - Donini, Lenzerini et al. - 1991
194 Knowledge and belief (context) - Hintikka - 1962
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984 DBLP
186 Automated Theorem Proving: A Logical basis (context) - Loveland - 1978
176 A correspondence theory for terminological logics: Prelimina.. - Schild - 1991 DBLP
161 A logic of implicit and explicit belief (context) - Levesque - 1984 DBLP
150 Entailment: The Logic of Relevance and Necessity (context) - Anderson, Belnap - 1975
130 The computational complexity of provability in systems of mo.. (context) - Ladner - 1977 DBLP
127 The complexity of satisfiability problems (context) - Schaefer - 1978 ACM DBLP
112 Terminological reasoning is inherently intractable - Nebel - 1990
102 Semantical considerations on modal logic (context) - Kripke - 1963
97 Knowledge compilation using Horn approximations - Selman, Kautz - 1991 DBLP
88 Hard problems for simple default logics - Kautz, Selman - 1991
85 Composing real-time systems - Russell, Zilberstein - 1991 DBLP
84 The complexity of logic-based abduction - Eiter, Gottlob - 1993 ACM DBLP
77 Tractable concept languages (context) - Donini, Lenzerini et al. - 1991 DBLP
72 A fundamental tradeoff in knowledge representation and reaso.. (context) - Brachman, Levesque - 1985
66 A knowledge-level account of abduction (context) - Levesque - 1989 DBLP
64 Solving propositional satisfiability problems (context) - Jeroslow, Wang - 1990
56 The complexity of existential quantification in concept lang.. - Donini, Hollunder et al. - 1992 ACM DBLP
44 awareness and limited reasoning (context) - Fagin, Halpern - 1988
43 Forming concepts for fast inference - Kautz, Selman - 1992
36 Logic and the complexity of reasoning (context) - Levesque - 1988
36 Logic and artificial intelligence (context) - Nilsson - 1991 ACM DBLP
31 It's not my default: The complexity of membership problems i.. (context) - Stillman - 1990 DBLP
30 A four-valued semantics for terminological logic (context) - Patel-Schneider - 1989
30 Mathematical Logic (context) - Kleene - 1966
28 A nonstandard approach to the logical omniscience problem - Fagin, Halpern et al. - 1990 ACM DBLP
24 Querying logical databases (context) - Vardi - 1986 ACM DBLP
23 The complexity of closed world reasoning and circumscription (context) - Cadoli, Lenzerini - 1990 DBLP
23 Semantical and computational aspects of Horn approximations - Cadoli - 1993 ACM DBLP
22 Domain abstraction and limited reasoning (context) - Imielinski - 1987 DBLP
22 CLASSIC to practice: Knowledge representation theory meets r.. (context) - Brachman - 1992
22 The tractability of path-based inheritance (context) - Selman, Levesque - 1989 ACM DBLP
21 Learning useful Horn approximations - Greiner, Schuurmans - 1992 DBLP
21 A hierarchy of tractable satisfiability problems (context) - Dalal, Etherington - 1992 ACM DBLP
19 A decidable first-order logic for knowledge representation (context) - Patel-Schneider - 1990 ACM DBLP
18 Login: a logic programming language with built-in inheritanc.. (context) - Ait-Kaci, Nasr - 1986 ACM DBLP
16 A general framework for knowledge compilation - Kautz, Selman - 1991 ACM DBLP
16 Polynomially solvable satisfiability problems (context) - Gallo, Scutella - 1988 ACM DBLP
14 A satisfiability tester for non-clausal propositional calcul.. (context) - Van Gelder - 1988 ACM DBLP
12 Solvable classes of quantificational formulas (context) - Dreben, Goldfarb et al. - 1979
12 Inference without chaining (context) - Frisch - 1987 DBLP
11 Computational considerations in reasoning about action - Ginsberg - 1991 DBLP
10 Tractable meta-reasoning in propositional logics of belief (context) - Lakemeyer - 1987 DBLP
10 Approximation in concept description languages (context) - Cadoli, Schaerf - 1992 DBLP
8 Using model theory to specify AI programs (context) - Frisch - 1985 DBLP
8 The monotonic abduction problem: A functional characterizati.. (context) - Bylander - 1991 DBLP
8 Data models and languages for databases (context) - Beeri - 1988 ACM DBLP
6 coupled trees (context) - Dunn, for - 1976
5 Approximate entailment (context) - Cadoli, Schaerf - 1991 ACM DBLP
5 Approximate reasoning and non-omniscient agents (context) - Cadoli, Schaerf - 1992 ACM DBLP
4 Artificial Intelligence Journal (context) - Giunchiglia, Walsh et al. - 1992
4 Tractable instances of some hard deduction problems (context) - Dalal - 1992 ACM DBLP
4 Anytime declarativism (context) - Ginsberg - 1991
3 Presented at the 4th International Workshop on Nonmonotonic .. (context) - Etherington, Crawford et al. - 1992
2 Towards a theory of access limited reasoning (context) - Crawford, Kuipers - 1989
2 The role of logic in knowledge representation (context) - Israel - 1983
1 Reasoning about knowledge: A survey circa (context) - Halpern - 1991
1 Inside the LOOM desscription classifier (context) - MacGregor - 1991
1 To appear (context) - Cadoli, Schaerf et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hermes.dis.uniroma1.it/~schaerf/publications.html): More
A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993) (Correct)
Negation And Minimality In Disjunctive Databases - Schaerf (1995) (Correct)
On Compact Representations of Propositional.. - Cadoli, Donini, 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