Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models

Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models

Show other versions (1)

Detalhes bibliográficos
Main Authors:	Gottlob, G, Pichler, R
Formato:	Journal article
Publicado em:	2001

Registos relacionados

Working with Arms: Complexity Results on Atomic Representations of Herbrand Models
Por: Gottlob, G, et al.
Publicado em: (1999)

Herbrand-Confluence
Por: Stefan Hetzl, et al.
Publicado em: (2013-12-01)

On the Herbrand content of LK
Por: Bahareh Afshari, et al.
Publicado em: (2016-06-01)

Inter-procedural Two-Variable Herbrand Equalities
Por: Stefan Schulze Frielinghaus, et al.
Publicado em: (2017-05-01)

Herbrand expansions of some formulas of modal logic S4
Por: Stanislovas Norgėla
Publicado em: (2003-12-01)

On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC
Por: Federico Aschieri
Publicado em: (2017-04-01)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
Por: Gottlob, G, et al.
Publicado em: (2006)

Bounded treewidth as a key to tractability of knowledge representation and reasoning
Por: Gottlob, G, et al.
Publicado em: (2010)

Complexity Results for Nonmonotonic Logics
Por: Gottlob, G
Publicado em: (1992)

The complexity of XPath query evaluation
Por: Gottlob, G, et al.
Publicado em: (2003)

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
Por: Baumgartner, R, et al.
Publicado em: (1999)

Complexity Results for Logic−Based Abduction
Por: Eiter, T, et al.
Publicado em: (1992)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
Por: Gottlob, G, et al.
Publicado em: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
Por: Gottlob, G, et al.
Publicado em: (2004)

The complexity of XPath query evaluation and XML typing
Por: Gottlob, G, et al.
Publicado em: (2005)

Complexity analysis of generalized and fractional hypertree decompositions
Por: Gottlob, G, et al.
Publicado em: (2021)

Complexity Results for Abductive Logic Programming
Por: Eiter, T, et al.
Publicado em: (1995)

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

Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract)
Por: Gottlob, G
Publicado em: (1993)

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

Completeness of atomic structure representations
Por: Jigyasa Nigam, et al.
Publicado em: (2024-03-01)

Propositional default logics made easier: computational complexity of model checking
Por: Baumgartner, R, et al.
Publicado em: (2002)

General and fractional hypertree decompositions: hard and easy cases
Por: Fischl, W, et al.
Publicado em: (2018)

Normalization and optimization of schema mappings.
Por: Gottlob, G, et al.
Publicado em: (2011)

Tractable database design through bounded treewidth
Por: Gottlob, G, et al.
Publicado em: (2006)

Efficient Algorithms for Processing XPath Queries
Por: Gottlob, G, et al.
Publicado em: (2002)

Efficient algorithms for processing XPath queries
Por: Gottlob, G, et al.
Publicado em: (2005)

XPath Processing in a Nutshell
Por: Gottlob, G, et al.
Publicado em: (2003)

Fast and parallel decomposition of constraint satisfaction problems
Por: Gottlob, G, et al.
Publicado em: (2020)

Efficient Datalog Abduction through Bounded Treewidth
Por: Gottlob, G, et al.
Publicado em: (2007)

XPath processing in a nutshell
Por: Gottlob, G, et al.
Publicado em: (2003)

Monadic datalog over finite structures with bounded treewidth
Por: Gottlob, G, et al.
Publicado em: (2007)

XPath Query Evaluation: Improving Time and Space Efficiency
Por: Gottlob, G, et al.
Publicado em: (2003)

Fast and parallel decomposition of constraint satisfaction problems
Por: Gottlob, G, et al.
Publicado em: (2022)

General and fractional hypertree decompositions: hard and easy cases
Por: Fischl, W, et al.
Publicado em: (2018)

Monadic datalog over finite structures of bounded treewidth.
Por: Gottlob, G, et al.
Publicado em: (2010)

On the Complexity of Clause Condensing
Por: Gottlob, G
Publicado em: (1991)

Manufacturing “Arms” or Legs: An Analysis of the Representation of Soldiers’ Mutilated Bodies in the Colombian Armed Conflict
Por: Chloe Rutter-Jensen
Publicado em: (2018-03-01)

On the Complexity of Theory Curbing
Por: Eiter, T, et al.
Publicado em: (2000)

Distributed representations of atoms and materials for machine learning
Por: Luis M. Antunes, et al.
Publicado em: (2022-03-01)