4573 search results - page 226 / 915 » Automated Reasoning |
213
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out i...
163
click to vote
LPNMR
1999
Springer
15 years 11 months ago
1999
Springer
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, defau...
163
click to vote
ICLP
1999
Springer
15 years 11 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
144
click to vote
TIME
1998
IEEE
15 years 10 months ago
1998
IEEE
Kowalski and Sergot's Event Calculus (EC) is a simAppeared in the Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning -- TIME'98 (R....
157
click to vote
ALP
1994
Springer
15 years 10 months ago
1994
Springer
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...