Hybrid answer set programming
From MaRDI portal
Publication:392277
DOI10.1016/J.APAL.2013.07.008zbMATH Open1344.68041OpenAlexW2089704334MaRDI QIDQ392277FDOQ392277
Authors: Alex Brik, Jeffrey Remmel
Publication date: 13 January 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2013.07.008
Recommendations
Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Markov Decision Processes
- Constraint Answer Set Solving
- Title not available (Why is that?)
- Integrating answer set programming and constraint logic programming
- Reinforcement learning in finite MDPs: PAC analysis
- A new approach to hybrid probabilistic logic programs
- Hybrid ASP
- Extensions of answer set programming
- Complexity of finite-horizon Markov decision process problems
- Probabilistic reasoning with answer sets
Cited In (2)
This page was built for publication: Hybrid answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392277)