2585 search results - page 369 / 517 » Automating Coherent Logic |
181
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
163
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
186
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
155
click to vote
LICS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
199
click to vote
ELP
1991
15 years 10 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...