state explosion
Recently Published Documents


TOTAL DOCUMENTS

71
(FIVE YEARS 5)

H-INDEX

13
(FIVE YEARS 1)

2021 ◽  
Author(s):  
Zeynep G. Saribatur ◽  
Johannes P. Wallner

Argumentation in Artificial Intelligence (AI) builds on formal approaches to reasoning argumentatively. Common to many such approaches is to use argumentation frameworks (AFs) as reasoning engines, with AFs being composed of arguments and attacks between arguments, which are instantiated from knowledge bases in a principle-based manner. While representing what can be argued for in an AF provides a conceptually clean way, this process can face challenges arising from generating a large number of arguments, which can act as a barrier to explainability. Inspired by successful approaches to model checking where the state explosion is mitigated by applying existential abstraction, we study an adaption of existential abstraction in form of clustering arguments in an AF to address an associated "argument explosion". In this paper, we provide a foundational investigation of this form of existential abstraction by defining semantics of the resulting clustered AFs, which balance two inherent aspects of existential abstractions: abstracting from concrete AFs and not permitting too much spuriousness (i.e., conclusions that hold on the abstraction but not on the original AF). Moreover, we show properties of clustered AFs, including complexity results, discuss use of clusterings for explaining results of reasoning tasks, and employ the recently introduced methodology of abstraction in answer set programming (ASP) for obtaining and reasoning over clustered AFs.


2020 ◽  
Author(s):  
Roobaea Alroobaea

Our goal is to propose a suitable approach for validating blockchains. For this purpose, we intend to adopt formal methods which are based on strong mathematical foundations. More precisely, we follow a model-based testing approach. The latter consists in describing the behavior of the system using a specific formalism, deriving test cases from the obtained model and then executing the obtained tests on the implementation to check whether it is correct or not. The adopted formalism corresponds to the timed automaton Model. The generated tests may be either digital or analog. Moreover, we propose several techniques which allow to solve the state explosion which may be encountered during the verification and test generation phases.


2020 ◽  
Author(s):  
Roobaea Alroobaea

Our goal is to propose a suitable approach for validating blockchains. For this purpose, we intend to adopt formal methods which are based on strong mathematical foundations. More precisely, we follow a model-based testing approach. The latter consists in describing the behavior of the system using a specific formalism, deriving test cases from the obtained model and then executing the obtained tests on the implementation to check whether it is correct or not. The adopted formalism corresponds to the timed automaton Model. The generated tests may be either digital or analog. Moreover, we propose several techniques which allow to solve the state explosion which may be encountered during the verification and test generation phases.


Filomat ◽  
2020 ◽  
Vol 34 (15) ◽  
pp. 5085-5094
Author(s):  
Kai-Qing Zhou ◽  
Li-Ping Mo ◽  
Chang-Feng Chen ◽  
Wei Jiang

Recently, it is difficult to simulate, analyze and control a real knowledge-based system using the correspondence Petri net (PN) when there exist many current states. To overcome the state explosion problem of PN, an efficient decomposition algorithm is presented to divide a large-scale PN into a series of corresponding sub-PNs by keeping the consistency of dynamic properties. In this novel decomposition approach, an index function is defined to judge the subnet needs to be decomposed or not. Furthermore, an exhaustive analysis on the consistency of related dynamic properties is also discussed between the original PN and the corresponding sub-PNs. Finally, a case study is carried out to illustrate the feasibility and validity of the proposed approach.


Author(s):  
Tristan Charrier ◽  
Sébastien Gamblin ◽  
Alexandre Niveau ◽  
François Schwarzentruber

Hintikka's World is a graphical and pedagogical tool that shows how artificial agents can reason about higher-order knowledge. In this demonstration paper, we present the implementation of symbolic models in Hintikka's World. They enable the tool to scale, by helping it to face the state explosion, which makes it possible to provide examples featuring real card games, such as Hanabi.


10.29007/7lrd ◽  
2018 ◽  
Author(s):  
Ian Cassar ◽  
Adrian Francalanza ◽  
Duncan Attard ◽  
Luca Aceto ◽  
Anna Ingolfsdottir

Ensuring formal correctness for actor-based, concurrent systems is a difficult task, pri- marily because exhaustive, static analysis verification techniques such as model checking quickly run into state-explosion problems. Runtime monitoring techniques such as Run- time Verification and Adaptation circumvent this limitation by verifying the correctness of a program by dynamically analysing its executions. This paper gives an overview of a suite of monitoring tools available for verifying and adapting actor-based Erlang programs.


Author(s):  
Lamia Allal ◽  
Ghalem Belalem ◽  
Philippe Dhaussy ◽  
Ciprian Teodorov

Author(s):  
Ciprian Teodorov ◽  
Philippe Dhaussy ◽  
Lamia Allal ◽  
Ghalem Belalem

2017 ◽  
Vol 8 (1) ◽  
Author(s):  
Seo-Yoon Bae ◽  
Dongwook Kim ◽  
Dongbin Shin ◽  
Javeed Mahmood ◽  
In-Yup Jeon ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document