On the Complexity of Some Inductive Logic Programming Problems

On the Complexity of Some Inductive Logic Programming Problems

Show other versions (1)

Bibliografske podrobnosti
Main Authors:	Gottlob, G, Leone, N, Scarcello, F
Format:	Conference item
Izdano:	Springer 1997

Podobne knjige/članki

On the Complexity of Some Inductive Logic Programming Problems
od: Gottlob, G, et al.
Izdano: (1999)

Complexity Results for Abductive Logic Programming
od: Eiter, T, et al.
Izdano: (1995)

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

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

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

Abduction from Logic Programs: Semantics and Complexity
od: Eiter, T, et al.
Izdano: (1997)

The complexity of acyclic conjunctive queries
od: Gottlob, G, et al.
Izdano: (2001)

The Complexity of Acyclic Conjunctive Queries
od: Gottlob, G, et al.
Izdano: (1998)

On the Indiscernibility of Individuals in Logic Programming
od: Eiter, T, et al.
Izdano: (1997)

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

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

Complexity and Expressive Power of Disjunctive Logic Programming
od: Gottlob, G
Izdano: (1994)

Succinctness as a Source of Complexity in Logical Formalisms
od: Gottlob, G, et al.
Izdano: (1999)

Complexity and Expressive Power of Logic Programming
od: Dantsin, E, et al.
Izdano: (1997)

Complexity and expressive power of logic programming
od: Dantsin, E, et al.
Izdano: (2001)

Computing LOGCFL certificates
od: Gottlob, G, et al.
Izdano: (2002)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1998)

On Tractable Queries and Constraints
od: Gottlob, G, et al.
Izdano: (1999)

Hypertree Decompositions: A Survey
od: Gottlob, G, et al.
Izdano: (2001)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (2002)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

A Comparison of Structural CSP Decomposition Methods
od: Gottlob, G, et al.
Izdano: (1999)

A comparison of structural CSP decomposition methods
od: Gottlob, G, et al.
Izdano: (2000)

Computing LOGCFL Certificates
od: Gottlob, G, et al.
Izdano: (1999)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
od: Gottlob, G, et al.
Izdano: (1999)

Fixed−parameter complexity in AI and nonmonotonic reasoning
od: Gottlob, G, et al.
Izdano: (2002)

Complexity Results for Nonmonotonic Logics
od: Gottlob, G
Izdano: (1992)

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

Hypertree decompositions: questions and answers
od: Gottlob, G, et al.
Izdano: (2016)

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

The Complexity of Logic−Based Abduction
od: Eiter, T, et al.
Izdano: (1995)

The Complexity of Logic−Based Abduction
od: Eiter, T, et al.
Izdano: (1993)

Logic Programming and Databases
od: Ceri, S, et al.
Izdano: (1990)

Complexity Results for Logic−Based Abduction
od: Eiter, T, et al.
Izdano: (1992)

A logical approach to multicut problems
od: Gottlob, G, et al.
Izdano: (2007)

Generalized Quantifiers in Logic Programs
od: Eiter, T, et al.
Izdano: (1997)

Visual Data Extraction Through Visual Logic Programming
od: Gottlob, G
Izdano: (2002)

Second Order Logic and the Weak Exponential Hierarchies
od: Gottlob, G, et al.
Izdano: (1995)

Modular Logic Programming and Generalized Quantifiers
od: Eiter, T, et al.
Izdano: (1997)