3323 search results - page 79 / 665 » Computational Semantics with Functional Programming |
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
ASP
2001
Springer
15 years 2 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
83
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...