System aspmt2smt: Computing ASPMT Theories by SMT Solvers

DOI10.1007/978-3-319-11558-0_37zbMath1432.68055OpenAlexW216667991MaRDI QIDQ2938519

Joohyung Lee, Michael Bartholomew

Publication date: 14 January 2015

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_37

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (10)

ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories ⋮ Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming ⋮ Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming ⋮ Clingo goes linear constraints over reals and integers ⋮ Non-monotonic spatial reasoning with answer set programming modulo theories ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ Partial Compilation of ASP Programs ⋮ The External Interface for Extending WASP ⋮ ASPMT2SMT ⋮ First-order stable model semantics with intensional functions

Uses Software

• z3
• Cplus2ASP
• f2lp

Cites Work

• Stable models and circumscription
• Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming
• Constraint Answer Set Solving
• Unnamed Item
• Unnamed Item

This page was built for publication: System aspmt2smt: Computing ASPMT Theories by SMT Solvers