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

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Eiter, T, Gottlob, G, Gurevich, Y
Formáid:	Journal article
Foilsithe / Cruthaithe:	1996

Míreanna comhchosúla

Existential second−order logic over strings
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2000)

Existential Second−Order Logic over Strings
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1998)

Second−Order Logic over Strings: Regular and Non−regular Fragments
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2001)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1998)

Disjunctive Logic Programming over Finite Structures
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1994)

Second−Order Logic over Finite Structures − Report on a Research Programme
de réir: Gottlob, G
Foilsithe / Cruthaithe: (2004)

NP Trees and Carnap's Modal Logic
de réir: Gottlob, G
Foilsithe / Cruthaithe: (1993)

NP Trees and Carnap's Modal Logic
de réir: Gottlob, G
Foilsithe / Cruthaithe: (1995)

Hypergraph Transversal Computation and Related Problems in Logic and AI
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

Existential second−order logic over graphs: Charting the tractability frontier
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2004)

Existential Second−Order Logic over Graphs: Charting the Tractability Frontier
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2000)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

Universal First-Order Logic is Superfluous for NL, P, NP and coNP
de réir: Nerio Borges, et al.
Foilsithe / Cruthaithe: (2014-03-01)

The Complexity of Logic−Based Abduction
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

The Complexity of Logic−Based Abduction
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

Second Order Logic and the Weak Exponential Hierarchies
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1995)

Complexity Results for Logic−Based Abduction
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1992)

Reasoning under minimal upper bounds in propositional logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2006)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

Reasoning under minimal upper bounds in propositional logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2006)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

On the Indiscernibility of Individuals in Logic Programming
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Generalized Quantifiers in Logic Programs
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Default Logic as a Query Language
de réir: Cadoli, M, et al.
Foilsithe / Cruthaithe: (1997)

Complexity Results for Abductive Logic Programming
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

Default Logic as a Query Language
de réir: Cadoli, M, et al.
Foilsithe / Cruthaithe: (1994)

Modular Logic Programming and Generalized Quantifiers
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures
de réir: Gottlob, G
Foilsithe / Cruthaithe: (1997)

Abduction from Logic Programs: Semantics and Complexity
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
de réir: Amélie Gheerbrant, et al.
Foilsithe / Cruthaithe: (2012-10-01)

Complexity and expressive power of logic programming
de réir: Dantsin, E, et al.
Foilsithe / Cruthaithe: (2001)

Complexity and Expressive Power of Logic Programming
de réir: Dantsin, E, et al.
Foilsithe / Cruthaithe: (1997)

Identifying the Minimal Transversals of a Hypergraph and Related Problems
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

Pure Second-Order Logic with Second-Order Identity.
de réir: Paseau, A
Foilsithe / Cruthaithe: (2010)

Local Normal Forms for First-Order Logic with Applications to Games and Automata
de réir: Thomas Schwentick, et al.
Foilsithe / Cruthaithe: (1999-01-01)

Local Normal Forms for First-Order Logic with Applications to Games and Automata
de réir: Thomas Schwentick, et al.
Foilsithe / Cruthaithe: (1999-12-01)

Expressing Cardinality Quantifiers in Monadic Second−Order Logic over Trees
de réir: Barany, V, et al.
Foilsithe / Cruthaithe: (2010)

Cumulative Default Logic: Finite Characterization‚ Algorithms‚ and Complexity
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1994)