93 citations · 212 across the 18 of their papers we have counts for
8 papers · 1 filter
Questions as cognitive filters
Willem Conradie, Krishna Manoorkar, Alessandra Palmigiano +2
In this paper, we develop a logico-algebraic framework for modeling decision-making through deliberation in multi-agent settings. The central concept in this framework is that of i…
Modal reduction principles across relational semantics
Willem Conradie, Andrea De Domenico, Krishna Manoorkar +4
The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings which incl…
Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras: the algorithm PEARL and its implementation (Technical Report)
Willem Conradie, Valntin Goranko, Peter Jipsen
The non-deterministic algorithmic procedure PEARL (an acronym for `Propositional variables Elimination Algorithm for Relevance Logic') has been recently developed for computing fir…
Rough concepts
Willem Conradie, Sabine Frittella, Krishna Manoorkar +4
The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal…
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II)
Willem Conradie, Salih Durhan, Guido Sciavicco
There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points a…
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part I)
Willem Conradie, Salih Durhan, Guido Sciavicco
There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points a…
Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA
Willem Conradie, Alessandra Palmigiano, Sumit Sourabh +1
We generalize Venema's result on the canonicity of the additivity of positive terms, from classical modal logic to a vast class of logics the algebraic semantics of which is given…
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
Willem Conradie, Valentin Goranko, Dimiter Vakarelov
Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for…