Sciweavers

584 search results - page 58 / 117
» Logic Programs as term Rewriting Systems
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
ATAL
2008
Springer
14 years 11 months ago
Goals in agent systems: a unifying framework
In the literature on agent systems, the proactive behavior of agents is often modeled in terms of goals that the agents pursue. We review a number of commonly-used existing goal t...
M. Birna van Riemsdijk, Mehdi Dastani, Michael Win...
PLDI
2003
ACM
15 years 3 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
ATAL
2003
Springer
15 years 3 months ago
Model checking agentspeak
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...
Rafael H. Bordini, Michael Fisher, Carmen Pardavil...
LCTRTS
2005
Springer
15 years 3 months ago
System-wide compaction and specialization of the linux kernel
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
Dominique Chanet, Bjorn De Sutter, Bruno De Bus, L...