Sciweavers

221 search results - page 27 / 45
» Representing Concurrent Actions in Extended Logic Programmin...
Sort
View
ICLP
2004
Springer
14 years 3 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 11 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
SIGADA
2005
Springer
14 years 7 days ago
AspectAda: aspect oriented programming for ada95
Concerns for concurrent systems are not always easy to modularize within single units using traditional programming languages. The concept of aspect orientation can be applied to ...
Knut H. Pedersen, Constantinos Constantinides
FOIKS
2008
Springer
13 years 8 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...
POPL
2009
ACM
14 years 1 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...