Saltar ao contenido
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Idioma
Todos os campos
Title
Autor
Subject
Número de Clasificación
ISBN/ISSN
Tag
Buscar
Avanzado
On the Complexity of Some Indu...
Citar
Text this
Enviar este rexistro por email
Imprimir
Exportar rexistro
Exportar a RefWorks
Exportar a EndNoteWeb
Exportar a EndNote
Permanent link
On the Complexity of Some Inductive Logic Programming Problems
Show other versions (1)
Detalles Bibliográficos
Main Authors:
Gottlob, G
,
Leone, N
,
Scarcello, F
Formato:
Conference item
Publicado:
Springer
1997
Existencias
Descripción
Other Versions (1)
Títulos similares
Staff View
Títulos similares
On the Complexity of Some Inductive Logic Programming Problems
por: Gottlob, G, et al.
Publicado: (1999)
Complexity Results for Abductive Logic Programming
por: Eiter, T, et al.
Publicado: (1995)
Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
por: Gottlob, G, et al.
Publicado: (2003)
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado: (2001)
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado: (2001)
Abduction from Logic Programs: Semantics and Complexity
por: Eiter, T, et al.
Publicado: (1997)
The complexity of acyclic conjunctive queries
por: Gottlob, G, et al.
Publicado: (2001)
The Complexity of Acyclic Conjunctive Queries
por: Gottlob, G, et al.
Publicado: (1998)
On the Indiscernibility of Individuals in Logic Programming
por: Eiter, T, et al.
Publicado: (1997)
The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
por: Gottlob, G, et al.
Publicado: (2005)
Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
por: Eiter, T, et al.
Publicado: (1993)
Complexity and Expressive Power of Disjunctive Logic Programming
por: Gottlob, G
Publicado: (1994)
Succinctness as a Source of Complexity in Logical Formalisms
por: Gottlob, G, et al.
Publicado: (1999)
Complexity and Expressive Power of Logic Programming
por: Dantsin, E, et al.
Publicado: (1997)
Complexity and expressive power of logic programming
por: Dantsin, E, et al.
Publicado: (2001)
Computing LOGCFL certificates
por: Gottlob, G, et al.
Publicado: (2002)
Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1998)
On Tractable Queries and Constraints
por: Gottlob, G, et al.
Publicado: (1999)
Hypertree Decompositions: A Survey
por: Gottlob, G, et al.
Publicado: (2001)
Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (2002)
Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1999)
A Comparison of Structural CSP Decomposition Methods
por: Gottlob, G, et al.
Publicado: (1999)
A comparison of structural CSP decomposition methods
por: Gottlob, G, et al.
Publicado: (2000)
Computing LOGCFL Certificates
por: Gottlob, G, et al.
Publicado: (1999)
Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1999)
Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
por: Gottlob, G, et al.
Publicado: (1999)
Fixed−parameter complexity in AI and nonmonotonic reasoning
por: Gottlob, G, et al.
Publicado: (2002)
Complexity Results for Nonmonotonic Logics
por: Gottlob, G
Publicado: (1992)
Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
por: Gottlob, G, et al.
Publicado: (2017)
Hypertree decompositions: questions and answers
por: Gottlob, G, et al.
Publicado: (2016)
Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract)
por: Gottlob, G
Publicado: (1993)
The Complexity of Logic−Based Abduction
por: Eiter, T, et al.
Publicado: (1995)
The Complexity of Logic−Based Abduction
por: Eiter, T, et al.
Publicado: (1993)
Logic Programming and Databases
por: Ceri, S, et al.
Publicado: (1990)
Complexity Results for Logic−Based Abduction
por: Eiter, T, et al.
Publicado: (1992)
A logical approach to multicut problems
por: Gottlob, G, et al.
Publicado: (2007)
Generalized Quantifiers in Logic Programs
por: Eiter, T, et al.
Publicado: (1997)
Visual Data Extraction Through Visual Logic Programming
por: Gottlob, G
Publicado: (2002)
Second Order Logic and the Weak Exponential Hierarchies
por: Gottlob, G, et al.
Publicado: (1995)
Modular Logic Programming and Generalized Quantifiers
por: Eiter, T, et al.
Publicado: (1997)
Anterior
Seguinte
Títulos similares
On the Complexity of Some Inductive Logic Programming Problems
por: Gottlob, G, et al.
Publicado: (1999)
Complexity Results for Abductive Logic Programming
por: Eiter, T, et al.
Publicado: (1995)
Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
por: Gottlob, G, et al.
Publicado: (2003)
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado: (2001)
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado: (2001)
