The art of Prolog: advanced programming techniques
The art of Prolog: advanced programming techniques
A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
A Petri Net Model for Reasoning in the Presence of Inconsistency
IEEE Transactions on Knowledge and Data Engineering
Knowledge Representation with Logic Programs
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
PEP - More than a Petri Net Tool
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Model Checking Rational Agents
IEEE Intelligent Systems
Verifying Multi-agent Programs by Model Checking
Autonomous Agents and Multi-Agent Systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
New features in CPN-AMI 3: focusing on the analysis of complex distributed systems
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
A three-dimensional abstraction framework to compare multi-agent system models
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume PartI
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We introduce a class of Petri nets, simple logic Petri nets (SLPN), that are based on logical expressions. We show how this type of nets can be efficiently mapped into logic programs with negation: the corresponding answer sets describe interleaved executions of the underlying nets (Theorem 1). The absence of an answer set indicates a deadlock situation. We also show how to correctly model and specify AgentSpeak agents and multi-agent systems with SLPN's (Theorem 2). Both theorems allow us to solve the task of model checking AgentSpeak multi-agent systems by computing answer sets of the obtained logic program with any ASP system.