TSAT++: an Open Platform for Satisfiability Modulo Theories-Reference-Cited by-同舟云学术

TSAT++: an Open Platform for Satisfiability Modulo Theories

Published:2005-07 Issue:3 Volume:125 Page:25-36
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Armando Alessandro,Castellini Claudio,Giunchiglia Enrico,Idini Massimo,Maratea Marco

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference20 articles.

1. Embedding Complex Decision Procedures inside an Interactive Theorem Prover;Armando;Annals of Mathematics and Artificial Intelligence,1993

2. SAT-based procedures for temporal reasoning;Armando,2000

3. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea. A sat-based decision procedure for the boolean combination of difference constraints, May 2004. To appear at SAT 2004, Vancouver, BC, Canada

4. A SAT based approach for solving formulas over boolean and linear mathematical propositions;Audemard,2002

5. Bounded model checking for timed systems;Audemard,2002

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AI & COVID-19;Intelligenza Artificiale;2022-02-04

2. An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic;AIxIA 2021 – Advances in Artificial Intelligence;2022

3. Theory propagation and reification;Science of Computer Programming;2015-11

4. Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints;Journal of Aerospace Information Systems;2014-12

5. Solving disjunctive temporal problems with preferences using maximum satisfiability;AI Communications;2012