Sciweavers

461 search results - page 1 / 93
» Component-Based Answer Set Programming
Sort
View
LANMR
2004
13 years 5 months ago
Component-Based Answer Set Programming
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
Stefania Costantini
AAAI
2012
11 years 6 months ago
Reformulating Temporal Action Logics in Answer Set Programming
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
Joohyung Lee, Ravi Palla
JAIR
2012
211views Hardware» more  JAIR 2012»
11 years 6 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla
KR
2010
Springer
13 years 1 months ago
On the Progression Semantics and Boundedness of Answer Set Programs
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set p...
Yan Zhang, Yi Zhou
MICRO
2006
IEEE
191views Hardware» more  MICRO 2006»
13 years 3 months ago
CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs
Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, inc...
Pierre Palatin, Yves Lhuillier, Olivier Temam