Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...