A DPLL-based calculus for ground satisfiability modulo theories

Conference proceeding

Peer reviewed

Lecture notes in computer science, Vol.2424, pp.308-319

JELIA 2002 : logics in artificial intelligence (Cosenza, 23-26 September 2002)

2002

DOI: 10.1007/3-540-45757-7_26

View Online

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Theoretical computing

Title: Subtitle: A DPLL-based calculus for ground satisfiability modulo theories
Creators: Cesare Tinelli - University of Iowa
Resource Type: Conference proceeding
Publication Details: Lecture notes in computer science, Vol.2424, pp.308-319
Conference: JELIA 2002 : logics in artificial intelligence (Cosenza, 23-26 September 2002)
Publisher: Springer
DOI: 10.1007/3-540-45757-7_26
ISSN: 0302-9743
eISSN: 1611-3349
Language: English
Date published: 2002
Academic Unit: Computer Science
Record Identifier: 9984259478602771

4 Record Views