![]() ; ; Steen, Alexander ![]() in Recht DIGITAL – 25 Jahre IRIS, Proceedings of the International Legal Informatics Symposium (IRIS 2022) (in press) Die Interpretation und Anwendung von Gesetzestexten auf einem konkreten Lebenssachverhalt erfordert von menschlichen Experten ein hohes Maß an Wissen, Erfahrung und die Fähigkeit zahlreiche kontextuelle ... [more ▼] Die Interpretation und Anwendung von Gesetzestexten auf einem konkreten Lebenssachverhalt erfordert von menschlichen Experten ein hohes Maß an Wissen, Erfahrung und die Fähigkeit zahlreiche kontextuelle Überlegungen anzustellen. Die Formalisierung und Automatisierung solch eines Prozesses in einem computergestützten Verfahren muss dies entsprechend reflektieren. Ausgehend von einer Fallstudie werden in dieser Arbeit erforderliche juridische Schritte der Rechtsanwendung identifiziert und verschiedenen Objekt- und Meta-Ebenen zugeordnet. Diese Zuordnung erlaubt eine abstrakte Analyse von Softwareanforderungen, die juristische Assistenzsysteme erfüllen müssen, um bei juristischen Fallentscheidungen unterstützen zu können. [less ▲] Detailed reference viewed: 70 (1 UL)![]() ; Steen, Alexander ![]() Article for general public (2021) Detailed reference viewed: 25 (1 UL)![]() Steen, Alexander ![]() ![]() E-print/Working paper (2021) We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of ... [more ▼] We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools. This enables the formal analysis and verification of meta-theoretical properties as well as the flexible generation of extensions and labellings with respect to well-known argumentation semantics. [less ▲] Detailed reference viewed: 121 (4 UL)![]() Steen, Alexander ![]() ![]() in Journal of Automated Reasoning (2021), 65 Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based proof search to higher ... [more ▼] Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based proof search to higher-order logic. The prover may cooperate with multiple external specialist reasoning systems such as first-order provers and SMT solvers. Leo-III is compatible with the TPTP/TSTP framework for input formats, reporting results and proofs, and standardized communication between reasoning systems, enabling e.g. proof reconstruction from within proof assistants such as Isabelle/HOL. Leo-III supports reasoning in polymorphic first-order and higher-order logic, in all normal quantified modal logics, as well as in different deontic logics. Its development had initiated the ongoing extension of the TPTP infrastructure to reasoning within non-classical logics. [less ▲] Detailed reference viewed: 72 (1 UL)![]() Steen, Alexander ![]() Software (2021) rio provides a TPTP-aligned [3] automated reasoning system for unconstrained and constrained I/O logics basid on the outi operators, 1 ≤ i ≤ 4. It is implemented as a Scala application and based on the ... [more ▼] rio provides a TPTP-aligned [3] automated reasoning system for unconstrained and constrained I/O logics basid on the outi operators, 1 ≤ i ≤ 4. It is implemented as a Scala application and based on the scala-tptp-parser [4]. In short, the system allows you to specify a set of conditional norms and a number of inputs (each of which describing aspects of the current situational context), and provides automated means for inferring whether given obligations (also encoded as formulas) can be derived. rio can also be used to infer the set of detached obligations instead of checking detachment of given ones. [less ▲] Detailed reference viewed: 83 (3 UL)![]() Steen, Alexander ![]() Software (2021) scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the ... [more ▼] scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, the parser supports: - THF (TH0/TH1): Monomorphic and polymorphic higher-order logic, - TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, - FOF: Untyped first-order logic, - CNF: (Untyped) clause-normal form, and - TPI: TPTP Process Instruction language. [less ▲] Detailed reference viewed: 83 (6 UL)![]() Fuenmayor Pelaez, David ![]() ![]() in First International Workshop on Logics for New-Generation Artificial Intelligence (2021) Argumentation frameworks constitute the central concept of argumentation theory of Dung. In this paper we present a novel and flexible approach of analyzing argumen- tation frameworks and their semantics ... [more ▼] Argumentation frameworks constitute the central concept of argumentation theory of Dung. In this paper we present a novel and flexible approach of analyzing argumen- tation frameworks and their semantics based on an encoding into extensional type theory (classical higher-order logic). This representation enables the use of a wide range of interactive and automated higher-order reasoning tools for assessing argu- mentation frameworks. This includes the generation of labellings (and extensions), the assessment of meta-theoretic properties, the conduction of interactive empirical experiments, and the flexible analysis of argumentation frameworks with interpreted arguments. [less ▲] Detailed reference viewed: 100 (1 UL)![]() Steen, Alexander ![]() in Marra, Alessandra; Liu, Fenrong; Portner, Paul (Eds.) et al Deontic Logic and Normative Systems: 15th International Conference (DEON 2020/2021) (2021) Input/Output (I/O) logics address the abstract study of conditional norms. Here, norms are represented as pairs of formulas instead of statements that themselves carry truth-values. I/O logics have been ... [more ▼] Input/Output (I/O) logics address the abstract study of conditional norms. Here, norms are represented as pairs of formulas instead of statements that themselves carry truth-values. I/O logics have been studied thoroughly in the past, including further applications and refinements. In this paper, a class of automated reasoning procedures is presented that, given a set of norms and a concrete situation, decide whether a specific state of affairs is obligatory according to the output operations of I/O logics. The procedures are parametric in the underlying logical formalism and can be instantiated with different classical objects logics, such as propositional logic or first-order logic. The procedures are shown to be correct, and a proof-of-concept implementation for propositional I/O logics is surveyed. [less ▲] Detailed reference viewed: 127 (6 UL)![]() Benzmüller, Christoph ![]() ![]() in Data in Brief (2020), 33 The LogiKEy workbench and dataset for ethical and legal reasoning is presented. This workbench simultaneously supports development, experimentation, assessment and deployment of formal logics and ethical ... [more ▼] The LogiKEy workbench and dataset for ethical and legal reasoning is presented. This workbench simultaneously supports development, experimentation, assessment and deployment of formal logics and ethical and legal theories at different conceptual layers. More concretely, it comprises, in form of a dataset (Isabelle/HOL theory files), formal encodings of multiple deontic logics, logic combinations, deontic paradoxes and normative theories in the higher-order proof assistant system Isabelle/HOL. The data were acquired through application of the LogiKEy methodology, which supports experimentation with different normative theories, in different application scenarios, and which is not tied to specific logics or logic combinations. Our workbench consolidates related research contributions of the authors and it may serve as a starting point for further studies and experiments in flexible and expressive ethical and legal reasoning. It may also support hands-on teaching of non-trivial logic formalisms in lecture courses and tutorials. [less ▲] Detailed reference viewed: 164 (6 UL)![]() Steen, Alexander ![]() ![]() in Proceedings of the 24th European Conference on Artificial Intelligence (2020, August) Leo-III is an effective automated theorem prover for extensional type theory with Henkin semantics. It is based on an extensional higher-order paramodulation calculus and supports reasoning in monomorphic ... [more ▼] Leo-III is an effective automated theorem prover for extensional type theory with Henkin semantics. It is based on an extensional higher-order paramodulation calculus and supports reasoning in monomorphic and rank-1 polymorphic first-order and higher-order logics. Leo-III also automates various non-classical logics, including almost every normal higher-order modal logic. [less ▲] Detailed reference viewed: 72 (1 UL)![]() Steen, Alexander ![]() Software (2020) Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all common TPTP dialects, including THF, TFF and FOF as well as their rank-1 polymorphic derivatives. It is based ... [more ▼] Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all common TPTP dialects, including THF, TFF and FOF as well as their rank-1 polymorphic derivatives. It is based on a paramodulation calculus with ordering constraints and, in tradition of its predecessor LEO-II, heavily relies on cooperation with external (mostly first-order) theorem provers for increased performance. Nevertheless, Leo-III can also be used as a stand-alone prover without employing any external cooperation. In addition for its HOL reasoning capabilities, Leo-III supports reasoning in many higher-order quantified modal logics. [less ▲] Detailed reference viewed: 35 (4 UL)![]() Libal, Tomer ![]() ![]() in Jusletter IT (2020), 27 Mai 2020 A prototype for automated reasoning over legal documents, called NAI, is presented. It uses formalized representations of legal documents that are created using a graphical editor that is also provided as ... [more ▼] A prototype for automated reasoning over legal documents, called NAI, is presented. It uses formalized representations of legal documents that are created using a graphical editor that is also provided as part of NAI. The prototype supports several automated reasoning procedures over the given formalizations, including the execution of user queries. The application of NAI is studied using a fragment of the Scottish Smoking Prohibition (Children in Motor Vehicles) Act 2016. [less ▲] Detailed reference viewed: 129 (4 UL)![]() Steen, Alexander ![]() Software (2020) The I/O Logic Workbench is aimed at providing a browser-based automated reasoning system for various I/O logics. In short, the system allows you to input a set of norms and an input (the description of ... [more ▼] The I/O Logic Workbench is aimed at providing a browser-based automated reasoning system for various I/O logics. In short, the system allows you to input a set of norms and an input (the description of the current situation), and provides automated means for inferring whether a certain formula can be derived as an obligation from this. [less ▲] Detailed reference viewed: 84 (2 UL)![]() Steen, Alexander ![]() ![]() E-print/Working paper (2020) Detailed reference viewed: 103 (3 UL)![]() Libal, Tomer ![]() ![]() in Dastani, Mehdi; Dong, Huimin; van der Torre, Leon (Eds.) Logic and Argumentation. CLAR 2020 (2020, March) A methodology for the formalization of legal texts is presented. This methodology is based on features of the NAI Suite, a recently developed formalization environment for legal texts. The ability of the ... [more ▼] A methodology for the formalization of legal texts is presented. This methodology is based on features of the NAI Suite, a recently developed formalization environment for legal texts. The ability of the tool to execute queries is used in order to drive a correct formalization until all queries are validated. The approach is studied on a fragment of the Smoking Prohibition (Children in Motor Vehicles) (Scotland) Act 2016 of the Scottish Parliament. [less ▲] Detailed reference viewed: 93 (2 UL)![]() Libal, Tomer ![]() ![]() in Schweighöfer, Erich; Hötzendorfer, Walter; Kummer, Franz (Eds.) et al Verantwortungsbewusste Digitalisierung, Tagungsband des 23. Internationalen Rechtsinformatik Symposions IRIS 2020 (2020, February 27) A prototype for automated reasoning over legal documents, called NAI, is presented. It uses formalized representations of legal documents that are created using a graphical editor that is also provided as ... [more ▼] A prototype for automated reasoning over legal documents, called NAI, is presented. It uses formalized representations of legal documents that are created using a graphical editor that is also provided as part of NAI. The prototype supports several automated reasoning procedures over the given formalizations, including the execution of user queries. The application of NAI is studied using a fragment of the Scottish Smoking Prohibition (Children in Motor Vehicles) Act 2016. [less ▲] Detailed reference viewed: 147 (19 UL)![]() Steen, Alexander ![]() in KI – Künstliche Intelligenz (2020), 34(1), 105-108 Detailed reference viewed: 147 (8 UL)![]() Benzmüller, Christoph ![]() ![]() Poster (2019, November) Detailed reference viewed: 53 (1 UL)![]() ; Steen, Alexander ![]() Scientific Conference (2019, September 23) The annual meeting Deduktionstreffen is the prime activity of the Special Interest Group on Deduction Systems (FG DedSys) of the AI Section of the German Society for Informatics (GI-FBKI). It is a meeting ... [more ▼] The annual meeting Deduktionstreffen is the prime activity of the Special Interest Group on Deduction Systems (FG DedSys) of the AI Section of the German Society for Informatics (GI-FBKI). It is a meeting with a familiar, friendly atmosphere, where everyone interested in deduction can report on their work in an informal setting. [less ▲] Detailed reference viewed: 66 (3 UL) |
||