Sciweavers

37 search results - page 3 / 8
» A Tractability Result for Reasoning with Incomplete First-Or...
Sort
View
EPIA
2007
Springer
13 years 11 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
DLOG
2011
12 years 9 months ago
Relaxed Abduction: Robust Information Interpretation for Incomplete Models
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
KR
2004
Springer
13 years 11 months ago
A Logic of Limited Belief for Reasoning with Disjunctive Information
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
Yongmei Liu, Gerhard Lakemeyer, Hector J. Levesque
AI
2008
Springer
13 years 5 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
AUSAI
1999
Springer
13 years 10 months ago
Feasibility of Optimised Disjunctive Reasoning for Approximate Matching
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
Ian Horrocks, Lin Padgham, Laura Thomson