Sciweavers

109 search results - page 1 / 22
» One useful logic that defines its own truth
Sort
View
CORR
2008
Springer
101views Education» more  CORR 2008»
13 years 5 months ago
One useful logic that defines its own truth
Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own ...
Andreas Blass, Yuri Gurevich
DESRIST
2009
Springer
133views Education» more  DESRIST 2009»
13 years 10 months ago
Using the metaphysics of quality to define design science
Design has evolved from a craft into an academic discipline, but it still falls short on defining its own science. I review previous approaches to Design Science and conclude that...
Christoph Bartneck
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 5 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 5 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
CSL
2004
Springer
13 years 10 months ago
Game-Based Notions of Locality Over Finite Models
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
Marcelo Arenas, Pablo Barceló, Leonid Libki...