[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Disproving False Conjectures
- 作者Vardi, Moshe Y.; Voronkov, Andrei
- 文件大小244.86KB
- 发表时间2003
- DOI10.1007/978-3-540-39813-4_2
- 页码33-48
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Improving Dependency PairsVardi, Moshe Y.; Voronkov, Andrei · 2003
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Disproving False ConjecturesVardi, Moshe Y.; Voronkov, Andrei · 2003
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Congruence Closure with Integer OffsetsVardi, Moshe Y.; Voronkov, Andrei · 2003
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Automatic Structures of Bounded DegreeVardi, Moshe Y.; Voronkov, Andrei · 2003
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Is Cantor’s Theorem Automatic?Vardi, Moshe Y.; Voronkov, Andrei · 2003
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || Minimizing Automata on Infinite WordsVardi, Moshe Y.; Voronkov, Andrei · 2003
[Lecture Notes in Computer Science] Logic for Programming, Artificial Intelligence, and Reasoning Volume 2850 || A Machine-Verified Code GeneratorVardi, Moshe Y.; Voronkov, Andrei · 2003