Solving Partial Order Constraints for LPO Termination-Reference-Cited by-同舟云学术

Solving Partial Order Constraints for LPO Termination

Published:2006 Issue: Volume: Page:4-18
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Codish Michael,Lagoon Vitaly,Stuckey Peter J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11805618_2.pdf

Reference21 articles.

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1–2), 133–178 (2000)

2. Automated program verification environment (AProVe) (viewed December 2005), http://www-i2.informatik.rwth-aachen.de/AProVE

3. Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability (submitted), http://www.cs.bgu.ac.il/~mcodish/Papers/Sources/lpsat.pdf

4. Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: SAT solving for argument filterings, available from: http://arxiv.org/abs/cs.OH/0605074

5. Dershowitz, N.: Termination of rewriting. J. Symb. Comput. 3(1/2), 69–116 (1987)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Representing a reference foundational ontology of events in SROIQ;Applied Ontology;2019-08-19

2. Decreasing Diagrams and Relative Termination;Journal of Automated Reasoning;2011-09-13

3. Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing;Logic-Based Program Synthesis and Transformation;2010

4. Decreasing Diagrams and Relative Termination;Automated Reasoning;2010

5. KBO Orientability;Journal of Automated Reasoning;2009-04-23