Generalized Quantifiers in Logic Programs

Generalized Quantifiers in Logic Programs

Bibliografske podrobnosti
Main Authors:	Eiter, T, Gottlob, G, Veith, H
Format:	Conference item
Izdano:	Springer 1997

Podobne knjige/članki

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

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

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
od: Eiter, T, et al.
Izdano: (1995)

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

Disjunctive Logic Programming over Finite Structures
od: Eiter, T, et al.
Izdano: (1994)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
od: Eiter, T, et al.
Izdano: (1997)

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

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

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)

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)

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

Reasoning under minimal upper bounds in propositional logic
od: Eiter, T, et al.
Izdano: (2006)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
od: Eiter, T, et al.
Izdano: (1998)

Hypergraph Transversal Computation and Related Problems in Logic and AI
od: Eiter, T, et al.
Izdano: (2002)

Reasoning under minimal upper bounds in propositional logic
od: Eiter, T, et al.
Izdano: (2006)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
od: Eiter, T, et al.
Izdano: (1997)

Default Logic as a Query Language
od: Cadoli, M, et al.
Izdano: (1997)

Default Logic as a Query Language
od: Cadoli, M, et al.
Izdano: (1994)

Existential second−order logic over strings
od: Eiter, T, et al.
Izdano: (2000)

Existential Second−Order Logic over Strings
od: Eiter, T, et al.
Izdano: (1998)

Second−Order Logic over Strings: Regular and Non−regular Fragments
od: Eiter, T, et al.
Izdano: (2001)

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

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

Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems
od: Eiter, T, et al.
Izdano: (1996)

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

Relativized Logspace and Generalized Quantifiers over Finite Structures
od: Gottlob, G
Izdano: (1995)

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

Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures
od: Gottlob, G
Izdano: (1997)

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

Well−Founded Semantics for Description Logic Programs in the Semantic Web
od: Eiter, T, et al.
Izdano: (2004)

Combining Answer Set Programming with Description Logics for the Semantic Web
od: Eiter, T, et al.
Izdano: (2004)

Combining answer set programming with description logics for the semantic Web
od: Eiter, T, et al.
Izdano: (2008)

Combining Answer Set Programming with Description Logics for the Semantic Web
od: Eiter, T, et al.
Izdano: (2008)

Well-Founded Semantics for Description Logic Programs in the Semantic Web
od: Eiter, T, et al.
Izdano: (2011)

Well−founded Semantics for Description Logic Programs in the Semantic Web
od: Eiter, T, et al.
Izdano: (2011)

Causal Models of Disjunctive Logic Programs
od: Dix, J, et al.
Izdano: (1994)

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

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