Formalising nominal C-unification generalised with protected variables

2021 ◽  
pp. 1-26
Author(s):  
Mauricio Ayala-Rincón ◽  
Washington de Carvalho-Segundo ◽  
Maribel Fernández ◽  
Gabriel Ferreira Silva ◽  
Daniele Nantes-Sobrinho
Keyword(s):  
Point Of View ◽  
Inference Rules ◽  
Rule Based ◽  
Unification Algorithm

Abstract This work extends a rule-based specification of nominal C-unification formalised in Coq to include ‘protected variables’ that cannot be instantiated during the unification process. By introducing protected variables, we are able to reuse the C-unification simplification rules to solve nominal C-matching (as well as equality check) problems. From the algorithmic point of view, this extension is sufficient to obtain a generalised C-unification procedure; however, it cannot be formally checked by simple reuse of the original formalisation. This paper describes the additional effort necessary in order to adapt the specification of the inference rules and reuse previous formalisations. We also generalise a functional recursive nominal C-unification algorithm specified in PVS with protected variables, effectively adapting this algorithm to the tasks of nominal C-matching and nominal equality check. The PVS formalisation is applied to test the correctness of a Python manual implementation of the algorithm.

scholarly journals Optimizing Emergency Medical Service Structures Using a Rule-Based Discrete Event Simulation—A Practitioner’s Point of View

2021 ◽  
Vol 18 (5) ◽  
pp. 2649
Author(s):  
Christoph Strauss ◽  
Günter Bildstein ◽  
Jana Efe ◽  
Theo Flacher ◽  
Karen Hofmann ◽  
...  
Keyword(s):  
Discrete Event Simulation ◽  
Emergency Services ◽  
Prehospital Care ◽  
Discrete Event ◽  
Point Of View ◽  
Public Healthcare ◽  
Healthcare Organizations ◽  
Rule Based ◽  
Event Simulation ◽  
Emergency Medical

Many studies in research deal with optimizing emergency medical services (EMS) on both the operational and the strategic level. It is the purpose of this method-oriented article to explain the major features of “rule-based discrete event simulation” (rule-based DES), which we developed independently in Germany and Switzerland. Our rule-based DES addresses questions concerning the location and relocation of ambulances, dispatching and routing policies, and EMS interplay with other players in prehospital care. We highlight three typical use cases from a practitioner’s perspective and go into different countries’ peculiarities. We show how research results are applied to EMS and healthcare organizations to simulate and optimize specific regions in Germany and Switzerland with their strong federal structures. The rule-based DES serves as basis for decision support to improve regional emergency services’ efficiency without increasing cost. Finally, all simulation-based methods suggest normative solutions and optimize EMS’ performance within given healthcare system structures. We argue that interactions between EMS, emergency departments, and public healthcare agencies are crucial to further improving effectiveness, efficiency, and quality.

Rule-Based Systems for Medical Diagnosis

2015 ◽  
pp. 21-44
Author(s):  
V. S. Giridhar Akula
Keyword(s):  
Fuzzy Logic ◽  
Decision Support ◽  
Support System ◽  
Medical Diagnosis ◽  
Intelligent Systems ◽  
Inference Rules ◽  
Rule Based ◽  
Rule Based System ◽  
Fault Monitoring ◽  
Design Scheduling

A rule-based system is a set of “if-then” statements that uses a set of assertions, to which rules on how to act upon those assertions are created. Rule-based expert systems have played an important role in modern intelligent systems and their applications in strategic goal setting, planning, design, scheduling, fault monitoring, diagnosis, and so on. The theory of decision support system is explained in detail. This chapter explains how the concepts of fuzzy logic are used for forward and backward chaining. Patient data is analyzed with the help of inference rules.

scholarly journals Quantum Computing for Dealing with Inaccurate Knowledge Related to the Certainty Factors Model

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 189
Author(s):  
Vicente Moret-Bonillo ◽  
Samuel Magaz-Romero ◽  
Eduardo Mosqueira-Rey
Keyword(s):  
Quantum Computing ◽  
Procedural Knowledge ◽  
Quantum Probability ◽  
Declarative Knowledge ◽  
Point Of View ◽  
Use Case ◽  
Rule Based ◽  
Inexact Reasoning ◽  
Classical Point ◽  
Rule Based Systems

In this paper, we illustrate that inaccurate knowledge can be efficiently implemented in a quantum environment. For this purpose, we analyse the correlation between certainty factors and quantum probability. We first explore the certainty factors approach for inexact reasoning from a classical point of view. Next, we introduce some basic aspects of quantum computing, and we pay special attention to quantum rule-based systems. In this context, a specific use case was built: an inferential network for testing the behaviour of the certainty factors approach in a quantum environment. After the design and execution of the experiments, the corresponding analysis of the obtained results was performed in three different scenarios: (1) inaccuracy in declarative knowledge, or imprecision, (2) inaccuracy in procedural knowledge, or uncertainty, and (3) inaccuracy in both declarative and procedural knowledge. This paper, as stated in the conclusions, is intended to pave the way for future quantum implementations of well-established methods for handling inaccurate knowledge.

