On the Complexity of Some Inductive Logic Programming Problems

On the Complexity of Some Inductive Logic Programming Problems

Εμφάνιση άλλων εκδόσεων (1)

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς:	Gottlob, G, Leone, N, Scarcello, F
Μορφή:	Conference item
Έκδοση:	Springer 1997

Παρόμοια τεκμήρια

On the Complexity of Some Inductive Logic Programming Problems
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
ανά: Gottlob, G, κ.ά.
Έκδοση: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
ανά: Gottlob, G, κ.ά.
Έκδοση: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
ανά: Gottlob, G, κ.ά.
Έκδοση: (2001)

Complexity Results for Abductive Logic Programming
ανά: Eiter, T, κ.ά.
Έκδοση: (1995)

Abduction from Logic Programs: Semantics and Complexity
ανά: Eiter, T, κ.ά.
Έκδοση: (1997)

The complexity of acyclic conjunctive queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (2001)

The Complexity of Acyclic Conjunctive Queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (1998)

On the Indiscernibility of Individuals in Logic Programming
ανά: Eiter, T, κ.ά.
Έκδοση: (1997)

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
ανά: Gottlob, G, κ.ά.
Έκδοση: (2005)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
ανά: Eiter, T, κ.ά.
Έκδοση: (1993)

Complexity and Expressive Power of Disjunctive Logic Programming
ανά: Gottlob, G
Έκδοση: (1994)

Succinctness as a Source of Complexity in Logical Formalisms
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

Complexity and Expressive Power of Logic Programming
ανά: Dantsin, E, κ.ά.
Έκδοση: (1997)

Complexity and expressive power of logic programming
ανά: Dantsin, E, κ.ά.
Έκδοση: (2001)

Computing LOGCFL certificates
ανά: Gottlob, G, κ.ά.
Έκδοση: (2002)

Hypertree Decompositions and Tractable Queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (1998)

On Tractable Queries and Constraints
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

Hypertree Decompositions: A Survey
ανά: Gottlob, G, κ.ά.
Έκδοση: (2001)

Hypertree Decompositions and Tractable Queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (2002)

Hypertree Decompositions and Tractable Queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

A Comparison of Structural CSP Decomposition Methods
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

A comparison of structural CSP decomposition methods
ανά: Gottlob, G, κ.ά.
Έκδοση: (2000)

Computing LOGCFL Certificates
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

Hypertree Decompositions and Tractable Queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
ανά: Gottlob, G, κ.ά.
Έκδοση: (1999)

Fixed−parameter complexity in AI and nonmonotonic reasoning
ανά: Gottlob, G, κ.ά.
Έκδοση: (2002)

Complexity Results for Nonmonotonic Logics
ανά: Gottlob, G
Έκδοση: (1992)

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
ανά: Gottlob, G, κ.ά.
Έκδοση: (2017)

Hypertree decompositions: questions and answers
ανά: Gottlob, G, κ.ά.
Έκδοση: (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, κ.ά.
Έκδοση: (1995)

The Complexity of Logic−Based Abduction
ανά: Eiter, T, κ.ά.
Έκδοση: (1993)

Logic Programming and Databases
ανά: Ceri, S, κ.ά.
Έκδοση: (1990)

Complexity Results for Logic−Based Abduction
ανά: Eiter, T, κ.ά.
Έκδοση: (1992)

A logical approach to multicut problems
ανά: Gottlob, G, κ.ά.
Έκδοση: (2007)

Generalized Quantifiers in Logic Programs
ανά: Eiter, T, κ.ά.
Έκδοση: (1997)

Visual Data Extraction Through Visual Logic Programming
ανά: Gottlob, G
Έκδοση: (2002)

Second Order Logic and the Weak Exponential Hierarchies
ανά: Gottlob, G, κ.ά.
Έκδοση: (1995)

Modular Logic Programming and Generalized Quantifiers
ανά: Eiter, T, κ.ά.
Έκδοση: (1997)