Sciweavers

608 search results - page 52 / 122
» Interactive Oracle Proofs
Sort
View
FROCOS
2009
Springer
15 years 4 months ago
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
Stéphane Lescuyer, Sylvain Conchon
SWAP
2008
14 years 11 months ago
Exploiting Semantic Technology in Computational Logic-based Service Contracting
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
Marco Alberti, Massimiliano Cattafi, Marco Gavanel...
JUCS
2008
182views more  JUCS 2008»
14 years 9 months ago
Modularizing Theorems for Software Product Lines: The Jbook Case Study
: A goal of software product lines is the economical assembly of programs in a family of programs. In this paper, we explore how theorems about program properties may be integrated...
Don S. Batory, Egon Börger
SEMWEB
2009
Springer
15 years 4 months ago
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
An important issue for the Semantic Web is how to combine open-world ontology languages with closed-world (non-monotonic) rule paradigms. Several proposals for hybrid languages all...
José Júlio Alferes, Matthias Knorr, ...
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
14 years 1 months ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...