352 search results - page 26 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
128
click to vote
FSTTCS
2000
Springer
15 years 6 months ago
2000
Springer
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, D...
140
click to vote
LISP
2007
15 years 2 months ago
2007
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
115
click to vote
AAAI
2008
15 years 5 months ago
2008
Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs....
139
click to vote
AISC
2008
Springer
15 years 5 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
159
click to vote
LANMR
2004
15 years 4 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...