Sciweavers

797 search results - page 39 / 160
» Eliminating Proofs from Programs
Sort
View
COMMA
2010
14 years 7 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
AAAI
2010
15 years 2 months ago
A Temporal Proof System for General Game Playing
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
Michael Thielscher, Sebastian Voigt
131
Voted
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
15 years 6 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ICFP
2010
ACM
15 years 1 months ago
Security-typed programming within dependently typed programming
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
Jamie Morgenstern, Daniel R. Licata
93
Voted
LPNMR
2007
Springer
15 years 6 months ago
An Smodels System with Limited Lookahead Computation
We describe an answer-set programming solver smodels− , derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels− outp...
Gayathri Namasivayam, Miroslaw Truszczynski