Sciweavers

30 search results - page 5 / 6
» First-Order Conditional Logic Revisited
Sort
View
SYNTHESE
2010
95views more  SYNTHESE 2010»
13 years 9 months ago
Ranking judgments in Arrow's setting
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
Daniele Porello
JELIA
2010
Springer
13 years 9 months ago
Stable Belief Sets Revisited
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
Costas D. Koutras, Yorgos Zikos
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 11 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 11 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
ESAW
2006
Springer
14 years 2 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas