72 search results - page 1 / 15 » On a syntactic approximation to logics that capture complexi... |
122
click to vote
ECCC
2006
15 years 5 months ago
2006
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
138
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
166
Voted
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
154
click to vote
VMCAI
2004
Springer
15 years 11 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
171
click to vote
CSL
2009
Springer
15 years 9 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...