725 search results - page 75 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
130
click to vote
TCS
2002
15 years 5 months ago
2002
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
153
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...
137
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
180
click to vote
AAAI
2006
15 years 7 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
147
click to vote
FUIN
2010
15 years 4 months ago
2010
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...