Frontiers of Combining Systems
Springer Berlin (Verlag)
978-3-540-67281-4 (ISBN)
Invited Paper.- Combining Logic and Optimization in Cutting Plane Theory.- Session 1.- Towards Cooperative Interval Narrowing.- Integrating Constraint Solving into Proof Planning.- Termination of Constraint Contextual Rewriting.- Invited Paper.- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination.- Session 2.- Normal Forms and Proofs in Combined Modal and Temporal Logics.- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic.- Session 3.- Handling Differential Equations with Constraints for Decision Support.- Non-trivial Symbolic Computations in Proof Planning.- Integrating Computer Algebra and Reasoning through the Type System of Aldor.- Invited Paper.- Combinations of Model Checking and Theorem Proving.- Session 4.- Compiling Multi-paradigm Declarative Programs into Prolog.- Modular Redundancy for Theorem Proving.- Composing and Controlling Search in Reasoning Theories Using Mappings.- Invited Paper.- Why Combined Decision Problems Are Often Intractable.- Session 5.- Congruence Closure Modulo Associativity and Commutativity.- Combining Equational Theories Sharing Non-Collapse-Free Constructors.- Comparing Expressiveness of Set Constructor Symbols.
Erscheint lt. Verlag | 15.3.2000 |
---|---|
Reihe/Serie | Lecture Notes in Artificial Intelligence | Lecture Notes in Computer Science |
Zusatzinfo | X, 298 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 406 g |
Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
Schlagworte | AI logics • automated deduction • Constraint Solving • Cut-elimination theorem • Declarative Programming • Künstliche Intelligenz • Logic • Mathematical Logics • Optimization • Proof • proving • sequent calculus • theorem proving |
ISBN-10 | 3-540-67281-8 / 3540672818 |
ISBN-13 | 978-3-540-67281-4 / 9783540672814 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich