Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

SOFSEM
2007
Springer

favoriteEmaildiscussreport

118views Theoretical Computer Science» more SOFSEM 2007»

Constraints for Argument Filterings

13 years 10 months ago

Constraints for Argument Filterings

Download cl-informatik.uibk.ac.at

Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simpliﬁcation orders like LPO and KBO, argument ﬁlterings play a key role. In this paper we propose an encoding of argument ﬁlterings in propositional logic. By incorporating propositional encodings of simpliﬁcation orders, the search for suitable argument ﬁlterings is turned into a satisﬁability problem. Preliminary experimental results show that our logic-based approach is signiﬁcantly faster than existing implementations.

Harald Zankl, Nao Hirokawa, Aart Middeldorp

Real-time Traffic

Argument ﬁlterings | Dependency Pair Method | Simpliﬁcation Orders | SOFSEM 2007 | Theoretical Computer Science |

claim paper

Related Content

» A Probabilistic Framework for Correspondence and Egomotion

» Computational properties of argument systems satisfying graphtheoretic constraints

» Argumentation as distributed constraint satisfaction applications and results

» Elimination Transformations for AssociativeCommutative Rewriting Systems

» Predictive Labeling with Dependency Pairs Using SAT

» Dialectical Proofs for Constrained Argumentation

» SAT Solving for Argument Filterings

» Forward Slicing by Conjunctive Partial Deduction and Argument Filtering

» Argument Filterings and Usable Rules for Simply Typed Dependency Pairs

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SOFSEM
Authors	Harald Zankl, Nao Hirokawa, Aart Middeldorp

Comments (0)