1226 search results - page 99 / 246 » Proofs, Programs and Abstract Complexity |
135
click to vote
ENTCS
2002
15 years 3 months ago
2002
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
136
click to vote
ICLP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
134
click to vote
COMSWARE
2006
IEEE
15 years 9 months ago
2006
IEEE
ing a middleware abstraction layer into wireless sensor networks is a widely accepted solution to facilitate application programming and allow network organization. In this paper,...
124
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
132
Voted
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...