PARTIAL ALGEBRAIC CONDITIONAL SPACES

2004 ◽  
Vol 12 (06) ◽  
pp. 781-789 ◽  
Author(s):  
ANTONIO DI NOLA ◽  
ROMANO SCOZZAFAVA
Keyword(s):  
Conditional Probability ◽  
Point Of View ◽  
General Sense ◽  
Rule Based ◽  
Common Value ◽  
The Third ◽  
Axiomatic Definition ◽  
De Finetti ◽  
Conditional Events ◽  
The Given

Conditioning plays a central role, both from a theoretical and practical point of view, in domains such as logic and probability, or rule–based expert systems. In classical approaches to probability, there is the notion of "conditional probability" P(E|H), but usually there is no meaning given to E|H itself. In 1935 de Finetti 5 was the first to mention "conditional events" outside the function P. We shall refer to a concept of conditional event extensively discussed in 4, where the idea of de Finetti of looking at E|H, with H≠∅ (the impossible event), as a three–valued logical entity (true when both E and H are true, false when H is true and E is false, "undetermined" when H is false) is generalized (or better, in a sense, is given up) by letting the third "value" t(E, H)suitably depend on the given ordered pair(E, H) and not being just an undetermined common value for all pairs. Here an axiomatic definition is given of Partial Algebraic Conditional Spaces (PACS), that is a set of conditional events endowed with two partial operations (denoted by ⊕ and ⊙): we then show that the structure discussed through a betting scheme in 4 (i.e., a class of particular random variables with suitable partial sum and product) is a "natural" model of a PCAS. Moreover, it turns out that the map t(E, H) can be looked on – with this choice of the two operations ⊕ and ⊙ – as a conditional probability (in its most general sense related to the concept of coherence) satisfying the classic de Finetti – Popper axioms.

scholarly journals Evaluation of Optimization-Based EV Charging Scheduling with Load Limit in a Realistic Scenario

Energies ◽  
2019 ◽  
Vol 12 (24) ◽  
pp. 4730 ◽  
Author(s):  
Steffen Limmer
Keyword(s):  
Point Of View ◽  
Simulation Experiments ◽  
Total Load ◽  
Economic Point ◽  
Rule Based ◽  
Electric Vehicle Charging ◽  
Load Limit ◽  
Simplifying Assumptions ◽  
The Right ◽  
Ev Charging

In the literature, optimization-based approaches are frequently proposed for the control of electric vehicle charging. However, they are usually evaluated under simplifying assumptions and are not compared to more simple approaches. The present work compares optimization-based approaches with rule-based ones in a simple but realistic scenario, in which a certain limit for the total load has to be satisfied. The scenario is based on the situation at an office building in Germany. In simulation experiments, different control approaches are evaluated not only in terms of pure performance but also from an economic perspective. The results indicate that, although the optimization-based approaches outperform the rule-based approaches, they are not always the right choice from an economic point of view.

Using Rules in the Narrative Knowledge Representation Language (NKRL) Environment

2010 ◽  
pp. 50-75 ◽  
Author(s):  
Gian Piero Zarri
Keyword(s):  
Knowledge Representation ◽  
Analogical Reasoning ◽  
Point Of View ◽  
Inference Rules ◽  
Economic Interest ◽  
Formal Representation ◽  
Representation Point ◽  
Knowledge Representation Language ◽  
Representation Language ◽  
High Level

NKRL is a semantic language expressly designed to deal with all sort of ‘narratives’, in particular with those (‘non-fictional narratives’) of an economic interest. From a knowledge representation point of view, its main characteristics consists in the use of two different sorts of ontologies, a standard, binary ontology of concepts, and an ontology of n-ary templates, where each template corresponds to the formal representation of a class of elementary events. Rules in NKRL correspond to high-level reasoning paradigms like the search for causal relationships or the use of analogical reasoning. Given i) the conceptual complexity of these paradigms, and ii) the sophistication of the underlying representation language, rules in NKRL cannot be implemented in a (weak) ‘inference by inheritance’ style but must follow a powerful ‘inference by resolution’ approach. After a short reminder about these two inference styles, and a quick introduction of the NKRL language, the chapter describes in some depth the main characteristics of the NKRL inference rules.

Building up a toolbox for Martin-Löf’s type theory: subset theory

