Sciweavers

1546 search results - page 208 / 310
» Context-Aware Computing with Sound
Sort
View
156
Voted
JLP
2000
140views more  JLP 2000»
15 years 5 months ago
An abductive event calculus planner
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
JLP
2000
134views more  JLP 2000»
15 years 5 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
ICLP
2010
Springer
15 years 4 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
LATINCRYPT
2010
15 years 4 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
15 years 3 months ago
Automatic verification of database-driven systems: a new frontier
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
Victor Vianu