Sciweavers

10997 search results - page 36 / 2200
» On the Structure of Complete Sets
Sort
View
VMCAI
2012
Springer
12 years 5 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 4 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 ...
APAL
2005
88views more  APAL 2005»
13 years 10 months ago
Completing pseudojump operators
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
Richard Coles, Rodney G. Downey, Carl G. Jockusch ...
JAIR
2008
104views more  JAIR 2008»
13 years 10 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
GRAPP
2009
13 years 7 months ago
Symmetry-based Completion
Acquired images often present missing, degraded or occluded parts. Inpainting techniques try to infer lacking information, usually from valid information nearby. This work introduc...
Thiago Pereira, Renato Paes Leme, Luiz Velho, Thom...