4513 search results - page 612 / 903 » Logic programming with satisfiability |
124
click to vote
ESOP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
110
click to vote
ACSAC
1999
IEEE
15 years 8 months ago
1999
IEEE
Secure enterprise programming is a difficult and tedious task. Programmers need tools that support t levels of abstraction and that track all the components that participate in di...
135
click to vote
CAEPIA
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...
150
Voted
FOIKS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
144
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...