Logics in Artificial Intelligence
From MaRDI portal
Publication:5394160
DOI10.1007/b100483zbMath1111.68691OpenAlexW335252711MaRDI QIDQ5394160
Cesare Tinelli, Calogero G. Zarba
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100483
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Sharing Is Caring: Combination of Theories, Satisfiability Modulo Theories, An institution-independent proof of the Robinson consistency theorem, Combining stable infiniteness and (strong) politeness, Variants and satisfiability in the infinitary unification wonderland, Decision procedures for term algebras with integer constraints, Monotonicity inference for higher-order formulas, Being careful about theory combination, Parametrized invariance for infinite state processes, A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case, Variant-Based Satisfiability in Initial Algebras, Order-Sorted Rewriting and Congruence Closure, Towards satisfiability modulo parametric bit-vectors, Politeness and stable infiniteness: stronger together, Towards bit-width-independent proofs in SMT solvers, Polite combination of algebraic datatypes, Politeness for the theory of algebraic datatypes, An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types
Uses Software
