On deciding subsumption problems
From MaRDI portal
Publication:1777407
DOI10.1007/s10472-005-0434-4zbMath1099.68095OpenAlexW4238556942MaRDI QIDQ1777407
Stefan Woltran, Uwe Egly, Reinhard Pichler
Publication date: 13 May 2005
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-0434-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- A non-ground realization of the stable and well-founded semantics
- A structure-preserving clause form translation
- Explicit representation of terms defined by counter examples
- Equational problems and disunification
- The polynomial-time hierarchy
- Equational formulae with membership constraints
- Working with ARMs: Complexity results on atomic representations of Herbrand models
- Resolution for quantified Boolean formulas
- Sufficient-completeness, ground-reducibility and their complexity
- BerkMin: A fast and robust SAT-solver
- An Efficient Unification Algorithm
- Hyperresolution and automated model building
- SATO: An efficient propositional prover
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On deciding subsumption problems
