MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Computational Complexity of Abduction." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

17 documents found, showing 1 through 10. Next 10 →

ATOM

The Computational Complexity of Abduction
by Tom Bylander, Dean Allemang, Michael C. Tanner, John R. Josephson — 1991
…The Computational Complexity of Abduction Tom Bylander, Dean Allemang, Michael C. Tanner, and John…
Cited by 83 (3 self) – Add To MetaCart

Situated Semantics is a Side-Effect of the Computational Complexity of Abduction
by Tim Menzies — 1995
…Situated Semantics is a Side-Effect of the Computational Complexity of Abduction ABSTRACT: We…
Cited by 5 (5 self) – Add To MetaCart

Compilability of Abduction
by Paolo Liberatore, Marco Schaerf — 2000 — Tech. Rep. cs.AI/0210007, Computing Research Repository (CoRR
… investigate whether the computational complexity of abduction can be reduced by an appropriate use…
Cited by 2 (0 self) – Add To MetaCart

Abduction from Logic Programs: Semantics and Complexity
by Thomas Eiter, Georg Gottlob, Nicola Leone — 1998 — Theoretical Computer Science
… can be easily modeled. Second, we precisely determine the computational complexity of abductive…
Cited by 21 (7 self) – Add To MetaCart

Propositional abduction is almost always hard
by Gustav Nordh, Linköpings Universitet — 2005 — In Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI’05
… investigate the computational complexity of abduction, a method of reasoning extensively studied by Peirce…
Cited by 2 (2 self) – Add To MetaCart

A complete classification of the complexity of propositional abduction
by Nadia Creignou, Bruno Zanuttini — 2006 — SIAM Journal on Computing
… by local properties. More precisely, we investigate the computational complexity of propositional abduction…
Cited by 5 (1 self) – Add To MetaCart

The Essence of Problem-Solving Methods: Making Assumptions to Gain Efficiency
by Dieter Fensel, Remco Straatman, K. Vanlehn Problem-solving, Wielinga Et Al, B. J. Wielinga, W. Van, De Velde, A. Th. Schreiber — 1997
…. Bylander, D. Allemang, M. C. Tanner, and J. R. Josephson: The Computational Complexity of Abduction…
Cited by 23 (10 self) – Add To MetaCart

The Complexity of Logic-Based Abduction
by Thomas Eiter, Thomas Eiter, Georg Gottlob, Georg Gottlob — 1993
…-79, Springer LNCS 665, 1993. 1 Introduction This paper is on the computational complexity of abduction, a…
Cited by 124 (28 self) – Add To MetaCart

A First-Order Horn-Clause Abductive System And Its Use In Plan Recognition And Diagnosis
by Hwee Tou Ng, Raymond J. Mooney, Siddarth Subramanian, Brain Sciences, Robert W. Wilensky Underst, Robert W. Wilensky Planning — 1992
… methodology for using a default and abductive reasoning system. Technical Report 89-20, Department of Computer…
Add To MetaCart

Ripple-Down Rationality: A Framework for Maintaining PSMs
by Tim Menzies, Ashesh Mahidadia — 1997 — In Workshop on Problem-Solving Methods for Knowledge-based Systems, IJCAI '97
… on the computational complexity of abduction (x2.4). This section summarises material from other papers [33, 34]. 2…
Cited by 7 (6 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB