liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Maluszynski, Jan
Publications (10 of 33) Show all publications
Maluszynski, J. & Szalas, A. (2013). Partiality and Inconsistency in Agents' Belief Bases. In: Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain (Ed.), 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). Paper presented at 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), 27-29 May 2013, Hue City, Vietnam (pp. 3-17). IOS Press
Open this publication in new window or tab >>Partiality and Inconsistency in Agents' Belief Bases
2013 (English)In: 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, Published 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.

Place, publisher, year, edition, pages
IOS Press, 2013
Series
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389, E-ISSN 1879-8314 ; 252
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-107345 (URN)10.3233/978-1-61499-254-7-3 (DOI)000339335600001 ()978-1-61499-253-0 (ISBN)
Conference
7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), 27-29 May 2013, Hue City, Vietnam
Available from: 2014-06-11 Created: 2014-06-11 Last updated: 2018-02-09Bibliographically approved
Maluszynski, J. & Szalas, A. (2011). Living with Inconsistency and Taming Nonmonotonicity. In: O. de Moor, G. Gottlob, T. Furche, A. Sellers (Ed.), Datalog Reloaded. Paper presented at Datalog 2.0 (pp. 334-398). Springer Berlin/Heidelberg
Open this publication in new window or tab >>Living with Inconsistency and Taming Nonmonotonicity
2011 (English)In: Datalog Reloaded / [ed] O. de Moor, G. Gottlob, T. Furche, A. Sellers, Springer Berlin/Heidelberg, 2011, p. 334-398Conference paper, Published 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.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2011
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6702
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-72702 (URN)10.1007/978-3-642-24206-9_22 (DOI)978-3-642-24205-2 (ISBN)
Conference
Datalog 2.0
Available from: 2011-12-05 Created: 2011-12-05 Last updated: 2018-01-12
Maluszynski, J. & Szalas, A. (2011). Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation. Journal of Applied Non-Classical Logics, 21(2), 211-232
Open this publication in new window or tab >>Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
2011 (English)In: Journal of Applied Non-Classical Logics, ISSN 1166-3081, E-ISSN 1958-5780, Vol. 21, no 2, p. 211-232Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Cachan, France: Lavoisier, 2011
Keywords
query language, data complexity, paraconsistent semantics, DATALOG
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-72692 (URN)10.3166/JANCL.21.211-232 (DOI)
Available from: 2011-12-05 Created: 2011-12-05 Last updated: 2018-01-12
Drabent, W. & Maluszynski, J. (2010). Hybrid Rules with Well-Founded Semantics. Knowledge and Information Systems, 25(1), 137-168
Open this publication in new window or tab >>Hybrid Rules with Well-Founded Semantics
2010 (English)In: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 25, no 1, p. 137-168Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
Berlin: Springer, 2010
Keywords
Integration of rules and ontologies, Semantic web reasoning, Knowledge representation, Well-founded semantics, Constructive negation, Constraint logic programming
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-63677 (URN)10.1007/s10115-010-0300-5 (DOI)000282514300007 ()
Note
The original publication is available at www.springerlink.com: Wlodzimierz Drabent and Jan Maluszynski, Hybrid Rules with Well-Founded Semantics, 2010, Knowledge and Information Systems, (25), 1, 137-168. http://dx.doi.org/10.1007/s10115-010-0300-5 Copyright: Springer Science Business Media http://www.springerlink.com/ Available from: 2010-12-29 Created: 2010-12-29 Last updated: 2018-01-12Bibliographically approved
Drabent, W., Eiter, T., Ianni, G., Krennwallner, T., Lukasiewicz, T. & Maluszynski, J. (2009). Hybrid Reasoning with Rules and Ontologies. In: Bry & Maluszynski (Ed.), Semantic Techniques for the Web, The REWERSE Perspective (pp. 1-49). Berlin: pringer
Open this publication in new window or tab >>Hybrid Reasoning with Rules and Ontologies
Show others...
2009 (English)In: 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.

Place, publisher, year, edition, pages
Berlin: pringer, 2009
Series
Lecture Notes in Computer Science ; 5500
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-52634 (URN)10.1007/978-3-642-04581-3_1 (DOI)978-3-642-04580-6 (ISBN)
Available from: 2010-01-06 Created: 2010-01-06 Last updated: 2018-01-12
Maluszynski, J. (2009). Integration of Rules and Ontologies. In: Encyclopedia of Database Systems (pp. 1546-1551). Berlin: Springer
Open this publication in new window or tab >>Integration of Rules and Ontologies
2009 (English)In: Encyclopedia of Database Systems, Berlin: Springer , 2009, p. 1546-1551Chapter in book (Other (popular science, discussion, etc.))
Place, publisher, year, edition, pages
Berlin: Springer, 2009
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-52633 (URN)10.1007/978-0-387-39940-9_1313 (DOI)978-0-387-49616-0 (ISBN)
Available from: 2010-01-06 Created: 2010-01-06 Last updated: 2018-01-12
Bry, F. & Maluszynski, J. (Eds.). (2009). Semantic Techniques for the Web, The REWERSE Perspective. Berlin: Springer
Open this publication in new window or tab >>Semantic Techniques for the Web, The REWERSE Perspective
2009 (English)Collection (editor) (Other (popular science, discussion, etc.))
Place, publisher, year, edition, pages
Berlin: Springer, 2009
Series
Lecture Notes in Computer Science ; 5500
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-52635 (URN)10.1007/978-3-642-04581-3 (DOI)978-3-642-04580-6 (ISBN)
Available from: 2010-01-06 Created: 2010-01-06 Last updated: 2018-01-12
Vitoria, A., Szalas, A. & Maluszynski, J. (2008). Four-valued Extension of Rough Sets. In: Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT) (pp. 106-114). Springer
Open this publication in new window or tab >>Four-valued Extension of Rough Sets
2008 (English)In: Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), Springer , 2008, p. 106-114Conference paper, Published 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.

Place, publisher, year, edition, pages
Springer, 2008
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5009
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-43561 (URN)10.1007/978-3-540-79721-0_19 (DOI)74200 (Local ID)978-3-540-79720-3 (ISBN)74200 (Archive number)74200 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2011-03-04
Maluszynski, J., Vitoria, A. & Szalas, A. (2008). Paraconsistent Logic Programs with Four-valued Rough Sets. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): . Paper presented at Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing (RSCTC) (pp. 41-51). Germany: Springer
Open this publication in new window or tab >>Paraconsistent Logic Programs with Four-valued Rough Sets
2008 (English)In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Germany: Springer , 2008, p. 41-51Conference paper, Published 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.

Place, publisher, year, edition, pages
Germany: Springer, 2008
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5306
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-43560 (URN)10.1007/978-3-540-88425-5_5 (DOI)74199 (Local ID)978-3-540-88423-1 (ISBN)978-3-540-88425-5 (ISBN)74199 (Archive number)74199 (OAI)
Conference
Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing (RSCTC)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2014-05-15
Baroglio, C., Bonatti, P. A., Maluszynski, J., Marchiori, M., Polleres, A. & Schaffert, S. (Eds.). (2008). Reasoning Web (1ed.). Berlin: Springer
Open this publication in new window or tab >>Reasoning Web
Show others...
2008 (English)Collection (editor) (Other academic)
Place, publisher, year, edition, pages
Berlin: Springer, 2008 Edition: 1
Series
Lecture notes in computer science ; 5224
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-44307 (URN)76220 (Local ID)978-3-540-85656-6 (ISBN)76220 (Archive number)76220 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-12Bibliographically approved
Organisations

Search in DiVA

Show all publications