279 search results - page 14 / 56 » Determinacy Inference for Logic Programs |
SBIA
1998
Springer
14 years 20 days ago
1998
Springer
Abstract. The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing age...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
FLUX is a programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledge. The core of FLUX is...
INFORMS
1998
13 years 8 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...