446 search results - page 41 / 90 » Automating Theories in Intuitionistic Logic |
169
click to vote
CADE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
191
click to vote
IJCAI
2003
15 years 7 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
128
click to vote
LICS
2008
IEEE
16 years 11 hour ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
165
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
165
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...