756 search results - page 18 / 152 » Using Logic Programs to Reason about Infinite Sets |
CADE
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
IJCAI
1997
13 years 9 months ago
1997
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
AAAI
2007
13 years 10 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...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
EUROCAST
2007
Springer
14 years 9 days ago
2007
Springer
In this paper we introduce an extension of Equilibrium Logic (a logical characterisation of the Answer Set Semantics for logic programs) consisting in the inclusion of modal tempor...