scientific article
From MaRDI portal
Publication:3682462
zbMath0567.03002MaRDI QIDQ3682462
No author found.
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Mechanization of proofs and logical operations (03B35) Collected or selected works; reprintings or translations of classics (01A75) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Related Items
Seventy Years of Computer Science, Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Answer set programming based on propositional satisfiability, The SAT-based approach to separation logic, Parameterized complexity classes beyond para-NP, Simplified lower bounds for propositional proofs, The disconnection tableau calculus, Liberalized variable splitting, Solving satisfiability problems with preferences, Many-valued logic and mixed integer programming, Unnamed Item, Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility, The depth of resolution proofs, From Search to Computation: Redundancy Criteria and Simplification at Work, SAT solver management strategies in IC3: an experimental approach, On deciding subsumption problems, Generating extended resolution proofs with a BDD-based SAT solver, The complexity of Gentzen systems for propositional logic, Dual proof generation for quantified Boolean formulas with a BDD-based solver, Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals
