1117 search results - page 31 / 224 » Partial Models of Extended Generalized Logic Programs |
RULEML
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
DALT
2004
Springer
14 years 2 months ago
2004
Springer
This article investigates the intensional programming paradigm for agent communication by introducing context as a first class object in the intensional programming language Lucid...
RR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. WSML presents a framework encompassing different language variants, rooted in Description Logics and (F-)Logic Programming. So far, the precise relationships between thes...
LPNMR
2004
Springer
14 years 2 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
BSL
1999
13 years 8 months ago
1999
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...