Probabilistic programming can be conceptually seen as generalisation of logicprogramming where instead of just returning a set of answers to a given query, we also return a probability distribution over those answers...
详细信息
Epistemic logic Programs (ELPs), which propose an extension to Answer Set programming (ASP) with epistemic operators, have their semantic defined, in various ways, in terms of world views, which are sets of belief set...
详细信息
We propose a demonstration of the Active logic Documents (ALDs) approach and the Ciao Playground, as well as a recent extension to ALDs to facilitate the integration of other tools into the system for creating Hybrid ...
详细信息
We propose a demonstration of the Active logic Documents (ALDs) approach and the Ciao Playground, as well as a recent extension to ALDs to facilitate the integration of other tools into the system for creating Hybrid Active logic Documents (HALD), and a concrete application of these technologies.
Autonomous driving (AD) systems need to obey traffic rules and sometimes execute critical maneuvers that breach existing rules to ensure safe and rule-compliant driving. To endow such legal knowledge to the AD module,...
详细信息
Autonomous driving (AD) systems need to obey traffic rules and sometimes execute critical maneuvers that breach existing rules to ensure safe and rule-compliant driving. To endow such legal knowledge to the AD module, we need to formalize rules considering expressiveness, decidability, scalability, and adaptability. This paper critically examines possible formalization methods and demonstrates how we can model traffic rule exceptions for compliance checking of AD models. This ensures that AD systems are safe and can identify situations requiring more complex reasoning, such as exempting ongoing rule processes. We formalize legal traffic rule exceptions hierarchically and modularly in temporal logic and ground them to sensor data for assessing model compliance. Moreover, we introduce a parsed tree structure that supports and aids neural network-based models with formal rules. We evaluate our approach by monitoring vehicle trajectories against formalized traffic rules and handling rule exceptions in various traffic scenarios. Our results show that our approach can effectively represent complex traffic rules and monitor the safety and efficiency of AD systems against legal specifications. This paper contributes to the field of legal reasoning and compliance checking by providing a methodology for formalizing traffic rules from a rule-exception perspective in a machine-readable form based on sensor data limitations. 2022 Copyright for this paper by its authors.
Motivated by the SARS-CoV-2 pandemic, we implemented a stochastic, network-based model of infectious disease transmission in the probabilistic logicprogramming language ProbLog. In this contribution, we show how prob...
详细信息
In this paper I explore a further option for solving B constraints. In particular, I develop a framework translating B predicates to s(CASP), a goal-directed form of Answer Set programming. Furthermore, the presented ...
详细信息
We recently presented the MR-CKR framework to reason with knowledge overriding across contexts organized in multi-relational hierarchies. Reasoning is realized via ASP with Algebraic Measures, allowing for flexible de...
详细信息
We recently presented the MR-CKR framework to reason with knowledge overriding across contexts organized in multi-relational hierarchies. Reasoning is realized via ASP with Algebraic Measures, allowing for flexible definitions of preferences. In this paper, we show how to apply our theoretical work to autonomous-vehicle scene data: we apply MR-CKR to the problem of generating challenging scenes for autonomous vehicle learning. In practice, most of the scene data for AV learning models common situations, thus it might be difficult to capture cases where a particular situation occurs (e.g. partial occlusions of a crossing pedestrian). The MR-CKR model allows for data organization exploiting the multi-dimensionality of such data (e.g., temporal and spatial dimension). Reasoning over multiple contexts enables the verification and configuration of scenes, using the combination of different scene ontologies. We describe a framework for semantically guided data generation, based on a combination of MR-CKR and algebraic measures. The framework is implemented in a proof-of-concept prototype exemplifying some cases of scene generation. 2023 Copyright for this paper by its authors.
This paper demonstrates the use of logical English as a logicprogramming language that can be interpreted by the s(CASP) reasoner. It shows how legal knowledge and unknown information can be expressed in a form of En...
详细信息
In this paper we consider Epistemic logic Programs (ELPs), which extend Answer Set programming (ASP) with "epistemic operators". There are several approaches to the semantics of such programs in terms of Wor...
详细信息
The use of assurance cases is gaining popularity, particularly in the safety-critical system industry, as an organized approach to submitting documentation for the safety and security certification of systems. However...
详细信息
The use of assurance cases is gaining popularity, particularly in the safety-critical system industry, as an organized approach to submitting documentation for the safety and security certification of systems. However, these arguments can become overwhelming and complicated, even for moderately complex systems. Therefore, there is a compelling requirement to develop new automation strategies that can aid in creating and assessing assurance cases. Existing assurance-case tools primarily automate syntactic analysis, focusing on structural completeness, while providing limited or no support for semantically evaluating the logical aspects of the assurance case. In prior work, we introduced a framework called Assurance 2.0, which aims to enhance the rigor of assurance cases by emphasizing the reasoning process, evidence utilized, and explicit identification of counter-claims (defeaters) and counter-evidence. In this paper, we present a new approach to enhancing Assurance 2.0 by incorporating semantic rule-based analysis capabilities. Firstly, we systematically convert the assurance case into Prolog predicates and constraints. Then, leveraging the analysis capabilities of the s(CASP), a goal-directed top-down solver for Constraints Answer Set Programs, we evaluate the semantic properties of assurance cases, including logical consistency, completeness, and indefeasibility. The application of these analyses provides both authors and evaluators with higher confidence when assessing the assurance case. 2023 Copyright for this paper by its authors.
暂无评论