1998 ◽  
Author(s):  
Giovanni Sambin ◽  
Silvio Valentini
Keyword(s):  
Set Theory ◽  
Type Theory ◽  
Explicit Knowledge ◽  
Complete Information ◽  
Point Of View ◽  
Inference Rules ◽  
Logical Calculus ◽  
Amount Of Information ◽  
Single Sentence ◽  
Total Control

Beginning in 1970, Per Martin-Löf has developed an intuitionistic type theory (hence-forth type theory for short) as a constructive alternative to the usual foundation of mathematics based on classical set theory. We assume the reader is aware at least of the main peculiarities of type theory, as formulated in Martin-Löf 1984 or Nordström et al. 1990; here we recall some of them to be able to introduce our point of view. The form of type theory is that of a logical calculus, where inference rules to derive judgements are at the same time set-theoretic constructions, because of the “propositions-as-sets” interpretation. The spirit of type theory—expressing our interpretation in a single sentence-—is to adopt those notions and rules which keep total control of the amount of information contained in the different forms of judgement. We now briefly justify this claim. First of all, the judgement asserting the truth of a proposition A, which from an intuitionistic point of view means the existence of a verification of A, in type theory is replaced by the judgement a ∈ A which explicitly exhibits a verification a of A. In fact, it would be unwise, for a constructivist, to throw away the specific verification of A which must be known to be able to assert the existence of a verification! The judgement that A is a set, which from an intuitionistic point of view means that there exists an inductive presentation of A, is treated in type theory in a quite similar way (even if in this case no notation analogous to a ∈ A is used) since the judgement A set in type theory becomes explicit knowledge of the specific inductive presentation of A. In fact, the rules for primitive types and for type constructors are so devised that whenever a judgement A set is proved, it means that one also has complete information on the rules which describe how canonical elements of A are formed. Such a property, which might look like a peculiarity of type theory, is as a matter of fact necessary in order to give a coherent constructive treatment of quantifiers.

scholarly journals Prediction of Cyclists Movement in Different Terrain Conditions

2018 ◽  
Vol 152 ◽  
pp. 03003
Author(s):  
Mahesh A/L V.Nagarrettinam ◽  
Aravind CV ◽  
Mohsen Nabi Poor
Keyword(s):  
Point Of View ◽  
Body Tilt ◽  
Data Logger ◽  
Rule Based ◽  
The Road ◽  
Additional Illumination ◽  
The Government ◽  
On The Road ◽  
The Time Domain ◽  
Free Environment

In Malaysia, most of the accidents involving a bicycle and another vehicle are due to either the driver or rider ‘failing to look properly’. This is more significant with the government initiatives to support the use of bicycle making the carbon-free environment, a vision of TN50. This research addresses the safety aspect of the cyclists in terms of the driver’s point of view which improves cyclist visibility during driving. The proposed helmet system implements a rule-based algorithm which predicts the turning and braking movement of the cyclists. With this system, additional illumination and signaling are provided for the cyclists. The major challenge faced is the implementation of an algorithm for various situations of cycling. To ensure the system could be used on the road, the accuracy and speed of the automatic signaling system need to adhere. Situations that affects the output of the indicators include bicycle speed, the angle of turning, body tilt, duration of turn and random body movements. This paper implements a 3-axis accelerometer and a microcontroller in a data logger to acquire the required data which are analyzed in MATLAB. Using filtering technique, the acquired data are then be cleaned to remove noise due to vibration during cycling. The characteristics of braking and turning are then analyzed in the time domain as well as frequency domain to ensure the optimum algorithm used for gesture recognition and movement prediction. The algorithm is based on sliding window, FFT and threshold-based rule algorithm. The output based on the rule-based algorithm then illuminate the corresponding signals which provide the safety feature of the system.

Rule-Based Systems for Medical Diagnosis

Fuzzy Systems ◽  
2017 ◽  
pp. 906-933
Author(s):  
V. S. Giridhar Akula
Keyword(s):  
Fuzzy Logic ◽  
Decision Support ◽  
Support System ◽  
Medical Diagnosis ◽  
Intelligent Systems ◽  
Inference Rules ◽  
Rule Based ◽  
Rule Based System ◽  
Fault Monitoring ◽  
Design Scheduling

A rule-based system is a set of “if-then” statements that uses a set of assertions, to which rules on how to act upon those assertions are created. Rule-based expert systems have played an important role in modern intelligent systems and their applications in strategic goal setting, planning, design, scheduling, fault monitoring, diagnosis, and so on. The theory of decision support system is explained in detail. This chapter explains how the concepts of fuzzy logic are used for forward and backward chaining. Patient data is analyzed with the help of inference rules.

Sign in / Sign up

Export Citation Format

Share Document