The following pages link to (Q3791114):
Displaying 25 items.
- Identity in modal logic theorem proving (Q687161) (← links)
- Automated reasoning and nonclassical logics: Introduction (Q805615) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- A resolution framework for finitely-valued first-order logics (Q1185455) (← links)
- Multimodal logic programming using equational and order-sorted logic (Q1199813) (← links)
- Resolution theorem proving in reified modal logics (Q1332644) (← links)
- On the intuitionistic force of classical search (Q1575923) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- A uniform procedure for converting matrix proofs into sequent-style systems (Q1854382) (← links)
- TPS: A theorem-proving system for classical type theory (Q1923825) (← links)
- Best solving modal equations (Q1971794) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- Multimodal logic programming (Q2503328) (← links)
- Unsorted Functional Translations (Q2825403) (← links)
- (Q4281258) (← links)
- Herbrand style proof procedures for modal logic (Q4291028) (← links)
- MGTP: A model generation theorem prover — Its advanced features and applications — (Q4610311) (← links)
- T-string unification: Unifying prefixes in non-classical proof methods (Q4645241) (← links)
- On the intuitionistic force of classical search (Extended abstract) (Q4645244) (← links)
- Proof-terms for classical and intuitionistic resolution (Q4647497) (← links)
- Converting non-classical matrix proofs into sequent-style systems (Q4647538) (← links)
- Resolution-based calculi for modal and temporal logics (Q4647550) (← links)
- (Q5015283) (← links)
- Multi-modal logic programming using equational and order-sorted logic (Q5096187) (← links)
- Strongly analytic tableaux for normal modal logics (Q5210808) (← links)
