778 search results - page 124 / 156 » Expressiveness and complexity of graph logic |
123
Voted
CADE
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
80
Voted
ICFP
2005
ACM
16 years 11 days ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
123
click to vote
TABLEAUX
1998
Springer
15 years 4 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
180
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
138
click to vote
GPCE
2009
Springer
15 years 3 months ago
2009
Springer
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...