884 search results - page 70 / 177 » A Proof Theory for DL-Lite |
163
click to vote
JACM
2002
15 years 5 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
187
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
165
click to vote
JCT
2007
15 years 6 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
151
click to vote
MKM
2007
Springer
16 years 9 days ago
2007
Springer
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
158
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...