Search Results for author:
Found 4 papers, 2 papers with code
Constraint Answer Set Programming without Grounding
The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets.
Programming Languages Logic in Computer Science
Computing Stable Models of Normal Logic Programs Without Grounding
We present a method for computing stable models of normal logic programs, i. e., logic programs extended with negation, in the presence of predicates with arbitrary terms.
Logic in Computer Science
Improving Adherence to Heart Failure Management Guidelines via Abductive Reasoning
A standard approach to managing chronic diseases by medical community is to have a committee of experts develop guidelines that all physicians should follow.
A Physician Advisory System for Chronic Heart Failure Management Based on Knowledge Patterns
In this paper we describe a physician-advisory system for CHF management that codes the entire set of clinical practice guidelines for CHF using answer set programming.
