144 search results - page 16 / 29 » On meta complexity of propositional formulas and proposition... |
DIAGRAMS
2000
Springer
13 years 12 months ago
2000
Springer
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as th...
DALT
2009
Springer
13 years 11 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
ERSHOV
2001
Springer
13 years 12 months ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
KR
1991
Springer
13 years 11 months ago
1991
Springer
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...