Sciweavers

351 search results - page 30 / 71
» Logic Programs with Compiled Preferences
Sort
View
ENC
2006
IEEE
14 years 10 days ago
Defining new argumentation-based semantics by minimal models
Dung's argumentation approach is a unifying approach which has played an influential role on argumentation research and Artificial Intelligence (AI). Based on a proper repres...
Juan Carlos Nieves, Ulises Cortés, Mauricio...
LICS
1994
IEEE
14 years 23 days ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 1 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
DATE
2008
IEEE
157views Hardware» more  DATE 2008»
14 years 3 months ago
Logical Reliability of Interacting Real-Time Tasks
We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that chec...
Krishnendu Chatterjee, Arkadeb Ghosal, Thomas A. H...
VL
1996
IEEE
14 years 24 days ago
Steering programs via time travel
Despite years of research into human computer interaction (HCI), the environments programmers must use for problem-solving today--with separate modes and tools for writing, compil...
John W. Atwood Jr., Margaret M. Burnett, Rebecca A...