Gottlob, G. and R. Pichler: 2001, `Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models'. Information and Computation 165, 183--207. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Deciding Subsumption Problems (Extended Abstract) - Egly, Pichler, Woltran (2002) (Correct)
....ss D. Consider the H ground substitution # = fx c; y cg. Then the H ground instance D# of D is not subsumed by C. Finally, let us consider the computational complexity results for the H subsumption problems. Clausal H subsumption is 2 complete (cf. 18] for the 2 hardness proof and [11] for the 2 membership proof) The coNP completeness of ATOM HSUB has been shown independently by several authors (cf. 14] 12] 13] For all of the three decision problems mentioned above, ecient algorithms are an important issue. In this paper, we focus on H subsumption and contribute ....
G. Gottlob and R. Pichler. Working with ARMs: Complexity results on atomic representations of Herbrand models. Information and Computation, 165:183-207, 2001.
Patterns in Words Versus Patterns in Trees: A Brief Survey .. - Kucherov, Rusinowitch (Correct)
....be replaced by terms without changing the set of instances. The decidability of this property, stated in Theorem 1, means that a bound on the size of terms replacing non linear variables can be e ectively computed. Recently, the study of nite complement representations has received a new impulse [GP99,Pic99], motivated by its applications in di erent areas, and in particular in logic programming. In [Pic99] it has been proved that testing if a given set has a nite complement representation (see Theorem 1) is co NPcomplete. Coming back to problem P2.1, to check if Inst(S) is nite, we rst check, ....
G. Gottlob and R. Pichler. Working with ARMs: Complexity results on atomic representations of Herbrand models. In Proceedings of LICS'99, 1999. to appear, available from http://www.dbai.tuwien.ac.at/staff/gottlob/arms.ps.
FDPLL - A First-Order Davis-Putnam-Logeman-Loveland Procedure - Baumgartner (2000) (8 citations) (Correct)
....for future work are combinations of the techniques described here with hyper linking calculi, equality treatment and improved termination behavior to name a few. On the theoretical level, the relationship between the model representation capabilities in FDPLL and the atomic model representations [GP98] used in the resolution and tableau world should be clari ed. Acknowledgments. I am grateful to the members of our group for discussions about FDPLL. David Plaisted, Mark Stickel and Ryuzo Hasegawa read the paper in depth and helped to clarify concepts. Three referees gave valuable comments and ....
Georg Gottlob and Reinhard Pichler. Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. In Proceedings of the 14th Symposium on Logic in Computer Science, IEEE, 1998.
On Deciding Subsumption Problems - Egly, Pichler, Woltran (2003) (1 citation) Self-citation (Pichler) (Correct)
....let us recall the computational complexity results for the Hsubsumption problems because they give some insights to which classes of quantified Boolean formulas (QBFs) the different problems should be translated. Clausal H subsumption is complete (cf. 31] for the 2 hardness proof and [17] for the 2 membership proof) The co NP completeness of ATOM HSUB was shown independently by several authors (cf. 21] 22] 18] We shall thus reduce the complementary problems co ATOM HSUB to SAT and co CLAUSE HSUB to QSAT 2 . From a theoretical point of view, these polynomial ....
Gottlob, G. and R. Pichler: 2001, `Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models'. Information and Computation 165, 183--207.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC