1083 search results - page 115 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
122
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
118
Voted
AAAI
2008
15 years 5 months ago
2008
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
132
click to vote
ACL2
2006
ACM
15 years 8 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
124
Voted
CADE
2009
Springer
16 years 3 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 ...
123
Voted
AAAI
2000
15 years 4 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...