research
∙
05/10/2022
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
Logic Programs with Ordered Disjunction (LPODs) extend classical logic p...
share
research
∙
08/07/2021
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
Logic Programs with Ordered Disjunction (LPODs) extend classical logic p...
research
∙
12/20/2020
Lexicographic Logic: a Many-valued Logic for Preference Representation
Logical formalisms provide a natural and concise means for specifying an...
research
∙
07/23/2019
The Expressive Power of Higher-Order Datalog
A classical result in descriptive complexity theory states that Datalog ...
research
∙
04/23/2018
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
We define a novel, extensional, three-valued semantics for higher-order ...
research
∙
07/15/2017
The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs
In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics f...
research
∙
05/15/2014
