liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 33 of 33
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Andersson, Robin
    et al.
    Vitoria, Aida
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Komorowski, Henryk Jan
    RoSy: A Rough Knowledge Base System2005In: Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing,2005, Berlin: Springer , 2005, p. 48-Conference paper (Refereed)
  • 2.
    Assmann, Uwe
    et al.
    Linköping University, Department of Computer and Information Science, PELAB - Programming Environment Laboratory. Linköping University, The Institute of Technology.
    Henriksson, Jakob
    Technical University of Dresden, Germany.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Combining safe rules and ontologies by interfacing of reasoners2006In: Principles and Practice of Semantic Web Reasoning 4th International Workshop, PPSWR 2006, Budva, Montenegro, June 10-11, 2006, Revised Selected Papers / [ed] Jóse Júlio Alferes, James Bailey, Wolfgang May and Uta Schwertel, Springer Berlin/Heidelberg, 2006, Vol. 4187, p. 33-47Chapter in book (Refereed)
    Abstract [en]

    The paper presents a framework for hybrid combination of rule languages with constraint languages including but not restricted to Description-Logic-based ontology languages. It shows how reasoning in a combined language can be done by interfacing reasoners of the component languages. A prototype system based on the presented principle integrates Datalog with OWL by interfacing XSB Prolog [2] with a DIG-compliant [1] DL reasoner (e.g. Racer [17]).

  • 3. Baroglio, Cristina
    et al.
    Bonatti, Piero A.Maluszynski, JanLinköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.Marchiori, MassimoPolleres, AxelSchaffert, Sebastian
    Reasoning Web2008Collection (editor) (Other academic)
  • 4.
    Bry, F
    et al.
    Institut für Informatik Ludwig-Maximilians-Universität München.
    Henze, N
    IfIS - Institut für Informationssysteme IfIS - Institut für Informationssysteme.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Principles and Practice of Semantic Web Reasoning: international workshop, PPSWR 2003, Mumbai, India, December 8, 2003 : proceedings2003Book (Other academic)
    Abstract [en]

    This book constitutes the refereed proceedings of the International Workshop on Principles and Practice of Semantic Web Reasoning, PPSWR 2003, held in Mumbai, India in December 2003 as satellite meeting of ICLP 2003. The 13 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. The papers are organized in topical sections on foundations of semantic Web reasoning, reasoning in practice, query- and rule-languages, and semantics and knowledge representation.

  • 5.
    Bry, Francois
    et al.
    Ludwig-Maximilians-Universität Munchen.
    Drabent, Wlodzimierz
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    On Subtyping of Tree-Structured Data:  A Polynomial Approach2004In: Principles and Practice of Semantic Web Reasoning, Second International Workshop, PPSWR 2004, St. Malo, France, Springer , 2004, p. 1-18Conference paper (Refereed)
    Abstract [en]

    This paper discusses subtyping of tree-structured data encountered on the Web, e.g. XML and HTML data. Our long range objective is to define a type system for Web and/or Semantic Web query languages amenable to static type checking. We propose a type formalism motivated by XML Schema and accommodating two concepts of subtyping: inclusion subtyping (corresponding to XML Schema notion of type restriction) and extension subtyping (motivated by XML Schema's type extension). We present algorithms for checking both kinds of subtyping. The algorithms are polynomial if certain conditions are imposed on the type definitions, the conditions seem natural and not too restrictive.

  • 6.
    Bry, Francois
    et al.
    Ludwig-Maximilians-Universität München, Germany.
    Drabent, Wlodzimierz
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    On subtyping of tree-structured data: A polynomial approach2004In: Principles and Practice of Semantic Web Reasoning: Second International Workshop, PPSWR 2004, St. Malo, France, September 6-10, 2004. Proceedings / [ed] Hans Jürgen Ohlbach and Sebastian Schaffert, Springer, 2004, Vol. 3208, p. 1-18Chapter in book (Refereed)
    Abstract [en]

    This paper discusses subtyping of tree-structured data encountered on the Web, e.g. XML and HTML data. Our long range objective is to define a type system for Web and/or Semantic Web query languages amenable to static type checking. We propose a type formalism motivated by XML Schema and accommodating two concepts of subtyping: inclusion subtyping (corresponding to XML Schema notion of type restriction) and extension subtyping (motivated by XML Schema's type extension). We present algorithms for checking both kinds of subtyping. The algorithms are polynomial if certain conditions are imposed on the type definitions, the conditions seem natural and not too restrictive.

  • 7.
    Bry, Francois
    et al.
    n/a.
    Maluszynski, JanLinköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Semantic Techniques for the Web, The REWERSE Perspective2009Collection (editor) (Other (popular science, discussion, etc.))
  • 8.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Eiter, Thomas
    Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria.
    Ianni, Giovambattista
    Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria.
    Krennwallner, Thomas
    Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria.
    Lukasiewicz, Thomas
    Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Hybrid Reasoning with Rules and Ontologies2009In: Semantic Techniques for the Web, The REWERSE Perspective / [ed] Bry & Maluszynski, Berlin: pringer , 2009, p. 1-49Chapter in book (Other (popular science, discussion, etc.))
    Abstract [en]

    The purpose of this chapter is to report on work that has been done in the REWERSE project concerning hybrid reasoning with rules and ontologies. Two major streams of work have been pursued within REWERSE. They start from the predominant semantics of non-monotonic rules in logic programming. The one stream was an extension of non-monotonic logic programs under answer set semantics, with query interfaces to external knowledge sources. The other stream, in the spirit of the -log approach of enhanced deductive databases, was an extension of Datalog (with the well-founded semantics, which is predominant in the database area). The former stream led to so-called non-monotonic dl-programs and hex-programs, and the latter stream to hybrid well-founded semantics. Further variants and derivations of the formalisms (like a well-founded semantics for dl-programs, respecting probabilistic knowledge, priorities, etc.) have been conceived.

  • 9.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Henriksson, Jakob
    Technische Universität Dresden, Germany.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics2007In: Web Reasoning and Rule Systems: First International Conference, RR 2007, Innsbruck , Austria, June 7-8, 2007. Proceedings / [ed] Massimo Marchiori, Jeff Z. Pan and Christian deSainte Marie, Springer Berlin/Heidelberg, 2007, p. 348-357Chapter in book (Refereed)
    Abstract [en]

    The paper presents an architecture and implementation techniques for hybrid integration of normal clauses under well-founded semantics with ontologies specified in Description Logics. The described prototype uses XSB Prolog both for rule reasoning and for controlling communication with the ontology reasoner RacerPro. The query answering techniques for hybrid rules implemented in this prototype are sound wrt. the declarative semantics, extending the well-founded semantics of normal programs and are faithful wrt. FOL.

  • 10.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Hybrid Rules with Well-Founded Semantics2010In: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 25, no 1, p. 137-168Article in journal (Refereed)
    Abstract [en]

    A general framework is proposed for integration of rules and external first-order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive negation for logic programs. Hybrid rules are normal clauses extended with constraints in the bodies; constraints are certain formulae in the language of the external theory. A hybrid program consists of a set of hybrid rules and an external theory. Instances of the framework are obtained by specifying the class of external theories and the class of constraints. An example instance is integration of (non-disjunctive) Datalog with ontologies formalized in description logics. The paper defines a declarative semantics of hybrid programs and a goal-driven formal operational semantics. The latter can be seen as a generalization of SLS-resolution. It provides a basis for hybrid implementations combining Prolog with constraint solvers (such as ontology reasoners). Soundness of the operational semantics is proven. Sufficient conditions for decidability of the declarative semantics and for completeness of the operational semantics are given.

  • 11.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Well-Founded Semantics for Hybrid Rules2007In: Web Reasoning and Rule Systems: First International Conference, RR 2007, Innsbruck , Austria, June 7-8, 2007. Proceedings / [ed] Massimo Marchiori, Jeff Z. Pan and Christian deSainte Marie, Springer Berlin/Heidelberg, 2007, p. 1-15Chapter in book (Refereed)
    Abstract [en]

    The problem of integration of rules and ontologies is addressed in a general framework based on the well-founded semantics of normal logic programs and inspired by the ideas of Constraint Logic Programming (CLP). Hybrid rules are defined as normal clauses extended with constraints in the bodies. The constraints are formulae in a language of a first order theory defined by a set  of axioms. Instances of the framework are obtained by specifying a language of constraints and providing  . A hybrid program is a pair () where  is a finite set of hybrid rules. Thus integration of (non-disjunctive) Datalog with ontologies formalized in a Description Logic is covered as a special case. The paper defines a declarative semantics of hybrid programs and a formal operational semantics. The latter can be seen as an extension of SLS-resolution and provides a basis for hybrid implementations combining Prolog with constraint solvers. In the restricted case of positive rules, hybrid programs are formulae of FOL. In that case the declarative semantics reduces to the standard notion of logical consequence. The operational semantics is sound and it is complete for a restricted class of hybrid programs.

  • 12.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Pietrzak, Pawel
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Locating type errors in untyped CLP programs2000In: Analysis and Visualization Tools for Constraint Programming: Constraint Debugging / [ed] Pierre Deransart, Manuel V. Hermenegildo, Jan Małuszynski, Springer Berlin/Heidelberg, 2000, Vol. 1870, p. 121-150Chapter in book (Refereed)
    Abstract [en]

    This book is the first one entirely devoted to the topic of constraint debugging; it presents new approaches to debugging for the computational paradigm of constraint programming. The book is based on the European research project DiSCiPl. It consists of an introduction and three parts, each of them composed of several chapters. The introduction presents the DiSCiPl debugging methodology and explains how the technical chapters are related. The three parts on correctness debugging, performance debugging, and user cases offer a total of 13 consistenly written chapters

  • 13.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Pietrzak, Pawel
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Type-based diagnosis of CLP programs2000In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 30, no 4, p. 215-234Article in journal (Refereed)
    Abstract [en]

    The paper presents a diagnosis tool for CLP programs. It deals with partial correctness w.r.t. specifications which describe procedure calls and successes. The space of possible specifications is restricted to a kind of regular types; we propose a generalization of the concept of types used in so called descriptive typing of logic programs. In particular we distinguish ground types from those containing non-ground elements.

    The tool is able to automatically locate at compile time all errors in a program, this means all the clauses or clause prefixes responsible for the program being incorrect w.r.t. a given specification. The tool aids the user in constructing specifications incrementally; often a fragment of the specification is already sufficient to locate an error.

    Our prototype is specialized for the programming language CHIP, but the idea is applicable to any untyped CLP (and LP) language. We believe that the presented approach makes it possible to combine the advantages of typed and untyped programming languages.

  • 14.
    Drabent, Wlodzimierz
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Pietrzak, Pawel
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Using parametric set constraints for locating errors in CLP programs2002In: Theory and Practice of Logic Programming, ISSN 1471-0684, E-ISSN 1475-3081, Vol. 2, no 4-5, p. 549-610Article in journal (Refereed)
    Abstract [en]

    This paper introduces a framework of parametric descriptive directional types for Constraint Logic Programming (CLP). It proposes a method for locating type errors in CLP programs, and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving the correctness of logic programs to the case of parametric specifications. Set constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved, and the prototype debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.

  • 15. Eisinger, Norbert
    et al.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Reasoning Web 2005: First International Summer School 2005, MSIDA, Malta, July 25-29, 2005, Revised Lectures2005 (ed. 1)Book (Other academic)
    Abstract [en]

    This book presents thoroughly revised tutorial papers based on lectures given by leading researchers at the First Summer School on Reasoning Web in Msida, Malta, in July 2005. The objective is to provide a coherent introduction into Semantic Web methods and issues with a particular focus on reasonning.  The ten tutorial papers presented provide competent coverage of methods and issues of the Semantic Web, ontology languages and their relation to description logics, Web query languages, XML, RDF and topics maps, evolution and reactivity, personalization in the Semantic Web, rule modeling with UML, techniques in Web information extraction, employing ontologies to ease construction of software applications, and type checking for Web rule and query languages.

  • 16. Henriksson, Jacob
    et al.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Static Type-Checking of Datalog with Ontologies2004In: Principles and Practice of Semantic Web Reasoning,2004, Berlin: Springer Verlag , 2004, p. 76-Conference paper (Refereed)
  • 17.
    Henriksson, Jakob
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Static type-checking of Datalog with ontologies2004In: Principles and Practice of Semantic Web Reasoning: Second International Workshop, PPSWR 2004, St. Malo, France, September 6-10, 2004. Proceedings / [ed] Hans Jürgen Ohlbach and Sebastian Schaffert, Springer Berlin/Heidelberg, 2004, Vol. 3208, p. 76-89Chapter in book (Refereed)
    Abstract [en]

    We show how coupling of the emerging rule level of the Semantic Web to the existing ontology level can be achieved by static typing of web rules of a given application with classes of the ontology describing the application domain. This paper describes the principles and the implementation of a system that checks correctness of a given set of Datalog rules encoded in XML (according to the RuleML standard) wrt a type specification, where the Datalog predicates are typed with classes described by an OWL ontology. The type checker is based on a well-known verification technique for logic programs and employs the RACER reasoner for checking the verification conditions.

  • 18.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Integration of Rules and Ontologies2009In: Encyclopedia of Database Systems, Berlin: Springer , 2009, p. 1546-1551Chapter in book (Other (popular science, discussion, etc.))
  • 19.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    On Integrating Rules into the Semantic Web2003In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 86, no 3, p. 1-11Article in journal (Refereed)
  • 20.
    Maluszynski, Jan
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Bonnier, Staffan
    Linköping University.
    Boye, Johan
    Linköping University.
    Kågedal, Andreas
    Linköping University.
    Kluzniak, Feliks
    Linköping University.
    Nilsson, Ulf
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Logic Programs with External Procedures1993In: Logic programming languages / [ed] Apt, K. R. and de Bakker, J. W. and Rutten, J. K. M. M., Cambridge, MA, USA: MIT Press , 1993, p. 21-48Chapter in book (Refereed)
  • 21.
    Maluszynski, Jan
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Szalas, Andrzej
    Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
    Living with Inconsistency and Taming Nonmonotonicity2011In: Datalog Reloaded / [ed] O. de Moor, G. Gottlob, T. Furche, A. Sellers, Springer Berlin/Heidelberg, 2011, p. 334-398Conference paper (Refereed)
    Abstract [en]

    In this paper we consider rule-based query languages with negation inbodies and heads of rules, traditionally denoted by DATALOG--. Tractable andat the same time intuitive semantics for DATALOG-- has not been provided evenif the area of deductive databases is over 30 years old. In this paper we identifysources of the problem and propose a query language, which we call 4QL.The 4QL language supports a modular and layered architecture and providesa tractable framework for many forms of rule-based reasoning both monotonicand nonmonotonic. As the underpinning principle we assume openness of theworld, which may lead to the lack of knowledge. Negation in rule heads may leadto inconsistencies. To reduce the unknown/inconsistent zones we introduce simpleconstructs which provide means for application-specific disambiguation ofinconsistent information, the use of Local Closed World Assumption (thus alsoClosed World Assumption, if needed), as well as various forms of default anddefeasible reasoning.

  • 22.
    Maluszynski, Jan
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Szalas, Andrzej
    Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
    Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation2011In: Journal of Applied Non-Classical Logics, ISSN 1166-3081, E-ISSN 1958-5780, Vol. 21, no 2, p. 211-232Article in journal (Refereed)
    Abstract [en]

    The paper discusses properties of 4QL, a DATALOG¬¬-like query language, originally outlined by Małuszy´nski and Szałas (Małuszy´nski & Szałas, 2011). 4QL allows one to use rules with negation in heads and bodies of rules. It is based on a simple and intuitive semantics and provides uniform tools for “lightweight” versions of known forms of nonmonotonic reasoning. Negated literals in heads of rules may naturally lead to inconsistencies. On the other hand, rules do not have to attach meaning to some literals. Therefore 4QL is founded on a four-valued semantics, employing the logic introduced in (Małuszy´nski et al., 2008; Vitória et al., 2009) with truth values: ‘true’, ‘false’, ‘inconsistent’ and ‘unknown’. In addition, 4QL is tractable w.r.t. data complexity and captures PTIME queries. Even though DATALOG¬¬ is known as a concept for the last 30 years, to our best knowledge no existing approach enjoys these properties. In the current paper we:

    • investigate properties of well-supported models of 4QL
    • prove the correctness of the algorithm for computing well-supported models
    • show that 4QL has PTIME data complexity and captures PTIME.
  • 23.
    Maluszynski, Jan
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Szalas, Andrzej
    Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology. University of Warsaw, Poland .
    Partiality and Inconsistency in Agents' Belief Bases2013In: Advanced Methods and Technologies for Agent and Multi-Agent Systems: Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013) / [ed] Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, IOS Press, 2013, p. 3-17Conference paper (Refereed)
    Abstract [en]

    Agents' beliefs can be incomplete and partially inconsistent. The process of agents' belief formation in such contexts has to be supported by suitable tools allowing one to express a variety of inconsistency resolving and nonmonotonic reasoning techniques.

    In this paper we discuss 4QL*, a general purpose rule-based query language allowing one to use rules with negation in the premises and in the conclusions of rules. It is based on a simple and intuitive semantics and provides uniform tools for lightweight versions of well-known forms of nonmonotonic reasoning. In addition, it is tractable w.r.t. data complexity and captures PTIME queries, so can be used in real-world applications.

    Reasoning in 4QL* is based on well-supported models. We simplify and at the same time generalize previous definitions of well-supported models and develop a new algorithm for computing such models.

  • 24.
    Maluszynski, Jan
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Szalas, Andrzej
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
    Vitoria, Aida
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    A Four-Valued Logic for Rough Set-Like Approximate Reasoning2007In: Transactions on Rough Sets VI / [ed] James F. Peters, Andrzej Skowron, Ivo Düntsch, Jerzy Grzymala-Busse, Ewa Orlowska and Lech Polkowski, Springer, 2007, Vol. 6, p. 176-190Chapter in book (Refereed)
    Abstract [en]

    Annotation The LNCS journal Transactions on Rough Sets is devoted to the entire spectrum of rough sets related issues, from logical and mathematical foundations, through all aspects of rough set theory and its applications, such as data mining, knowledge discovery, and intelligent information processing, to relations between rough sets and other approaches to uncertainty, vagueness, and incompleteness, such as fuzzy sets and theory of evidence. Volume VI of the Transactions on Rough Sets (TRS) commemorates the life and work of Zdzislaw Pawlak (1926-2006). His legacy is rich and varied. Prof. Pawlak's research contributions have had far-reaching implications inasmuch as his works are fundamental in establishing new perspectives for scientific research in a wide spectrum of fields. This volume of the TRS presents papers that reflect the profound influence of a number of research initiatives by Professor Pawlak. In particular, this volume introduces a number of new advances in the foundations and applications of artificial intelligence, engineering, logic, mathematics, and science. These advances have significant implications in a number of research areas such as the foundations of rough sets, approximate reasoning, bioinformatics, computational intelligence, cognitive science, data mining, information systems, intelligent systems, machine intelligence, and security.

  • 25.
    Maluszynski, Jan
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Vitoria, Aida
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Defining Rough Sets by Extended Logic Programs2002In: PCL02 Paraconsistent Computational Logic, Roskilde: Roskilde University , 2002, p. 81-90Conference paper (Refereed)
  • 26.
    Maluszynski, Jan
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Vitoria, Aida
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Towards Rough Datalog: Embedding Rough Sets in Prolog2004In: Rough-Neural Computing: Techniques for Computing with Words / [ed] Sankar K Pal; Lech Polkowski; Andrzej Skowron, Berlin: Springer Verlag , 2004, p. 297-332Chapter in book (Other academic)
    Abstract [en]

    Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g., in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, and genetic algorithms.

    It is well understood now in the soft computing community that hybrid approaches combining various paradigms provide very promising attempts to solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neurocomputing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.

  • 27.
    Maluszynski, Jan
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Vitoria, Aida
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Szalas, Andrzej
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
    Paraconsistent Logic Programs with Four-valued Rough Sets2008In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Germany: Springer , 2008, p. 41-51Conference paper (Refereed)
    Abstract [en]

    This paper presents a language for defining four-valued rough sets and to reason about them. Our framework brings together two major fields: rough sets and paraconsistent logic programming. On the one hand it provides a paraconsistent approach, based on four-valued rough sets, for integrating knowledge from different sources and reasoning in the presence of inconsistencies. On the other hand, it also caters for a specific type of uncertainty that originates from the fact that an agent may perceive different objects of the universe as being indiscernible. This paper extends the ideas presented in [9]. Our language allows the user to define similarity relations and use the approximations induced by them in the definition of other four-valued sets. A positive aspect is that it allows users to tune the level of uncertainty or the source of uncertainty that best suits applications.

  • 28.
    Nilsson, Ulf
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Logic, Programming and Prolog (2ed)1995Book (Refereed)
  • 29.
    Szilagyi, G.
    et al.
    Hungarian Academy of Sciences.
    Gyimothy, T.
    Hungarian Academy of Sciences.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Static and Dynamic Slicing of Constraint Logic Programs2002In: Automated Software Engineering: An International Journal, ISSN 0928-8910, E-ISSN 1573-7535, Vol. 9, no 1, p. 41-65Article in journal (Refereed)
    Abstract [en]

    Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging.

    This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emerging software technology with a growing number of applications. Data flow in constraint programs is not explicit, and for this reason the concepts of slice and the slicing techniques of imperative languages are not directly applicable.

    This paper formulates declarative notions of slice suitable for CLP. They provide a basis for defining slicing techniques (both dynamic and static) based on variable sharing. The techniques are further extended by using groundness information.

    A prototype dynamic slicer of CLP programs implementing the presented ideas is briefly described together with the results of some slicing experiments.

  • 30.
    Vitoria, Aida
    et al.
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Damasio, C. V.
    Universidade Nova de Lisboa.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Toward rough knowledge bases with quantitative measures2004In: 4th International Conference on Rough Sets and Current Trends in Computing,2004, New York: Springer , 2004, p. 153-Conference paper (Refereed)
  • 31.
    Vitoria, Aida
    et al.
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Damasio, Carlos V
    Departamento de Informática da Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    From Rough Sets to Rough Knowledge Bases2003In: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 57, no 2-4, p. 215-246Article in journal (Refereed)
    Abstract [en]

    This paper presents an expressive language for representing knowledge about vague concepts. It is based on the rough set formalism and it caters for implicit definition of rough relations by combining different regions (e.g. upper approximation, lower approximation, boundary) of other rough relations. The semantics of the proposed language is obtained by translating it to the language of extended logic programs whose meaning is captured by paraconsistent stable models. A query language is also discussed to retrieve information about the defined rough relations. Motivating examples illustrating the use of the language are described.

  • 32.
    Vitoria, Aida
    et al.
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    A logic programming framework for rough sets2002In: Rough Sets and Current Trends in Computing: Third International Conference, RSCTC 2002 Malvern, PA, USA, October 14–16, 2002 Proceedings / [ed] James J. Alpigini, James F. Peters, Andrzej Skowron and Ning Zhong, Springer Berlin/Heidelberg, 2002, Vol. 2475, p. 205-212Chapter in book (Refereed)
    Abstract [en]

    We propose a framework for defining and reasoning about rough sets based on definite extended logic programs. Moreover, we introduce a rough-set-specific query language. Several motivating examples are also presented. Thus, we establish a link between rough set theory and logic programming that makes possible transfer of expertise between these fields and combination of the techniques originating from both fields.

  • 33.
    Vitoria, Aida
    et al.
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Szalas, Andrzej
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Four-valued Extension of Rough Sets2008In: Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), Springer , 2008, p. 106-114Conference paper (Refereed)
    Abstract [en]

    Rough set approximations of Pawlak [15] are sometimes generalized by using similarities between objects rather than elementary sets. In practical applications, both knowledge about properties of objects and knowledge of similarity between objects can be incomplete and inconsistent. The aim of this paper is to define set approximations when all sets, and their approximations, as well as similarity relations are four-valued. A set is four-valued in the sense that its membership function can have one of the four logical values: unknown (u), false (f), inconsistent (i), or true (t). To this end, a new implication operator and set-theoretical operations on four-valued sets, such as set containment, are introduced. Several properties of lower and upper approximations of four-valued sets are also presented.

1 - 33 of 33
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf