Sciweavers

746 search results - page 87 / 150
» Connectionist Propositional Logic
Sort
View
77
Voted
AML
2006
87views more  AML 2006»
14 years 10 months ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer
77
Voted
JAIR
2008
145views more  JAIR 2008»
14 years 10 months ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
80
Voted
IS
2006
14 years 10 months ago
Negations and document length in logical retrieval
Abstract. Terms which are not explicitly mentioned in the text of a document receive often a minor role in current retrieval systems. In this work we connect the management of such...
David E. Losada, Alvaro Barreiro
81
Voted
BSL
1999
103views more  BSL 1999»
14 years 10 months ago
The logic of bunched implications
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
Peter W. O'Hearn, David J. Pym
LPNMR
2004
Springer
15 years 3 months ago
Set Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
V. Wiktor Marek, Jeffrey B. Remmel