Proof-search in intuitionistic logic based on constraint satisfaction
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 312-329
- https://doi.org/10.1007/3-540-61208-4_20
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A CLP view of logic programmingPublished by Springer Nature ,2005
- Observable Semantics for Constraint Logic ProgramsJournal of Logic and Computation, 1995
- An improved refutation system for intuitionistic predicate logicJournal of Automated Reasoning, 1994
- An O(n log n)-Space Decision Procedure for Intuitionistic Propositional LogicJournal of Logic and Computation, 1993
- Contraction-free sequent calculi for intuitionistic logicThe Journal of Symbolic Logic, 1992
- A Simplified Proof Method for Elementary LogicPublished by Springer Nature ,1983
- An Improved Proof ProcedurePublished by Springer Nature ,1983
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979
- A proof procedure with matrix reductionPublished by Springer Nature ,1970