3773 search results - page 560 / 755 » Logical Reasoning |
151
click to vote
TPHOL
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
164
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
141
Voted
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
160
Voted
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
165
click to vote
DALT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted t...