Sciweavers

2203 search results - page 138 / 441
» Temporal Abstract Interpretation
Sort
View
140
Voted
LOPSTR
2004
Springer
15 years 9 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
123
Voted
AGP
1998
IEEE
15 years 7 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
131
Voted
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 9 months ago
A Probabilistic Relational Model for Characterizing Situations in Dynamic Multi-Agent Systems
Abstract. Artificial systems with a high degree of autonomy require reliable semantic information about the context they operate in. State interpretation, however, is a difficult ...
Daniel Meyer-Delius, Christian Plagemann, Georg vo...
118
Voted
ETFA
2006
IEEE
15 years 9 months ago
Synthesis of Distributed Controllers by Means of a Monolithic Approach
Abstract. In this paper, reverse partially-marked safe net condition/event systems (RsNCES) are introduced, rules of their functioning are defined and convenient interpretation met...
Dirk Missal, Hans-Michael Hanisch
139
Voted
ILP
2004
Springer
15 years 9 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi