On the Complexity of Some Inductive Logic Programming Problems

On the Complexity of Some Inductive Logic Programming Problems

Show other versions (1)

Detalhes bibliográficos
Main Authors:	Gottlob, G, Leone, N, Scarcello, F
Formato:	Conference item
Publicado em:	Springer 1997

Registos relacionados

On the Complexity of Some Inductive Logic Programming Problems
Por: Gottlob, G, et al.
Publicado em: (1999)

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

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
Por: Gottlob, G, et al.
Publicado em: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
Por: Gottlob, G, et al.
Publicado em: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
Por: Gottlob, G, et al.
Publicado em: (2001)

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

The complexity of acyclic conjunctive queries
Por: Gottlob, G, et al.
Publicado em: (2001)

The Complexity of Acyclic Conjunctive Queries
Por: Gottlob, G, et al.
Publicado em: (1998)

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

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
Por: Gottlob, G, et al.
Publicado em: (2005)

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

Complexity and Expressive Power of Disjunctive Logic Programming
Por: Gottlob, G
Publicado em: (1994)

Succinctness as a Source of Complexity in Logical Formalisms
Por: Gottlob, G, et al.
Publicado em: (1999)

Complexity and Expressive Power of Logic Programming
Por: Dantsin, E, et al.
Publicado em: (1997)

Complexity and expressive power of logic programming
Por: Dantsin, E, et al.
Publicado em: (2001)

Computing LOGCFL certificates
Por: Gottlob, G, et al.
Publicado em: (2002)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (1998)

On Tractable Queries and Constraints
Por: Gottlob, G, et al.
Publicado em: (1999)

Hypertree Decompositions: A Survey
Por: Gottlob, G, et al.
Publicado em: (2001)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (2002)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (1999)

A Comparison of Structural CSP Decomposition Methods
Por: Gottlob, G, et al.
Publicado em: (1999)

A comparison of structural CSP decomposition methods
Por: Gottlob, G, et al.
Publicado em: (2000)

Computing LOGCFL Certificates
Por: Gottlob, G, et al.
Publicado em: (1999)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (1999)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
Por: Gottlob, G, et al.
Publicado em: (1999)

Fixed−parameter complexity in AI and nonmonotonic reasoning
Por: Gottlob, G, et al.
Publicado em: (2002)

Complexity Results for Nonmonotonic Logics
Por: Gottlob, G
Publicado em: (1992)

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
Por: Gottlob, G, et al.
Publicado em: (2017)

Hypertree decompositions: questions and answers
Por: Gottlob, G, et al.
Publicado em: (2016)

Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract)
Por: Gottlob, G
Publicado em: (1993)

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

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

Logic Programming and Databases
Por: Ceri, S, et al.
Publicado em: (1990)

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

A logical approach to multicut problems
Por: Gottlob, G, et al.
Publicado em: (2007)

Generalized Quantifiers in Logic Programs
Por: Eiter, T, et al.
Publicado em: (1997)

Visual Data Extraction Through Visual Logic Programming
Por: Gottlob, G
Publicado em: (2002)

Second Order Logic and the Weak Exponential Hierarchies
Por: Gottlob, G, et al.
Publicado em: (1995)

Modular Logic Programming and Generalized Quantifiers
Por: Eiter, T, et al.
Publicado em: (1997)