Sciweavers

2299 search results - page 115 / 460
» Logical Data Expiration
Sort
View
153
Voted
LPKR
1997
Springer
15 years 7 months ago
A System for Abductive Learning of Logic Programs
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
124
Voted
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 7 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
116
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 3 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
143
Voted
SCP
2010
172views more  SCP 2010»
15 years 2 months ago
Alternating-time stream logic for multi-agent systems
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
Sascha Klüppelholz, Christel Baier
129
Voted
WWW
2009
ACM
15 years 10 months ago
Instance-based probabilistic reasoning in the semantic web
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
Pedro Oliveira, Paulo Gomes