Sciweavers

584 search results - page 44 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ENTCS
2007
108views more  ENTCS 2007»
14 years 9 months ago
Generating Java Compiler Optimizers Using Bidirectional CTL
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
Ling Fang, Masataka Sassa
ATAL
2010
Springer
14 years 10 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga
ENTCS
2002
129views more  ENTCS 2002»
14 years 9 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
PPDP
2004
Springer
15 years 3 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
OOPSLA
2010
Springer
14 years 8 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...