Thomas Eiter, et al.  Home/Search
Context Related
| kr.tuwien.ac.at/pub/tr/rr0006.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: kr.tuwien.ac.at/research/repor... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form " ! ", which informally read as "generally, if then ." Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties and interrelationships of these formalisms are quite well understood, about their... (Update)
Context of citations to this paper: More
...Here, hardness for follows from Theorem 7. 10 and and hardness of deciding and lex entailment, respectively, in classical default reasoning [23]. deciding if D h complete. deciding whether D are literal Horn. The next two theorems show that TIGHT CONSEQUENCE...
...conditional constraints, and (ii) producing a reduced set of variables for the linear optimization problems. The former is inspired by [28, 16], while the latter is taken from [29] # Interestingly, it turns out that the technique of generating a reduced set of variables taken...
Cited by: More
Probabilistic Logic under Coherence: Complexity and Algorithms - Biazzo (2002) (Correct)
Nonmonotonic Probabilistic Logics between Model-Theoretic.. - Lukasiewicz (2002) (Correct)
Nonmonotonic Probabilistic Reasoning under Variable-Strength.. - Lukasiewicz (Correct)
Similar documents (at the sentence level): More
73.2%: Default Reasoning from Conditional Knowledge Bases.. - Eiter, Lukasiewicz (2000) (Correct)
37.4%: Complexity Results for Default Reasoning from Conditional.. - Eiter, al. (1999) (Correct)
11.9%: Complexity Results for Default Reasoning from Conditional.. - Eiter, Lukasiewicz (1999) (Correct)
Active bibliography (related documents): More All
0.7: Probabilistic Default Reasoning with Strict and Defeasible . . . - Lukasiewicz (2000) (Correct)
0.5: Probabilistic Default Reasoning with Conditional Constraints - Lukasiewicz (2000) (Correct)
0.5: Extending the Maximum Entropy Approach to Variable Strength.. - Bourne, Parsons (2000) (Correct)
Similar documents based on text: More All
1.8: Causes and Explanations in the Structural-Model Approach.. - Eiter, al. (2002) (Correct)
1.2: On Computing All Abductive Explanations - Eiter, Makino (2002) (Correct)
1.2: P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for.. - Giugno, al. (2002) (Correct)
Related documents from co-citation: More All
13: What does a conditional knowledge base entail (context) - Lehmann - 1989
11: Probabilistic deduction with conditional constraints over basic events - Lukasiewicz - 1998
11: A logic for reasoning about probabilities - Fagin, Halpern et al. - 1990
BibTeX entry: (Update)
T. Eiter and T. Lukasiewicz. Default reasoning from conditional knowledge bases: Complexity and tractable cases, 2000. Manuscript. http://citeseer.ist.psu.edu/article/eiter00default.html More
@article{ eiter00default,
author = "Thomas Eiter and Thomas Lukasiewicz",
title = "Default reasoning from conditional knowledge bases: Complexity and tractable cases",
journal = "Artificial Intelligence",
volume = "124",
number = "2",
pages = "169-241",
year = "2000",
url = "citeseer.ist.psu.edu/article/eiter00default.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
951 Computational Complexity (context) - Papadimitriou - 1994
850 A logic for default reasoning (context) - Reiter - 1980
451 Circumscription -- a form of non-monotonic reasoning (context) - McCarthy - 1980
311 Semantical considerations on nonmonotonic logics (context) - Moore - 1985
274 A catalog of complexity classes (context) - Johnson - 1990
224 preferential models and cumulative logics (context) - Kraus, Lehmann et al. - 1990
189 Parameterized Complexity - Downey, Fellows et al. - 1998
166 Computing circumscription (context) - Lifschitz - 1985
161 Complexity results for nonmonotonic logics (context) - Gottlob - 1992
156 Propositional knowledge base revision and minimal change (context) - Katsuno, Mendelzon - 1991
151 The complexity of optimization problems (context) - Krentel - 1988
129 What does a conditional knowledge base entail (context) - Lehmann - 1989
129 What does a conditional knowledge base entail (context) - Lehmann, Magidor - 1992
120 Investigations into a theory of knowledge base revision - Dalal - 1988
118 Non-monotonic logic (context) - McDermott, Doyle - 1980
114 Ordinal conditional functions: A dynamic theory of epistemic.. (context) - Spohn - 1988
105 Bounded query classes (context) - Wagner - 1990
101 Inconsistency management and prioritized syntaxbased entailm.. (context) - Benferhat, Cayrol et al. - 1993
96 the complexity of propositional knowledge base revision - Eiter, Gottlob - 1992
91 Propositional circumscription and extended closed world reas.. - Eiter, Gottlob - 1993
89 Nonmonotonic Logics -- Context-Dependent Reasoning (context) - Marek, Truszczynski - 1993
88 Hard problems for simple default logics - Kautz, Selman - 1991
84 The complexity of logic-based abduction - Eiter, Gottlob - 1995
84 The KR system dlv: Progress report (context) - Eiter, Leone et al. - 1998
77 the logic of theory change: Partial meet contraction and rev.. (context) - Alchourron, Gardenfors et al. - 1985
75 Complexity and expressive power of logic programming - Dantsin, Eiter et al. - 1997
72 Default Reasoning: Causal and Conditional Theories (context) - Geffner - 1992
72 Belief revision and default reasoning: Syntax-based approach.. - Nebel - 1991
69 A semantical approach to nonmonotonic logics (context) - Shoham - 1987
62 Non-monotonic logic II: Nonmonotonic modal theories (context) - McDermott - 1982
62 Handbook of Logic in Artificial Intelligence and Logic Progr.. (context) - Gabbay, Hogger et al. - 1994
61 A taxonomy of complexity classes of functions - Selman - 1994
59 Rank-based systems: A simple approach to belief revision (context) - Goldszmidt, Pearl - 1992
59 A maximum entropy approach to nonmonotonic reasoning (context) - Goldszmidt, Morris et al. - 1993
58 Conditional logics of normality: A modal approach (context) - Boutilier - 1994
57 Conditional entailment: Bridging two approaches to default r.. (context) - Geffner, Pearl - 1992
57 A natural ordering of defaults with tractable applications t.. (context) - Pearl - 1990
56 Belief revision (context) - Gardenfors, Rott - 1995
56 Smodels - an implementation of the stable model and well-fou.. - Niemela, Simons - 1997
52 An algorithm to evaluate quantified Boolean formulae - Cadoli, Giovanardi et al. - 1998
50 From statistical knowledge bases to degrees of belief - Bacchus, Grove et al. - 1996
50 Probabilistic semantics for nonmonotonic reasoning: A survey (context) - Pearl - 1989
49 Representing default rules in possibilistic logic - Benferhat, Dubois et al. - 1992
48 The complexity of propositional default logic (context) - Stillman - 1992
43 Mixed integer programming methods for computing nonmonotonic.. - Bell, Nerode et al. - 1994
41 The complexity of model checking for circumscriptive formula.. - Cadoli - 1992
38 Abduction from logic programs: Semantics and complexity - Eiter, Gottlob et al. - 1997
37 The comparative linguistics of knowledge representation - Gogic, Kautz et al. - 1995
36 Qualitative probabilities for default reasoning (context) - Goldszmidt, Pearl - 1996
35 On truth-table reducibility to SAT - Buss, Hay - 1991
35 Improvements to the evaluation of quantified Boolean formula.. - Rintanen - 1999
33 the decidability and complexity of autoepistemic reasoning (context) - Niemela - 1992
32 Unifying default reasoning and belief revision in a modal fr.. (context) - Boutilier - 1994
32 Computing functions with parallel queries to NP - Jenner, Toran - 1995
31 It's not my default: The complexity of membership problems i.. (context) - Stillman - 1990
30 non-monotonicity and related issues (context) - Dubois, Prade et al. - 1991
28 Plausibility measures and default reasoning - Friedman, Halpern
27 the use of integer programming models in AI planning - Vossen, Ball et al. - 1999
26 the consistency of defeasible databases (context) - Goldszmidt, Pearl - 1991
26 Polynomial-time inference of all valid implications for Horn.. (context) - Boros, Crama et al. - 1990
25 Handbook on Defeasible Reasoning and Uncertainty Management .. (context) - Gabbay, Smets - 1998
24 Discrete Applied Mathematics (context) - Boros, Hammer et al. - 1994
22 Belief functions and default reasoning - Benferhat, Saffiotti et al.
22 How hard is it to revise a belief base - Nebel - 1998
20 Solving advanced reasoning tasks using quantified Boolean fo.. - Egly, Eiter et al. - 2000
20 The complexity of propositional closed world reasoning and c.. (context) - Cadoli, Lenzerini - 1994
20 A first-order conditional logic for prototypical properties (context) - Delgrande - 1987
20 conditional objects and possibility theory (context) - Benferhat, Dubois et al. - 1997
20 Conditional objects as non-monotonic consequence relationshi.. - Dubois, Prade - 1994
18 volume 86 of Synthese Library (context) - Adams, of - 1975
17 A formalism for reasoning with variable strength defaults (context) - Goldszmidt, Pearl - 1991
16 A promenade from monotonicity to non-monotonicity following .. (context) - Lamarre - 1992
15 the complexity of conditional logics - Friedman, Halpern - 1994
13 as the conditional logic of nonmonotonicity (context) - Lamarre - 1991
11 Mind and Machines (context) - Geffner, model et al. - 1992
11 Maximum entropy and variable strength defaults - Bourne, Parsons - 1999
11 Conditional logics of normality as modal systems (context) - Boutilier - 1990
10 Fixed parameter complexity in AI and nonmonotonic reasoning - Gottlob, Scarcello et al. - 1999
10 Annals of Mathematics and Artificial Intelligence (context) - Lehmann, on - 1995
10 Computing with default logic - Cholewinski, Marek et al. - 1999
9 and parallel circumscription (context) - Janhunen, intertranslatability et al. - 1998
9 Feasibility and unfeasibility of off-line processing - Cadoli, Donini et al. - 1996
8 Nonmonotonic reasoning: From complexity to algorithms - Cayrol, Lagasquie-Schiex et al. - 1998
8 The complexity of belief update - Liberatore - 1997
5 volume 35 of DIMACS Series in Discrete Mathematics and Theor.. (context) - Du, Gu et al. - 1997
4 NP-complete problems in optimal Horn clauses satisfiability (context) - Ben-Eliyahu - 1991
3 Base revision operators and schemes: Semantics (context) - Nebel - 1994
3 On first-order conditional logics (context) - Delgrande - 1998
2 Default reasoning using maximum entropy and variable strengt.. - Bourne - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.kr.tuwien.ac.at/research/reports/): More
Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1999) (Correct)
On ACTL Formulas Having Deterministic Counterexamples - Buccafurri, al. (1999) (Correct)
Heterogeneous Active Agents, II: Algorithms and Complexity - Eiter, al. (1998) (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