Encoding higher level extensions of Petri nets in answer set programming

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Answering realistic questions about biological systems and pathways similar to text book questions used for testing students' understanding of such systems is one of our long term research goals. Often these questions require simulation based reasoning. In this paper, we show how higher level extensions of Petri Nets, such as colored tokens can be encoded in Answer Set Programming, thereby providing the right formalisms to model and reason about such questions with relative ease. Our approach can be adapted to other domains. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Anwar, S., Baral, C., & Inoue, K. (2013). Encoding higher level extensions of Petri nets in answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8148 LNAI, pp. 116–121). https://doi.org/10.1007/978-3-642-40564-8_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free