Sciweavers

267 search results - page 30 / 54
» Well Founded Semantics for Logic Program Updates
Sort
View
APPINF
2003
13 years 10 months ago
Towards Modelling an Intelligent Calendar Agent with LUPS
We present an application prototype of dynamic knowledge representation programmed in LUPS (a language for updating logic programs). This is a case study to model intelligent agen...
Juan Carlos Acosta Guadarrama, Mauricio Javier Oso...
POPL
2010
ACM
14 years 6 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
ENTCS
2006
146views more  ENTCS 2006»
13 years 8 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
ICML
2004
IEEE
14 years 9 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
TPHOL
2009
IEEE
14 years 3 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk