Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAAI
1998

favoriteEmaildiscussreport

110views Intelligent Agents» more AAAI 1998»

Computing Intersections of Horn Theories for Reasoning with Models

13 years 5 months ago

Computing Intersections of Horn Theories for Reasoning with Models

Download www.aaai.org

We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We present efficient algorithms or prove intractability for the major computation problems for Horn knowledge bases. We also consider an extension of Horn theories, for which negative results are obtained. They indicate that generalizing the positive results beyond Horn theories is not immediate.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Real-time Traffic

AAAI 1998 | Horn Theories | Intelligent Agents | Knowledge Bases | Logical Knowledge Bases |

claim paper

Related Content

» Reasoning With Characteristic Models

» Generating All Abductive Explanations for Queries on Propositional Horn Theories

» Proof Theory for Kleene Algebra

» Incremental Recompilation of Knowledge

» Reducing protocol analysis with XOR to the XORfree case in the horn theory based approach

» A Hidden Herbrand Theorem

» A Proof Theory for DLLite

» Compositional Analysis for Equational Horn Programs

» Logic and Computation in a Lambda Calculus with Intersection and Union Types

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	AAAI
Authors	Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Comments (0)