The following pages link to Logics in Artificial Intelligence (Q5394160):
Displaying 22 items.
- Monotonicity inference for higher-order formulas (Q438558) (← links)
- Parametrized invariance for infinite state processes (Q493122) (← links)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
- An institution-independent proof of the Robinson consistency theorem (Q878156) (← links)
- Towards satisfiability modulo parametric bit-vectors (Q2051567) (← links)
- Politeness and stable infiniteness: stronger together (Q2055852) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- Towards bit-width-independent proofs in SMT solvers (Q2305428) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- Being careful about theory combination (Q2441773) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- An abstract decision procedure for satisfiability in the theory of recursive data types (Q2864522) (← links)
- Sharing Is Caring: Combination of Theories (Q3172894) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Conflict Analysis and Merging Operators Selection in Possibility Theory (Q3524994) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q4808758) (← links)
- Combining Decision Procedures by (Model-)Equality Propagation (Q5179357) (← links)
- Connecting many-sorted theories (Q5294025) (← links)
- Combining stable infiniteness and (strong) politeness (Q6053847) (← links)
- Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
