365 search results - page 7 / 73 » First-order logical filtering |
197
Voted
TABLEAUX
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
187
Voted
TIME
2003
IEEE
16 years 27 days ago
2003
IEEE
186
click to vote
ISMVL
2007
IEEE
16 years 1 months ago
2007
IEEE
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
205
click to vote
ICALP
2000
Springer
15 years 11 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
203
Voted
JAR
2002
15 years 7 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...