Sciweavers

3566 search results - page 259 / 714
» Signed Logic Programs
Sort
View
ICPADS
1996
IEEE
15 years 7 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
AAAI
2000
15 years 4 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
POPL
2011
ACM
14 years 6 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
FOSSACS
2009
Springer
15 years 10 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
CIE
2007
Springer
15 years 9 months ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone