Mauricio Osorio
YOU?
Author Swipe
View article: A scoping review and analysis of a series of country experiences to inform the Chilean health financing reform
A scoping review and analysis of a series of country experiences to inform the Chilean health financing reform Open
Our analysis and underlying assumptions allow us to provide recommendations for the current reform process in Chile, focusing on the advancement of universal public insurance with a mixed payment mechanism for public and private providers,…
View article: Digital Companions for Well-being: Challenges and Opportunities
Digital Companions for Well-being: Challenges and Opportunities Open
Humans have evolved to seek social connections, extending beyond interactions with living beings. The digitization of society has led to interactions with non-living entities, such as digital companions, aimed at supporting mental well-bei…
View article: Theory of partial-order programming
Theory of partial-order programming Open
This paper shows the use of partial-order program clauses and lattice domains for declarative programming. This paradigm is particularly useful for expressing concise solutions to problems from graph theory, program analysis, and database …
View article: Fundamentos para un currículo nacional en Cirugía General basado en competencia: Consenso Delphi de la División de Educación de la Asociación Colombiana de Cirugía
Fundamentos para un currículo nacional en Cirugía General basado en competencia: Consenso Delphi de la División de Educación de la Asociación Colombiana de Cirugía Open
Frente a los desafíos de la Educación Basada en Competencia, este consenso Delphi de la División de Educación de la Asociación Colombiana de Cirugía informa sobre las mínimas competencias profesionales esperadas del cirujano egresado de lo…
View article: Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach – Extended and Revised version
Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach – Extended and Revised version Open
View article: Three New Genuine Five-valued Logics Intended to Model Non-trivial Concepts
Three New Genuine Five-valued Logics Intended to Model Non-trivial Concepts Open
We introduce three 5-valued paraconsistent logics that we name FiveASP1, FiveASP2 and FiveASP3. Each of these logics is genuine and paracomplete. The new value is called e attempting to model the notion of ineffability. If one drops e from…
View article: An Extension of the Stable Semantics via Lukasiewicz Logic
An Extension of the Stable Semantics via Lukasiewicz Logic Open
Logic Programming and fuzzy logic are active areas of research, and their scopes in terms of applications are growing fast. Fuzzy logic is a branch of many-valued logic based on the paradigm of inference under vagueness. In this work we re…
View article: Educación quirúrgica durante la Pandemia COVID-19: Primer consenso nacional de la División de Educación de la Asociación Colombiana de Cirugía.
Educación quirúrgica durante la Pandemia COVID-19: Primer consenso nacional de la División de Educación de la Asociación Colombiana de Cirugía. Open
Este consenso presenta las recomendaciones de la División de Educación de la Asociación Colombiana de Cirugía para los programas de especialización en cirugía general del país, con el fin de enfrentar la Pandemia Covid-19 en los próximos a…
View article: Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs
Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs Open
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable semantics (STABLE). For normal programs, this semantics is based on suitable integration of the well-founded semantics (WFS) and the Clark…
View article: 0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks
0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks Open
"Dung’s abstract argumentation has been an object of intense study not only due to its relationship with logical reasoning but also because of its uses within artificial intelligence. One research branch in abstract argumentation has focus…
View article: Defining Stage Argumentation Semantics in Terms of an Abducible Semantics
Defining Stage Argumentation Semantics in Terms of an Abducible Semantics Open
We define a new logic programming semantics in terms of abducible atoms. We use it to characterize the stage extensions of an argumentation framework AF by means of an associated normal program PAF. We also define the stage semantics for a…
View article: Range-based argumentation semantics as 2-valued models
Range-based argumentation semantics as 2-valued models Open
Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming cou…
View article: Findings from anorectal endosonography in a prospective cohort
Findings from anorectal endosonography in a prospective cohort Open
View article: Conference Organization
Conference Organization Open
View article: On Paraconsistent Extensions of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>
On Paraconsistent Extensions of Open
We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show that C1 can be extended to larger paraconsistent logics by adding some desirable properties as axioms. We use three-valu…
View article: A Single Proof of Classical Behaviour in da Costa's <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> Systems
A Single Proof of Classical Behaviour in da Costa's Systems Open
A strong negation in da Costa's Cn systems can be naturally extended from the strong negation (¬) of C1. In [Newton C. A. da Costa. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic, 15(4):497–510, 10 1974] N…