Sciweavers

9405 search results - page 84 / 1881
» Computing a Model of Set Theory
Sort
View
LPNMR
2005
Springer
15 years 3 months ago
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Lengning Liu, Miroslaw Truszczynski
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
15 years 2 months ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...
IJIS
2007
88views more  IJIS 2007»
14 years 9 months ago
Recent advances in computational models of natural argument
This paper reviews recent advances in the interdisciplinary area lying between artificial intelligence and the theory of argumentation. The paper has two distinct foci: first, exam...
Chris Reed, Floriana Grasso
BSL
2004
100views more  BSL 2004»
14 years 9 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad
TACS
1994
Springer
15 years 2 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi