Combining multisets with integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2392, Issue , 2002, Pages 363-376

  Zarba, Calogero G ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; THEOREM PROVING;

COMBINATION DOMAINS; CONSTRAINT LANGUAGE; DECISION PROCEDURE; FIRST-ORDER THEORIES; MULTI-SETS; NELSON-OPPEN COMBINATION METHODS;

AUTOMATION;

EID: 84948968028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_30     Document Type: Conference Paper

References (5)

1. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, 1979.
2. Christos H. Papadimitriou. On the complexity of integer programming. Journal of the Association for Computing Machinery, 28(4):765–768, 1981.
3. Cesare Tinelli and Mehdi T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Franz Baader and Klaus U. Schulz, editors, Frontiers of Combining Systems, volume 3 of Applied Logic Series, pages 103–120. Kluwer Academic Publishers, 1996.
4. Calogero G. Zarba. Combining lists with integers. In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors, International Joint Conference on Automated Reasoning (Short Papers), Technical Report DII 11/01, pages 170–179. University of Siena, Italy, 2001.
5. Calogero G. Zarba. Combining sets with integers. In Alessandro Armando, editor, Frontiers of Combining Systems, volume 2309 of Lecture Notes in Artificial Intelligence, pages 103–116. Springer, 2002.