Sciweavers

227 search results - page 18 / 46
» A Model Theory for Paraconsistent Logic Programming
Sort
View
FOSSACS
2009
Springer
14 years 3 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...
CLIMA
2010
13 years 10 months ago
An Agent Language with Destructive Assignment and Model-Theoretic Semantics
In this paper we present an agent language that combines agent functionality with an action theory and model-theoretic semantics. The language is based on abductive logic programmi...
Robert A. Kowalski, Fariba Sadri
ATAL
2007
Springer
14 years 2 months ago
Modular interpreted systems
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
Wojciech Jamroga, Thomas Ågotnes
ENTCS
2007
105views more  ENTCS 2007»
13 years 8 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
POPL
2006
ACM
14 years 8 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao