Sciweavers

89 search results - page 12 / 18
» Weak Conditional Logics of Normality
Sort
View
ECCV
2010
Springer
15 years 8 months ago
Localizing Objects while Learning Their Appearance
Learning a new object class from cluttered training images is very challenging when the location of object instances is unknown. Previous works generally require objects covering a...
164
Voted
MCMASTER
1993
15 years 7 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
135
Voted
CADE
2006
Springer
16 years 3 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
141
Voted
ICFP
2010
ACM
15 years 3 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
136
Voted
KR
2004
Springer
15 years 8 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...