Sciweavers

414 search results - page 27 / 83
» Resolution for Intuitionistic Logic
Sort
View
CADE
2001
Springer
16 years 6 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider
AMAI
2007
Springer
15 years 6 months ago
Automated theorem proving by resolution in non-classical logics
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
Viorica Sofronie-Stokkermans
JSYML
2000
110views more  JSYML 2000»
15 years 5 months ago
Basic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...
TIME
2005
IEEE
15 years 11 months ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
CADE
2003
Springer
16 years 6 months ago
Monodic Temporal Resolution
Anatoli Degtyarev, Michael Fisher, Boris Konev