Representing hybrid automata by action language modulo theories

DOI10.1017/S1471068417000412zbMath1422.68154arXiv1707.06387MaRDI QIDQ4592716

Yunsong Meng, Nikhil Loney, Joohyung Lee

Publication date: 8 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.06387

zbMATH Keywords

hybrid automataaction languagesanswer set programming

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (1)

First-order stable model semantics with intensional functions

Uses Software

• Robotics
• CCalc

Cites Work

• Unnamed Item
• Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz
• Robotics, vision and control. Fundamental algorithms in MATLAB.
• Stable models and circumscription
• Nonmonotonic causal theories
• Integrating answer set programming and constraint logic programming
• Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming
• dReal: An SMT Solver for Nonlinear Theories over the Reals
• Coala: A Compiler from Action Languages to ASP

This page was built for publication: Representing hybrid automata by action language modulo theories