On the Complexity of Some Inductive Logic Programming Problems

On the Complexity of Some Inductive Logic Programming Problems

Show other versions (1)

書目詳細資料
Main Authors:	Gottlob, G, Leone, N, Scarcello, F
格式:	Conference item
出版:	Springer 1997

相似書籍

On the Complexity of Some Inductive Logic Programming Problems
由: Gottlob, G, et al.
出版: (1999)

Complexity Results for Abductive Logic Programming
由: Eiter, T, et al.
出版: (1995)

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

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

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

Abduction from Logic Programs: Semantics and Complexity
由: Eiter, T, et al.
出版: (1997)

The complexity of acyclic conjunctive queries
由: Gottlob, G, et al.
出版: (2001)

The Complexity of Acyclic Conjunctive Queries
由: Gottlob, G, et al.
出版: (1998)

On the Indiscernibility of Individuals in Logic Programming
由: Eiter, T, et al.
出版: (1997)

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

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

Complexity and Expressive Power of Disjunctive Logic Programming
由: Gottlob, G
出版: (1994)

Succinctness as a Source of Complexity in Logical Formalisms
由: Gottlob, G, et al.
出版: (1999)

Complexity and Expressive Power of Logic Programming
由: Dantsin, E, et al.
出版: (1997)

Complexity and expressive power of logic programming
由: Dantsin, E, et al.
出版: (2001)

Computing LOGCFL certificates
由: Gottlob, G, et al.
出版: (2002)

Hypertree Decompositions and Tractable Queries
由: Gottlob, G, et al.
出版: (1998)

On Tractable Queries and Constraints
由: Gottlob, G, et al.
出版: (1999)

Hypertree Decompositions: A Survey
由: Gottlob, G, et al.
出版: (2001)

Hypertree Decompositions and Tractable Queries
由: Gottlob, G, et al.
出版: (2002)

Hypertree Decompositions and Tractable Queries
由: Gottlob, G, et al.
出版: (1999)

A Comparison of Structural CSP Decomposition Methods
由: Gottlob, G, et al.
出版: (1999)

A comparison of structural CSP decomposition methods
由: Gottlob, G, et al.
出版: (2000)

Computing LOGCFL Certificates
由: Gottlob, G, et al.
出版: (1999)

Hypertree Decompositions and Tractable Queries
由: Gottlob, G, et al.
出版: (1999)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
由: Gottlob, G, et al.
出版: (1999)

Fixed−parameter complexity in AI and nonmonotonic reasoning
由: Gottlob, G, et al.
出版: (2002)

Complexity Results for Nonmonotonic Logics
由: Gottlob, G
出版: (1992)

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

Hypertree decompositions: questions and answers
由: Gottlob, G, et al.
出版: (2016)

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

The Complexity of Logic−Based Abduction
由: Eiter, T, et al.
出版: (1995)

The Complexity of Logic−Based Abduction
由: Eiter, T, et al.
出版: (1993)

Logic Programming and Databases
由: Ceri, S, et al.
出版: (1990)

Complexity Results for Logic−Based Abduction
由: Eiter, T, et al.
出版: (1992)

A logical approach to multicut problems
由: Gottlob, G, et al.
出版: (2007)

Generalized Quantifiers in Logic Programs
由: Eiter, T, et al.
出版: (1997)

Visual Data Extraction Through Visual Logic Programming
由: Gottlob, G
出版: (2002)

Second Order Logic and the Weak Exponential Hierarchies
由: Gottlob, G, et al.
出版: (1995)

Modular Logic Programming and Generalized Quantifiers
由: Eiter, T, et al.
出版: (1997)