Reinhard Pichler  Home/Search
Context
Related
| logic.at/pub/ftp98/pichlera.ps.gz logic.at/ftp98/papers/pichlera.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: logic.at/ftp98/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: There are several well known possibilities which constrained clauses (= c-clauses, for short) provide in addition to standard clauses. In particular, many (even infinitely many) standard clauses can be represented by a single c-clause. Hence, many parallel inference steps on standard clauses can be encoded in a single inference step on cclauses. The aim of this work is to investigate another possibility offered by constrained clauses: We shall try to combine resolution based decision... (Update)
Active bibliography (related documents): More All
1.8: Completeness and Redundancy in Constrained Clause Logic - Pichler (2000) (Correct)
0.2: .6 Subsumption and Tautology Elimination - In Section We (Correct)
0.2: Notre Dame Journal of Formal Logic - More Fragments Of (Correct)
Similar documents based on text: More All
0.8: On the Complexity of Equational Problems in CNF over a Finite.. - Pichler (2000) (Correct)
0.2: On Deciding Subsumption Problems (Extended Abstract) - Egly, Pichler, Woltran (2002) (Correct)
0.1: Decision Procedures and Model - Building In Equational (Correct)
BibTeX entry: (Update)
@inproceedings{ pichler98extending,
author = "Reinhard Pichler",
title = "Extending Decidable Clause Classes via Constraints",
booktitle = "{FTP} ({LNCS} Selection)",
pages = "206-220",
year = "1998",
url = "citeseer.ist.psu.edu/99857.html" }
Citations (may not include all citations):9 Journal of the ACM (context) - Robinson, oriented et al. - 1965
7 Lescanne: Equational Problems and Disunification (context) - Comon - 1989
4 Texts in Theoretical Computer Science (context) - Leitsch, Calculus - 1997
2 Zabel: Extending Resolution for Model Construction (context) - Caferra - 1991
2 Hayes: Semantic Trees in Automated Theorem Proving (context) - Kowalski - 1969
2 Peltier: Decision Procedures using Model Building Techniques (context) - Caferra - 1996
1 Zamov: Resolution Methods for the Decision Problem (context) - Fermuller, Leitsch et al. - 1993
1 Marriott: Explicit Representation of Terms defined by Counte.. (context) - Lassez - 1987
1 Foundations of Logic and Functional Programming (context) - Lassez, Maher et al. - 1986
Documents on the same site (http://www.logic.at/ftp98/): More
Completeness and Redundancy in Constrained Clause Logic - Pichler (2000) (Correct)
Full First-Order Sequent and Tableau Calculi With Preservation of.. - Wirth (Correct)
Computational Representations of Models of First-Order Formulas - Matzinger (2000) (Correct)
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