641 search results - page 7 / 129 » Embedding Finite Sets in a Logic Programming Language |
DEXAW
2003
IEEE
14 years 1 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
AMAI
2008
Springer
13 years 8 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
IJCAI
1993
13 years 9 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...