540 search results - page 33 / 108 » A Computational Logic Approach to Syllogisms in Human Reason... |
158
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
143
click to vote
TIME
2003
IEEE
15 years 11 months ago
2003
IEEE
In bitemporal databases, current facts and transaction states are modelled using a special value to represent the current time (such as a minimum or maximum timestamp or NULL). Pr...
156
click to vote
TPHOL
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
161
click to vote
AAAI
2007
15 years 8 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
203
click to vote
PLPV
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...