Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems

Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems

Bibliographic Details
Main Authors:	Eiter, T, Gottlob, G, Gurevich, Y
Format:	Journal article
Published:	1996

Similar Items

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

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

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

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

Second−Order Logic over Finite Structures − Report on a Research Programme
by: Gottlob, G
Published: (2004)

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

NP Trees and Carnap's Modal Logic
by: Gottlob, G
Published: (1993)

NP Trees and Carnap's Modal Logic
by: Gottlob, G
Published: (1995)

Existential second−order logic over graphs: Charting the tractability frontier
by: Gottlob, G, et al.
Published: (2004)

Existential Second−Order Logic over Graphs: Charting the Tractability Frontier
by: Gottlob, G, et al.
Published: (2000)

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

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

Pure Second-Order Logic with Second-Order Identity.
by: Paseau, A
Published: (2010)

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

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

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
by: Eiter, T, et al.
Published: (1993)

The Complexity of Logic−Based Abduction
by: Eiter, T, et al.
Published: (1995)

The Complexity of Logic−Based Abduction
by: Eiter, T, et al.
Published: (1993)

Expressing Cardinality Quantifiers in Monadic Second−Order Logic over Trees
by: Barany, V, et al.
Published: (2010)

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

On Spatial Conjunction as Second-Order Logic
by: Kuncak, Viktor, et al.
Published: (2005)

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

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

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

Characterizing Second Order Logic with First Order Quantifiers
by: Harel, David
Published: (2023)

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

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

Generalized Quantifiers in Logic Programs
by: Eiter, T, et al.
Published: (1997)

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

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

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

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

Binding forms in first-order logic
by: Mogavero, F, et al.
Published: (2015)

Approximation algorithms for NP-hard problems /
by: Hochbaum, Dorit (Dorit S.)
Published: (1997)

On the Parameterised Intractability of Monadic Second−Order Logic
by: Kreutzer, S
Published: (2009)

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

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

Generalized hypertree decompositions: np−hardness and tractable variants
by: Gottlob, G, et al.
Published: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
by: Gottlob, G, et al.
Published: (2007)

On the decidability of monadic second-order logic with arithmetic predicates
by: Berthé, V, et al.
Published: (2024)