Sciweavers

2084 search results - page 180 / 417
» Set Constraints in Logic Programming
Sort
View
APLAS
2011
ACM
12 years 8 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
AUSAI
2005
Springer
14 years 1 months ago
Preferences of Agents in Defeasible Logic
We are interested in programming languages for cognitive agents with preferences. We define rule-based agent theories and inference procedures in defeasible logic, and in this set...
Mehdi Dastani, Guido Governatori, Antonino Rotolo,...
POPL
2007
ACM
14 years 8 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
ATAL
2009
Springer
14 years 2 months ago
Agent programming with temporally extended goals
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of state...
Koen V. Hindriks, Wiebe van der Hoek, M. Birna van...
KBSE
2003
IEEE
14 years 1 months ago
On the automatic evolution of an OS kernel using temporal logic and AOP
Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...
Rickard A. Åberg, Julia L. Lawall, Mario S&u...