Sciweavers

254 search results - page 12 / 51
» Answer Sets for Propositional Theories
Sort
View
MLQ
2006
84views more  MLQ 2006»
13 years 7 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
ASP
2003
Springer
13 years 11 months ago
Answer Set Programming with Templates
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show ho...
Giovambattista Ianni, Giuseppe Ielpa, Adriana Piet...
TPLP
2010
135views more  TPLP 2010»
13 years 6 months ago
Formalization of psychological knowledge in answer set programming and its application
In this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of kno...
Marcello Balduccini, Sara Girotto
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 2 months ago
A Complete Conclusion-Based Procedure for Judgment Aggregation
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
Gabriella Pigozzi, Marija Slavkovik, Leendert van ...