Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Accurate Computation of Sensitizable Paths Using Answer Set Programming

From MaRDI portal
Publication:2851235
Jump to:navigation, search

DOI10.1007/978-3-642-40564-8_10zbMATH Open1405.68038OpenAlexW157209229MaRDI QIDQ2851235FDOQ2851235

Martin Gebser, Bernd Becker, Tobias Schubert, M. Sauer, Benjamin Andres, Torsten Schaub

Publication date: 10 October 2013

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_10




Mathematics Subject Classification ID

Logic programming (68N17) Mathematical problems of computer architecture (68M07)



Uses Software

  • Gringo
  • clasp
  • Clingo






This page was built for publication: Accurate Computation of Sensitizable Paths Using Answer Set Programming

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2851235&oldid=15782485"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:22. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki