352 search results - page 27 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
156
click to vote
JAPLL
2007
15 years 2 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
135
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
112
click to vote
RR
2009
Springer
15 years 9 months ago
2009
Springer
Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches ...
132
click to vote
NMR
2004
Springer
15 years 8 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
150
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...