Hannes Strass’s research while affiliated with TU Dresden and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (62)


RFuzzy: Syntax, semantics and implementation details of a simple and expressive fuzzy tool over Prolog
  • Article

May 2011

·

86 Reads

·

30 Citations

Information Sciences

·

·

Hannes Strass

We present the RFuzzy framework, a Prolog-based tool for representing and reasoning with fuzzy information. The advantages of our framework in comparison to previous tools along this line of research are its easy, user-friendly syntax, and its expressivity through the availability of default values and types.In this approach we describe the formal syntax, the operational semantics and the declarative semantics of RFuzzy (based on a lattice). A least model semantics, a least fixpoint semantics and an operational semantics are introduced and their equivalence is proven. We provide a real implementation that is free and available. (It can be downloaded from http://babel.ls.fi.upm.es/software/rfuzzy/.) Besides implementation details, we also discuss some actual applications using RFuzzy.


How to Plan When Being Deliberately Misled.
  • Conference Paper
  • Full-text available

January 2011

·

75 Reads

·

1 Citation

Reasoning agents are often faced with the need to robustly deal with erroneous information. When a robot given the task of returning with the red cup from the kitchen table arrives in the kitchen to find no red cup but instead notices a blue cup and a red plate on the table, what should it do? The best course of action is to attempt to salvage the situation by relying on its preferences to return with one of the objects available. We provide a solution to this problem using the Situation Calculus extended with a notion of belief. We then provide an efficient practical implementation by mapping this formalism into default rules for which we have an implemented solver.

Download

State Defaults and Ramifications in the Unifying Action Calculus.

January 2010

·

52 Reads

·

13 Citations

·

·

Hannes Strass

·

[...]

·

We present a framework for reasoning about actions that not only solves the frame and ramification problems, but also the state default problem-the problem to determine what normally holds at a given time point. Yet, the framework is general enough not to be tied to a specific time structure. This is achieved as follows: We use effect axioms that draw ideas both from Reiter's successor state axioms and the nonmonotonic causal theories by Giunchiglia et al. These axioms are formulated in a recently proposed unifying action calculus to guarantee independence of a specific underlying notion of time. Reiter's default logic is then wrapped around the resulting calculus and plays a key role in solving the ramification as well as the state default problem. Copyright © 2010, Association for the Advancement of Artificial Intelligence.


Simple Default Reasoning in Theories of Action

December 2009

·

11 Reads

·

1 Citation

Lecture Notes in Computer Science

We extend a recent approach to integrate action formalisms and non-monotonic reasoning. The resulting framework allows an agent employing an action theory as internal world model to make useful default assumptions. While the previous approach only allowed for modeling static defaults, that are independent of state properties, our extension allows for the expression of dynamic defaults. Problems that arise due to the interaction of defaults with the solution of the frame problem are dealt with accordingly: we devise a general method of integrating defaults into the formal representation of action effects and show that the method prevents counter-intuitive conclusions.


On Defaults in Action Theories

September 2009

·

13 Reads

·

2 Citations

Lecture Notes in Computer Science

We study the integration of two prominent elds of logic- based AI: action formalisms and non-monotonic reasoning. The resulting framework allows an agent employing an action theory as internal world model to make useful default assumptions. We show that the mechanism behaves properly in the sense that all intuitively possible conclusions can be drawn and no implausible inferences arise. In particular, it suces to make default assumptions only once (in the initial state) to solve projection problems.


RFuzzy∔A framework for multi-adjoint Fuzzy Logic Programming

July 2009

·

47 Reads

·

5 Citations

Annual Conference of the North American Fuzzy Information Processing Society - NAFIPS

Fuzzy Logic Programming aims at combining the advantages of Logic Programming (such as readability, conciseness, and a formally well-defined semantics) with the advantages of Fuzzy Logic (representability of imprecise and uncertain knowledge). In this paper, we present the RFuzzy framework for Fuzzy Logic Programming. It has three main advantages compared to other Fuzzy Logic Programming frameworks: RFuzzy provides constructive answers (it responds with direct results instead of constraints), models multi-adjoint logic, and allows the user1 to combine fuzzy and crisp reasoning in the same program. It provides some extensions such as default values (to represent missing information) and typed predicates. The truth values of predicates are defined via facts, rules, and functions. We describe the implementation of our framework and its operational semantics. RFuzzy has been implemented and is ready for being used2.


Fig. 1. Teenager truth value continuous representation
Fig. 2. RFuzzy architecture
RFuzzy: An Expressive Simple Fuzzy Compiler

June 2009

·

253 Reads

·

9 Citations

Lecture Notes in Computer Science

Fuzzy reasoning is a very productive research field that during the last years has provided a number of theoretical approaches and practical implementation prototypes. Nevertheless, the classical implementations, like Fril, are not adapted to the latest formal approaches, like multi-adjoint logic semantics. Some promising implementations, like Fuzzy Prolog, are so general that the regular user/programmer does not feel comfortable because either the representation of fuzzy concepts is complex or the results of the fuzzy queries are difficult to interpret. In this paper we present a modern framework, RFuzzy, that is modeling multi-adjoint logic in a practical way. It provides some extensions as default values (to represent missing information), partial default values (for a subset of data) and typed variables. RFuzzy represents the truth value of predicates using facts, rules and also can define fuzzy predicates as continuous functions. Queries are answered with direct results (instead of providing complex constraints), so it is easy to use for any person that wants to represent a problem using fuzzy reasoning in a simple way (just using the classical fuzzy representation with real numbers). The most promising characteristic of RFuzzy is that the user can obtain constructive answers to queries that restrict the truth value.


Fig. 1. Teenager credibility.
Rfuzzy framework

April 2009

·

158 Reads

Fuzzy reasoning is a very productive research field that during the last years has provided a number of theoretical approaches and practical implementation prototypes. Nevertheless, the classical implementations, like Fril, are not adapted to the latest formal approaches, like multi-adjoint logic semantics. Some promising implementations, like Fuzzy Prolog, are so general that the regular user/programmer does not feel comfortable because either representation of fuzzy concepts is complex or the results difficult to interpret. In this paper we present a modern framework, Rfuzzy, that is modelling multi-adjoint logic. It provides some extensions as default values (to represent missing information, even partial default values) and typed variables. Rfuzzy represents the truth value of predicates through facts, rules and functions. Rfuzzy answers queries with direct results (instead of constraints) and it is easy to use for any person that wants to represent a problem using fuzzy reasoning in a simple way (by using the classical representation with real numbers).


Operational Semantics for a Fuzzy Logic Programming System with Defaults and Constructive Answers.

January 2009

·

34 Reads

·

8 Citations

In this paper we present the operational semantics of RFuzzy, a fuzzy Logic Programming framework that represents thruth values using real numbers from the unit interval. RFuzzy pro- vides some useful extensions: default values to represent missing in- formation, and typed terms to intuitively restrict predicate domains. Together, they allow the system to give constructive answers in addi- tion to truth values. RFuzzy does not confine to a particular Fuzzy Logic, but aims at being as general as possible by using the notion of aggregation operators.


Defaults in Action: Non-monotonic Reasoning About States in Action Calculi

January 2009

·

13 Reads

We propose a mechanism for default reasoning in action for-malisms that allows to make useful assumptions unless infor-mation to the contrary. The mechanism is shown to behave properly when actions are performed, in particular we show that it suffices to apply defaults to the initial state. This allows for very simple reasoning, since the defaults need only be ap-plied once and monotonic entailment can thence be used to solve projection problems. We finally consider two simple, natural generalizations of the approach and show that they admit unintuitive conclusions, thereby pointing out directions for further research.


Citations (41)


... Declarative rule languages are central to knowledge representation and reasoning (KRR), be it as the foundation of logic programming (Körner et al. 2022;Calimeri et al. 2020), as a design principle for ontology languages (ter Horst 2005; Motik et al. 2009;Krötzsch, Rudolph, and Hitzler 2013), or merely as a computational framework for reasoning (Gómez Álvarez, Rudolph, and Strass 2023;Simančík, Kazakov, and Horrocks 2011;Krötzsch 2011). Indeed, few logical paradigms embody such harmony of intuitive meaning, formal semantics, and practical execution. ...

Reference:

Nemo: Your Friendly and Versatile Rule Reasoning Toolkit
Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+
  • Citing Conference Paper
  • September 2023

... Despite the PTIME translation, it remains to be seen if this approach performs well in practical cases. An alternative would be to devise a quasimodel-based tableau algorithm along the lines of (Wolter and Zakharyaschev 1998;Gómez Álvarez, Rudolph, and Strass 2023b), yet this would be a challenging endeavour since it requires the implementation of a tailored reasoner. ...

Tractable Diversity: Scalable Multiperspective Ontology Management via Standpoint EL
  • Citing Conference Paper
  • August 2023

... In contrast to our work, those views limit the model to certain aspects that are relevant in it but do not modify the underlying facts or assumptions based on the view taken. More similar to our work are approaches of ontology integration [42] and specialized description logics allowing for reasoning with different ontology vocabularies (e.g., [43,44,45]). The difference of those works to our approach is that information fusion in our model seeks sufficient agreement between different viewpoints, in order to aggregate knowledge graphs representing the different viewpoints. ...

How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic

Lecture Notes in Computer Science

... In the case of bipolarity of ADFs, the focus is on attacking and supporting relations between arguments, which are represented by bipolar acceptance conditions. Bipolar ADFs were first introduced by [18], and have been investigated to quite some depth later on regarding complexity issues [18,69], relations to other argumentation formalisms [61], number of bipolar acceptance conditions [7], importing ideas of bipolarity of ADFs to logic programming [4], studying expressivity of bipolar ADFs [51,66], and bipolarity was used in investigations of admissibility [62]. More generally, bipolarity in formal argumentation has, likewise, received attention from the community [21]. ...

Boolean Functions with Ordered Domains in Answer Set Programming
  • Citing Article
  • February 2016

Proceedings of the AAAI Conference on Artificial Intelligence

... The additional expressive power is achieved by adding acceptance conditions to the arguments which allow for the specification of more complex relationships between them. Of particular interest might be the subclass of bipolar ADFs (BADFs) which are as complex as AFs while arguably offering more modelling capabilities (Brewka, Ellmauthaler, Strass, Wallner, & Woltran, 2017;Straß & Wallner, 2015;Baumann & Heinrich, 2023). It is one highly relevant future task to investigate notions of forgetting in these more expressive argumentation formalisms. ...

Weighted Abstract Dialectical Frameworks
  • Citing Article
  • April 2018

Proceedings of the AAAI Conference on Artificial Intelligence

... Now let us turn to strong equivalence [25,13], i.e. how to decide whether two AFs are interchangeable in any given context without changing the semantics. More formally, in case of a labelling-based semantics L σ , two AFs F and G are strongly equivalent (denoted as F ≡ Lσ s G) if and only if L σ (F ⊔ H ) = L σ (G ⊔ H ) for any further AF H . ...

An Abstract, Logical Approach to Characterizing Strong Equivalence in Non-monotonic Knowledge Representation Formalisms

Artificial Intelligence

... Conditional independence has been investigated in several other logic-based frameworks, such as (iterated) belief revision (Lynn, Delgrande, and Peppas, 2022;Kern-Isberner, Heyninck, and Beierle, 2022), conditional logics (Heyninck, Kern-Isberner, and Meyer, 2022) and formal argumentation (Rienstra et al., 2020;Gaggl, Rudolph, and Strass, 2021). The benefit of our work is that the algebraic nature allows for the straightforward application to other formalisms with a fixpoint semantics. ...

On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
  • Citing Article
  • January 2021

Journal of Artificial Intelligence Research

... One approach to reasoning in ASPIC + consists of first explicitly constructing arguments from these building blocks, which gives rise to a corresponding abstract argumentation framework (Modgil and Prakken 2013), and then reasoning over the abstract argumentation framework in order to decide whether the conclusions of interest can be drawn (Dung 1995). However, this two-step approach is cumbersome in both theory and practice (Lehtonen, Wallner, and Järvisalo 2020) as the first step of argument construction may give rise to an exponentially larger abstract framework (Strass, Wyner, and Diller 2019). This makes it challenging to establish complexity results for ASPIC + reasoning and to develop practical algorithms. ...

EMIL: Extracting Meaning from Inconsistent Language
  • Citing Article
  • May 2019

International Journal of Approximate Reasoning

... That is, we may view φ as an independent module of Φ. Within the KR community it is folklore that this is usually not the case for non-monotonic logics (apart from folklore, we refer the reader to (Baumann and Strass 2016) for a rigorous study of this matter). ...

An Abstract Logical Approach to Characterizing Strong Equivalence in Logic-based Knowledge Representation Formalisms

... However, by definition of Boolean network, the acceptance condition of an argument depends on all the parents of that argument. Hence, contingency (11) To see this, assume that φ b depends on a, and observe that φ b is not anti-monotone on a The fact that we can transit from monotonicity to derivation through negation suggests considering strict interactions (used, for instance, in [16]) so that strict monotonicity is equivalent to the strictly positive derivative. We thus get: ...

On the number of bipolar Boolean functions

Journal of Logic and Computation