144 search results - page 18 / 29 » On meta complexity of propositional formulas and proposition... |
129
Voted
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
82
Voted
INFORMATICALT
2010
15 years 10 days ago
2010
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
113
click to vote
TLCA
2009
Springer
15 years 8 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
111
Voted
FMCAD
2006
Springer
15 years 5 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
106
Voted
JANCL
2007
15 years 1 months ago
2007
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...