The SAT-based approach to separation logic
From MaRDI portal
Publication:862390
DOI10.1007/s10817-005-9002-1zbMath1109.68108OpenAlexW2170813482WikidataQ62652851 ScholiaQ62652851MaRDI QIDQ862390
Marco Maratea, Enrico Giunchiglia, Claudio Castellini, Alessandro Armando
Publication date: 24 January 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/314780/files/10817_2005_Article_9002.pdf
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Efficient solution techniques for disjunctive temporal reasoning problems
- A structure-preserving clause form translation
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Embedding complex decision procedures inside an interactive theorem prover.
- A fast parallel SAT-solver -- efficient workload balancing
- Backtracking algorithms for disjunctions of temporal constraints
- SAT-based decision procedures for classical modal logics
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- Automated Reasoning
- Computer Aided Verification
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Mechanizing Mathematical Reasoning
- Computer Aided Verification
