Sciweavers

2067 search results - page 100 / 414
» Logics of propositional control
Sort
View
AAAI
2010
15 years 3 months ago
Lifting Rationality Assumptions in Binary Aggregation
We consider problems where several individuals each need to make a yes/no choice regarding a number of issues and these choices then need to be aggregated into a collective choice...
Umberto Grandi, Ulle Endriss
DAGSTUHL
2007
15 years 3 months ago
Premise Independence in Judgment Aggregation
Judgment aggregation studies how agent opinions on logically interconnected propositions can be mapped into a collective judgment on the same propositions, and is plagued by impos...
Gabriella Pigozzi, Leendert van der Torre
125
Voted
IJCAI
2001
15 years 3 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
AAAI
2000
15 years 3 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
AAAI
1997
15 years 3 months ago
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
Rahul Roy-Chowdhury, Mukesh Dalal