On Using Theorem Proving for Cognitive Agent-Oriented Programming

Alexander Birch Jensen, Koen V. Hindriks, Jørgen Villadsen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

Demonstrating reliability of cognitive multi-agent systems is of key importance. There has been an extensive amount of work on logics for verifying cognitive agents but it has remained mostly theoretical. Cognitive agent-oriented programming languages provide the tools for compact representation of complex decision making mechanisms, which offers an opportunity for applying a theorem proving approach. We base our work on the belief that theorem proving can add to the currently available approaches for providing assurance for cognitive multi-agent systems. However, a practical approach using theorem proving is missing. We explore the use of proof assistants to make verifying cognitive multi-agent systems more practical.
Original languageEnglish
Title of host publicationProceedings of the 13th International Conference on Agents and Artificial Intelligence
EditorsAna Paula Rocha, Luc Steels, Jaap van den Herik
Volume1
PublisherScience and Technology Publishing
Publication date2021
Pages446-453
ISBN (Print)978-989-758-484-8
Publication statusPublished - 2021
Event13th International Conference on Agents and Artificial Intelligence - Online conference
Duration: 4 Feb 20216 Feb 2021
Conference number: 13
https://icaart.scitevents.org/NLPinAI.aspx?y=2021
http://www.icaart.org/

Conference

Conference13th International Conference on Agents and Artificial Intelligence
Number13
LocationOnline conference
Period04/02/202106/02/2021
OtherWith a special session on Natural Language Processing in Artificial Intelligence - NLPinAI 2021.
Internet address

Keywords

  • Agent Programming
  • Formal Verification
  • Agent Logic
  • GOAL

Fingerprint

Dive into the research topics of 'On Using Theorem Proving for Cognitive Agent-Oriented Programming'. Together they form a unique fingerprint.

Cite this