Publication | Date of Publication | Type |
---|
Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions | 2024-02-13 | Paper |
A landscape and implementation framework for probabilistic rough sets using \textsc{ProbLog} | 2024-02-05 | Paper |
Rough forgetting | 2022-11-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5869515 | 2022-09-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5869696 | 2022-09-28 | Paper |
Heterogeneous Approximate Reasoning with Graded Truth Values | 2022-06-15 | Paper |
Many-valued dynamic object-oriented inheritance and approximations | 2022-06-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5078314 | 2022-05-23 | Paper |
Rough set reasoning using answer set programs | 2021-10-27 | Paper |
Rule-Based Reasoning with Belief Structures | 2021-05-05 | Paper |
A paraconsistent approach to actions in informationally complex environments | 2019-10-22 | Paper |
General domain circumscription and its first-order reduction | 2019-04-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4619874 | 2019-02-07 | Paper |
Variations on Jaśkowski’s Discursive Logic | 2019-01-21 | Paper |
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs | 2016-11-30 | Paper |
Logic-Based Roughification | 2015-04-02 | Paper |
Stability, Supportedness, Minimality and Kleene Answer Set Programs | 2015-02-04 | Paper |
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination | 2013-11-28 | Paper |
How an agent might think | 2013-06-11 | Paper |
Converse-PDL with regular inclusion axioms: a framework for MAS logics | 2012-07-17 | Paper |
Logical foundations and complexity of 4QL, a query language with unrestricted negation | 2012-07-17 | Paper |
ExpTime tableau decision procedures for regular grammar logics with converse | 2012-03-09 | Paper |
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL | 2011-06-14 | Paper |
A Framework for Graded Beliefs, Goals and Intentions | 2011-01-03 | Paper |
Contextual Coalitional Games | 2010-12-17 | Paper |
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$ | 2010-11-02 | Paper |
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic | 2010-07-20 | Paper |
Fundamentals of Computation Theory | 2010-04-20 | Paper |
Annotation theories over finite graphs | 2010-03-17 | Paper |
Modeling and Reasoning with Paraconsistent Rough Sets | 2010-03-10 | Paper |
KI 2003: Advances in Artificial Intelligence | 2010-03-03 | Paper |
Second-order reasoning in description logics | 2009-11-30 | Paper |
Approximate databases: a support tool for approximate reasoning | 2009-11-30 | Paper |
Voting by eliminating quantifiers | 2009-11-16 | Paper |
Paraconsistent Reasoning with Words | 2009-11-12 | Paper |
Towards incorporating background theories into quantifier elimination | 2009-11-11 | Paper |
A Tableau Calculus for Regular Grammar Logics with Converse | 2009-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3543581 | 2008-12-04 | Paper |
Paraconsistent Logic Programs with Four-Valued Rough Sets | 2008-11-25 | Paper |
Towards Approximate BGI Systems | 2008-09-25 | Paper |
On the Fixpoint Theory of Equality and Its Applications | 2008-04-24 | Paper |
Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals | 2007-12-03 | Paper |
A Four-Valued Logic for Rough Set-Like Approximate Reasoning | 2007-09-03 | Paper |
Relational Methods in Computer Science | 2007-05-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q3425577 | 2007-02-26 | Paper |
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing | 2006-11-01 | Paper |
Rough Sets and Current Trends in Computing | 2006-11-01 | Paper |
Logics in Artificial Intelligence | 2006-10-25 | Paper |
Knowledge representation techniques. A rough set approach. | 2006-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4460674 | 2004-03-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4427000 | 2003-09-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4708920 | 2003-06-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4329266 | 2002-04-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q2753783 | 2001-12-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4946227 | 2000-12-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4943319 | 2000-03-16 | Paper |
Declarative PTIME queries for relational databases using quantifier elimination | 2000-01-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4264098 | 1999-11-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250040 | 1999-10-28 | Paper |
Computing circumscription revisited: A reduction algorithm | 1997-09-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q3126169 | 1997-07-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4874650 | 1996-06-06 | Paper |
On an automated translation of modal proof rules into formulas of the classical logic | 1994-12-21 | Paper |
On the Correspondence Between Modal and Classical Logic: an Automated Approach | 1994-12-15 | Paper |
Axiomatizing fixpoint logics | 1992-09-26 | Paper |
On strictly arithmetical completeness in logics of programs | 1991-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3835444 | 1989-01-01 | Paper |
Propositional description of finite cause-effect structures | 1988-01-01 | Paper |
An incompleteness result in process algebra | 1988-01-01 | Paper |
Incompleteness of first-order temporal logic with until | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3769950 | 1988-01-01 | Paper |
Arithmetical axiomatization of first-order temporal logic | 1987-01-01 | Paper |
A complete axiomatic characterization of first-order temporal logic of linear time | 1987-01-01 | Paper |
Concerning the semantic consequence relation in first-order temporal logic | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3339269 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3678648 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3957924 | 1981-01-01 | Paper |