3,014 research outputs found
A Computational Framework for Formalizing Rules and Managing Changes in Normative Systems
No full textLegal texts are typically written in a natural language. However, a legal text that is written in a formal language has the advantage of being subject to automation, at least partially. Such a translation is not easy, and the matter is even more complex because the law changes with time, so if we formalized a legal text that was originally written in natural language, there is a need to keep track of the change. This thesis proposes original developments on these subjects. In order to formalize a legal document, we provide a pipeline for the translation of a legal text from natural to formal language and we apply it to the case of natural resources contracts. In general, adjectives play an important role in a text and they allow to characterize it: for this reason we developed a logical system aimed at reasoning with gradable adjectives. Regarding norm change, we provide an ontology to represent change in a normative system, some basic mechanisms by which an agent may acquire new norms, and a study on the problem of revising a defeasible theory by only changing its facts. Another contribution of this thesis is a general framework for revision that includes the previous points as specific cases
Anti-skid surface
No full textIl brevetto concerne un dispositivo idoneo all'ottimizzazione delle caratteristiche di resistenza allo scivolamento del piano carrabile (stradale o aeroportuale) finalizzato a incrementare la sicurezza di circolazione e ridurre i tempi di arrest
An assessment of the impact of possible CAP reform scenarios on Romanian agriculture
No full textUsing a simplified model, with key-variable the prices of two different possible scenarios of CAP reform after 2013 (moderate and radical), this paper present a comparison between the price effects of implementation of each reform scenario at 2015 horizon on Romanian agriculture. This short analysis shows that, under the presented hypotheses, the net welfare effect, due to the price changes, for the selected products, is positive in both reform scenarios, yet greater in the case of the radical reform. Integrated in the large context of Romanian development, it seems that the influence of CAP reform upon agriculture and rural areas will be most likely a gradual one: an interpenetration between the two scenarios is foreseeable, starting with the moderate reform that will dominate the period around 2013, the reform measures acquiring a more radical character afterwards.CAP reform, Romania, welfare effects, Agricultural and Food Policy,
Hybrid Reinforcement (Rebars + Fibers) for elevated slabs
No full textWhen designing Fiber Reinforced Concrete (FRC) structures, one of the basic issues is represented by
the choice of a proper combination of fibers and conventional reinforcement that allows to obtain the
best structural performance with the minimum amount of materials. The combination of rebars and
fibers in the concrete matrix is generally known as Hybrid Reinforced Concrete (HRC). HRC represents
a feasible solution in many structures; among these, slabs are gaining an increasing interest among
practitioners. In fact, slabs are the most widespread structural elements in common practice since they
are typically used to construct industrial floors (slab on grade), foundations (slab on piles) or floors
(elevated slabs).
This paper focuses on the design of FRC elevated slabs by using the most recent design provisions
reported in the fib Model Code 2010. Emphasis will be given at the use of HRC for optimizing the slab
reinforcement. In more detail, the results of a parametric study performed to design the Hybrid
Reinforcement for elevated slabs will be presented and discussed and a procedure for designing the
Hybrid Reinforcement will be proposed and verified by nonlinear finite element analyses
Rich, Sturmian, and trapezoidal words
No full textIn this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors. Every finite Sturmian word is rich, but not conversely. Trapezoidal words were first introduced by the first author in studying the behavior of the subword complexity of finite Sturmian words. Unfortunately this property does not characterize finite Sturmian words. In this note we show that the only trapezoidal palindromes are Sturmian. More generally we show that Sturmian palindromes can be characterized either in terms of their subword complexity (the trapezoidal property) or in terms of their palindromic complexity. We also obtain a similar characterization of rich palindromes in terms of a relation between palindromic complexity and subword complexity
Classification Rules Explain Machine Learning
No full textWe introduce a general model for explainable Artificial Intelligence that identifies an explanation of a Machine Learning method by classification rules. We define a notion of distance between two Machine Learning methods, and provide a method that computes a set of classification rules that, in turn, approximates another black box method to a given extent. We further build upon this method an anytime algorithm that returns the best approximation it can compute within a given interval of time. This anytime method returns the minimum and maximum difference in terms of approximation provided by the algorithm and uses it to determine whether the obtained approximation is acceptable. We then illustrate the results of a few experiments on three different datasets that show certain properties of the approximations that should be considered while modelling such systems. On top of this, we design a methodology for constructing approximations for ML, that we compare to the no-methods approach typically used in current studies on the explainable artificial intelligence topic
Extraction of Defeasible Proofs as Explanations
No full textHoudini is a Defeasible Deontic Logic reasoner that has been recently developed in Java. The algorithm employed in Houdini follows the proof conditions of the logic to conclude propositional and deontic literals, and is an efficient solution that provides the full extension of a theory. This computation is made in a forward-chaining complete way. Effectiveness is a fundamental property of the adopted approach, but we are also interested in providing an explicit reference to the reasoning that is employed to reach a conclusion. This reasoning is a proof that corresponds to an explanation for that conclusion, and such a proof is less natural to identify in a non-monotonic framework like Defeasible Logic than it would be in a classical one. Depending on the formalism and on the algorithm, the process of reconstructing a proof from a derived conclusion can be cumbersome. Intuitively, a proof consists of a support argument in favour of a literal to be concluded. However, it is necessary also to show that this argument is strong enough, either because the are no arguments against it, or because those arguments are weaker than it. In this paper, with a slight modification of the algorithm of Houdini, we show that it is possible to extract a proof for a defeasible literal in polynomial time, and that such a proof results minimal in its depth
Text Analytics Can Predict Contract Fairness, Transparency and Applicability
No full textThere is a growing attention, in the research communities of political economics, onto the potential of text analytics in classifying documents with economic content. This interest extends the data analytics approach that has been the traditional base for economic theory with scientific perspective. To devise a general method for prediction applicability, we identify some phases of a methodology and perform tests on a large well-structured repository of resource contracts containing documents related to resources. The majority of these contracts involve mining resources. In this paper we prove that, by the usage of text analytics measures, we can cluster these documents on three indicators: fairness of the contract content, transparency of the document themselves, and applicability of the clauses of the contract intended to guarantee execution on an international basis. We achieve these results, consistent with a gold-standard test obtained with human experts, using text similarity b ased on the basic notions of bag of words, the index tf-idf, and three distinct cut-off measures
Characterization Results for the Poset Based Representation of Topological Relations - I: Introduction and Models
No full text@article{DBLP:journals/informaticaSI/ForlizziN99,
author = {Luca Forlizzi and
Enrico Nardelli},
title = {Characterization Results for the Poset Based Representation
of Topological Relations - I: Introduction and Models.},
journal = {Informatica (Slovenia)},
volume = {23},
number = {2},
year = {1999},
bibsource = {DBLP, http://dblp.uni-trier.de}
Characterization Results for the Poset Based Representation of Topological Relations - II: Intersection and Union
No full text@article{DBLP:journals/informaticaSI/ForlizziN00,
author = {Luca Forlizzi and
Enrico Nardelli},
title = {Characterization Results for the Poset Based Representation
of Topological Relations - II: Intersection and Union.},
journal = {Informatica (Slovenia)},
volume = {24},
number = {1},
year = {2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
- …
