Sciweavers

265 search results - page 23 / 53
» Weakly Algebraizable Logics
Sort
View
SLOGICA
2008
116views more  SLOGICA 2008»
13 years 8 months ago
Rough Sets and 3-Valued Logics
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Arnon Avron, Beata Konikowska
TPLP
2002
90views more  TPLP 2002»
13 years 8 months ago
Properties of input-consuming derivations
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
CADE
2006
Springer
14 years 9 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
IANDC
2010
95views more  IANDC 2010»
13 years 6 months ago
Structured anaphora to quantifier domains
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
Adrian Brasoveanu
ICML
2009
IEEE
14 years 9 months ago
Compositional noisy-logical learning
We describe a new method for learning the conditional probability distribution of a binary-valued variable from labelled training examples. Our proposed Compositional Noisy-Logica...
Alan L. Yuille, Songfeng Zheng