3566 search results - page 278 / 714 » Signed Logic Programs |
118
click to vote
ENTCS
2007
15 years 3 months ago
2007
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
147
click to vote
ENTCS
2002
15 years 3 months ago
2002
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
146
click to vote
DLOG
2009
15 years 1 months ago
2009
Abstract. The paper describes how interpretations of multimedia documents can be formally derived using abduction over domain knowledge represented in an ontology. The approach use...
220
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
101
click to vote
TPHOL
2007
IEEE
15 years 9 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...