Hypergraph Transversal Computation and Related Problems in Logic and AI

Hypergraph Transversal Computation and Related Problems in Logic and AI

Bibliografski detalji
Glavni autori:	Eiter, T, Gottlob, G
Format:	Conference item
Izdano:	Springer 2002

Slični predmeti

Identifying the Minimal Transversals of a Hypergraph and Related Problems
od: Eiter, T, i dr.
Izdano: (1995)

New Results on Monotone Dualization and Generating Hypergraph Transversals
od: Eiter, T, i dr.
Izdano: (2002)

New results on monotone dualization and generating hypergraph transversals
od: Eiter, T, i dr.
Izdano: (2002)

New Results on Monotone Dualization and Generating Hypergraph Transversals
od: Eiter, T, i dr.
Izdano: (2003)

Hypergraph Transversals
od: Gottlob, G
Izdano: (2004)

Achieving new upper bounds for the hypergraph duality problem through logic
od: Gottlob, G, i dr.
Izdano: (2014)

Achieving new upper bounds for the hypergraph duality problem through logic
od: Gottlob, G, i dr.
Izdano: (2018)

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

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

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

The Complexity of Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1995)

The Complexity of Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1993)

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

Hypertree width and related hypergraph invariants
od: Adler, I, i dr.
Izdano: (2007)

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

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

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

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

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

Hypertree-Width and Related Hypergraph Invariants
od: Isolde Adler, i dr.
Izdano: (2005-01-01)

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

Generalized Quantifiers in Logic Programs
od: Eiter, T, i dr.
Izdano: (1997)

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

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

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

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

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

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

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

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

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

Complexity and expressive power of logic programming
od: Dantsin, E, i dr.
Izdano: (2001)

Complexity and Expressive Power of Logic Programming
od: Dantsin, E, i dr.
Izdano: (1997)

Hypergraph Computation
od: Yue Gao, i dr.
Izdano: (2024-09-01)

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

Transversal Core of Intuitionistic Fuzzy k-Partite Hypergraphs
od: K.K Myithili, i dr.
Izdano: (2023-03-01)

Fractional covers of hypergraphs with bounded multi-intersection
od: Gottlob, G, i dr.
Izdano: (2023)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
od: Alexandre Bazin, i dr.
Izdano: (2023-04-01)

Hypergraphs with large transversal number and with edge sizes at least four
od: Henning Michael, i dr.
Izdano: (2012-06-01)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
od: Gottlob, G, i dr.
Izdano: (2001)