The following pages link to Modal resolution in clausal form (Q1118577):
Displaying 16 items.
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) (Q631075) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics (Q687153) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Linear strategy for propositional modal resolution (Q1113888) (← links)
- Resolution for some first-order modal systems (Q1178699) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- Multimodal logic programming using equational and order-sorted logic (Q1199813) (← links)
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742) (← links)
- A tableau-like proof procedure for normal modal logics (Q1329745) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- Deciding the guarded fragments by resolution (Q1867216) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- Capturing equilibrium models in modal logic (Q2447178) (← links)
- A hybrid reasoning system for terminologies and first-order clauses in knowledge bases (Q2493276) (← links)
- Temporal representation and reasoning in artificial intelligence: A review (Q5943344) (← links)
