725 search results - page 99 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
116
click to vote
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
136
Voted
ICFP
2003
ACM
16 years 2 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
205
Voted
SOFTWARE
2011
14 years 9 months ago
2011
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
157
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
114
Voted
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...