Sciweavers

1059 search results - page 50 / 212
» Standard Logics Are Valuation-Nonmonotonic
Sort
View
CONCUR
2009
Springer
15 years 10 months ago
Algebra for Infinite Forests with an Application to the Temporal Logic EF
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
Mikolaj Bojanczyk, Tomasz Idziaszek
CADE
2006
Springer
16 years 6 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
CADE
2003
Springer
16 years 6 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
ILP
2004
Springer
15 years 11 months ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 11 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi