Computing LOGCFL Certificates

Computing LOGCFL Certificates

Show other versions (1)

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

Podobne knjige/članki

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

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

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

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)

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

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

On the Complexity of Some Inductive Logic Programming Problems
od: Gottlob, G, 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)

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

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

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

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

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

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

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

The DLV System for Knowledge Representation and Reasoning
od: Leone, N, et al.
Izdano: (2002)

The DLV system for knowledge representation and reasoning
od: Leone, N, et al.
Izdano: (2006)

Pure Nash Equilibria: Hard and Easy Games
od: Gottlob, G, et al.
Izdano: (2005)

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

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

Pure Nash equilibria: hard and easy games
od: Gottlob, G, et al.
Izdano: (2003)

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)

The dlv System: Model Generator and Advanced Frontends (system description)
od: Citrigno, S, et al.
Izdano: (1997)

Panel on “Past and future of computer science theory”
od: Fagin, R, et al.
Izdano: (2021)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
od: Gottlob, G, et al.
Izdano: (2005)

Cloud computing specialist certification programs
od: S. N. Seitvelieva, et al.
Izdano: (2013-03-01)

Engineering computer software : verification, qualification, certification /
od: National Congress on Pressure Vessels and Piping, San Francisco, May 11.1971, et al.
Izdano: (1971)

Computing Covers for Embedded Functional Dependencies
od: Gottlob, G
Izdano: (1987)

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

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

Semantics and Complexity of Abduction from Default Theories
od: Eiter, T, et al.
Izdano: (1997)

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

Semantics and Complexity of Abduction from Default Theories
od: Eiter, T, et al.
Izdano: (1995)

Enhancing Model Checking in Verification by AI Techniques
od: Buccafurri, F, et al.
Izdano: (1999)

On ACTL Formulas Having Linear Counterexamples
od: Buccafurri, F, et al.
Izdano: (2001)

Edge Computing Parallel Approach for Efficient Energy Sharing in a Prosumer Community
od: Luigi Scarcello, et al.
Izdano: (2022-06-01)

Certification
od: Melodye Lehnerer
Izdano: (2023-06-01)