Boosting Information Integration: The INFOMIX System

Boosting Information Integration: The INFOMIX System

Detalhes bibliográficos
Main Authors:	Leone, N, Eiter, T, Faber, W, Fink, M, Gottlob, G, Greco, G
Formato:	Conference item
Publicado em:	2005

Registos relacionados

The INFOMIX system for advanced integration of incomplete and inconsistent data
Por: Leone, N, et al.
Publicado em: (2005)

Sistem kawalan inventori berasaskan web di Infomix Supply & Trading /
Por: 357408 Jannaltul Firdaus Azmi
Publicado em: (2002)

The DLV System for Knowledge Representation and Reasoning
Por: Leone, N, et al.
Publicado em: (2002)

The DLV system for knowledge representation and reasoning
Por: Leone, N, et al.
Publicado em: (2006)

Abduction from Logic Programs: Semantics and Complexity
Por: Eiter, T, et al.
Publicado em: (1997)

On the Indiscernibility of Individuals in Logic Programming
Por: Eiter, T, et al.
Publicado em: (1997)

Semantics and Complexity of Abduction from Default Theories
Por: Eiter, T, et al.
Publicado em: (1997)

Complexity Results for Abductive Logic Programming
Por: Eiter, T, et al.
Publicado em: (1995)

Semantics and Complexity of Abduction from Default Theories
Por: Eiter, T, et al.
Publicado em: (1995)

The dlv System: Model Generator and Advanced Frontends (system description)
Por: Citrigno, S, et al.
Publicado em: (1997)

Data Integration: a Challenging ASP Application
Por: Leone, N, et al.
Publicado em: (2005)

On ACTL Formulas Having Linear Counterexamples
Por: Buccafurri, F, et al.
Publicado em: (2001)

Enhancing Model Checking in Verification by AI Techniques
Por: Buccafurri, F, et al.
Publicado em: (1999)

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
Por: Eiter, T, et al.
Publicado em: (1993)

The DLV System
Por: Leone, N, et al.
Publicado em: (2002)

Information Extraction for the Semantic Web
Por: Baumgartner, R, et al.
Publicado em: (2005)

Complexity Results for Logic−Based Abduction
Por: Eiter, T, et al.
Publicado em: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
Por: Eiter, T, et al.
Publicado em: (1992)

Mächtigkeit von Logikprogrammierung über Datenbanken
Por: Eiter, T, et al.
Publicado em: (1996)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
Por: Eiter, T, et al.
Publicado em: (1992)

Reasoning with parsimonious and moderately grounded expansions
Por: Eiter, T, et al.
Publicado em: (1992)

On the Complexity of Theory Curbing
Por: Eiter, T, et al.
Publicado em: (2000)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
Por: Eiter, T, et al.
Publicado em: (1997)

The Complexity of Logic−Based Abduction
Por: Eiter, T, et al.
Publicado em: (1995)

Reasoning under minimal upper bounds in propositional logic
Por: Eiter, T, et al.
Publicado em: (2006)

The Complexity of Logic−Based Abduction
Por: Eiter, T, et al.
Publicado em: (1993)

Complexity of Propositional Knowledge Base Revision
Por: Eiter, T, et al.
Publicado em: (1992)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
Por: Eiter, T, et al.
Publicado em: (1997)

Complexity Aspects of Various Semantics for Disjunctive Databases
Por: Eiter, T, et al.
Publicado em: (1993)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
Por: Eiter, T, et al.
Publicado em: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
Por: Eiter, T, et al.
Publicado em: (1993)

Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
Por: Eiter, T, et al.
Publicado em: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
Por: Eiter, T, et al.
Publicado em: (1996)

Identifying the Minimal Transversals of a Hypergraph and Related Problems
Por: Eiter, T, et al.
Publicado em: (1995)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
Por: Eiter, T, et al.
Publicado em: (1995)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
Por: Eiter, T, et al.
Publicado em: (1998)

Hypergraph Transversal Computation and Related Problems in Logic and AI
Por: Eiter, T, et al.
Publicado em: (2002)

Reasoning under minimal upper bounds in propositional logic
Por: Eiter, T, et al.
Publicado em: (2006)

Second−Order Logic over Strings: Regular and Non−regular Fragments
Por: Eiter, T, et al.
Publicado em: (2001)

Complexity of propositional nested circumscription and nested abnormality theories
Por: Cadoli, M, et al.
Publicado em: (2005)