Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
Elvira Albert, Puri Arenas, Michael Codish, Samir ...
Abstract-- Service discovery enables users to access information, resources and services anytime, anywhere. This involves a client, a service provider and an infrastructure for ser...
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Abstract: In Peru, the computing discipline as an academic field has been neglected during decades deriving in a lowquality higher education system and consequently shaping an acad...