Tractable reasoning via approximation

&
Artificial Intelligence 74 (2):249-310 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)00009-p

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Is intractability of nonmonotonic reasoning a real drawback?Marco Cadoli, Francesco M. Donini & Marco Schaerf - 1996 - Artificial Intelligence 88 (1-2):215-251.
Dynamic Tractable Reasoning: A Modular Approach to Belief Revision.Holger Andreas - 2020 - Cham, Schweiz: Springer.
An experimental analysis on the similarity of argumentation semantics.Federico Cerutti, Matthias Thimm & Mauro Vallati - 2020 - Argument and Computation 11 (3):269-304.
The size of a revised knowledge base.Marco Cadoli, Francesco M. Donini, Paolo Liberatore & Marco Schaerf - 1999 - Artificial Intelligence 115 (1):25-64.
Truth approximation via abductive belief change.Gustavo Cevolani - 2013 - Logic Journal of the IGPL 21 (6):999-1016.
Formalization, Complexity, and Adaptive Rationality.Ho Mun Chan - 1994 - Dissertation, University of Minnesota
Dovetailing Belief Base Revision with (Basic) Truth Approximation.T. A. F. Kuipers - 2014 - In E. Weber, D. Wouters & J. Meheus (eds.), Logic, Reasoning, and Rationality. Logic, Argumentation & Reasoning (Interdisciplinary Perspectives from the Humanities and Social Sciences), vol 5. Springer. pp. 77-93.
Practical aspects of theoretical reasoning.Gilbert Harman - 2004 - In Piers Rawling & Alfred R. Mele (eds.), The Oxford Handbook of Rationality. Oxford: Oxford University Press. pp. 45--56.
Consequence-based and fixed-parameter tractable reasoning in description logics.František Simančík, Boris Motik & Ian Horrocks - 2014 - Artificial Intelligence 209 (C):29-77.
On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus.Jochen Renz & Bernhard Nebel - 1999 - Artificial Intelligence 108 (1-2):69-123.
Default reasoning from conditional knowledge bases: Complexity and tractable cases.Thomas Eiter & Thomas Lukasiewicz - 2000 - Artificial Intelligence 124 (2):169-241.
Compiling problem specifications into SAT.Marco Cadoli & Andrea Schaerf - 2005 - Artificial Intelligence 162 (1-2):89-120.
Knowledge Grounded on Pure Reasoning.Luis Rosa - 2018 - Pacific Philosophical Quarterly 100 (1):156-173.
Learning tractable Bayesian networks in the space of elimination orders.Marco Benjumeda, Concha Bielza & Pedro Larrañaga - 2019 - Artificial Intelligence 274 (C):66-90.
Max sat approximation beyond the limits of polynomial-time approximation.Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch & Boris Konev - 2001 - Annals of Pure and Applied Logic 113 (1-3):81-94.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,313,626)

6 months
5 (#628,512)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On AGM for Non-Classical Logics.Renata Wassermann - 2011 - Journal of Philosophical Logic 40 (2):271 - 294.
Cut and pay.Marcelo Finger & Dov Gabbay - 2006 - Journal of Logic, Language and Information 15 (3):195-218.

View all 14 citations / Add more citations

References found in this work

Belief, awareness, and limited reasoning.Ronald Fagin & Joseph Y. Halpern - 1987 - Artificial Intelligence 34 (1):39-76.
Hard problems for simple default logics.Henry A. Kautz & Bart Selman - 1991 - Artificial Intelligence 49 (1-3):243-279.
Logic and the complexity of reasoning.Hector J. Levesque - 1988 - Journal of Philosophical Logic 17 (4):355 - 389.

View all 13 references / Add more references