System aspmt2smt: Computing ASPMT Theories by SMT Solvers

DOI10.1007/978-3-319-11558-0_37zbMATH Open1432.68055OpenAlexW216667991MaRDI QIDQ2938519FDOQ2938519

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

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

Cites Work

• Constraint Answer Set Solving
• Stable models and circumscription
• Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Non-monotonic spatial reasoning with answer set programming modulo theories
• Partial Compilation of ASP Programs
• 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
• Clingo goes linear constraints over reals and integers
• Constraint answer set solver EZCSP and why integration schemas matter
• ASPMT2SMT
• Qualitative reasoning about 2D cardinal directions using answer set programming
• First-order stable model semantics with intensional functions
• The External Interface for Extending WASP
• Optimal planning with expressive action languages as constraint optimization
• Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming

Uses Software

• z3
• Cplus2ASP
• f2lp

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938519)