Sciweavers

850 search results - page 132 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
PASTE
2004
ACM
15 years 6 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas
DAGSTUHL
2006
15 years 2 months ago
Face-off: AOP+LMP vs. legacy software
This paper applies a mix of aspect-oriented programming (AOP) and logic meta-programming (LMP) to tackle some concerns of/in legacy environments. We present four different problem...
Kris De Schutter, Bram Adams
PADL
2001
Springer
15 years 5 months ago
A Novel Implementation of the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...
PADL
1999
Springer
15 years 5 months ago
Or-Parallelism within Tabling
Abstract. One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficien...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
AAAI
2004
15 years 2 months ago
Adding Time and Intervals to Procedural and Hierarchical Control Specifications
In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...
Tran Cao Son, Chitta Baral, Le-Chi Tuan