Results 21 to 30 of about 97,467 (324)

Modeling and Classical Propositional Logic

open access: green, 2019
Mon domaine de recherche se concentre sur l'intelligence artificielle, avec un accent particulier sur l'application des logiques formelles et d'autres formalismes symboliques similaires pour aborder divers enjeux. Ce travail s'articule autour de deux axes majeurs : la fouille de données via des méthodes déclaratives et la représentation des ...
Yakoub Salhi
openaire   +3 more sources

Modelling practical certainty and its link with classical propositional logic [PDF]

open access: green, 2013
We model practical certainty in the language of accept & reject statement-based uncertainty models. We present three different ways, each time using a different nature of assessment: we study coherent models following from (i) favourability assessments, (
Arthur Van Camp
openalex   +3 more sources

On density of truth of the intuitionistic logic in one variable [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj   +1 more source

On the Succinctness of Atoms of Dependency [PDF]

open access: yesLogical Methods in Computer Science, 2019
Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj   +1 more source

Maximality of bi-intuitionistic propositional logic [PDF]

open access: yesJournal of Logic and Computation, 2021
In the style of Lindström’s theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of compactness, the Tarski ...
Grigory K. Olkhovikov, Guillermo Badia
semanticscholar   +1 more source

Fullness and Decidability in Continuous Propositional Logic

open access: yesMathematics, 2022
In this paper we consider general continuous propositional logics and prove some basic properties about them. First, we characterize full systems of continuous connectives of the form {¬,∸,f} where f is a unary connective.
Xuanzhi Ren
doaj   +1 more source

Axiomatizations for propositional and modal team logic [PDF]

open access: yes, 2016
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K.
Lück, Martin
core   +5 more sources

Home - About - Disclaimer - Privacy