Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees. We consider information...
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Abstract In this paper a basic structural problem in Generalized Semi-Infinite Programming is solved. In fact, under natural and generic assumptions we show that at any (local) min...