584 search results - page 36 / 117 » Logic Programs as term Rewriting Systems |
LOPSTR
2004
Springer
15 years 3 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
120
click to vote
CL
2012
Springer
13 years 4 days ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
87
Voted
AI
2004
Springer
14 years 9 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
104
Voted
ICFP
2012
ACM
13 years 2 days ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...