System f2lp – Computing Answer Sets of First-Order Formulas

Abstract. Answer Set Programming Modulo Theories (ASPMT) is an approach to combining answer set programming and satisfiability modulo theories based on the functional stable model semantics. It is shown that the tight fragment of ASPMT programs can be turned into SMT instances, thereby allowing SMT solvers to compute stable models of ASPMT programs. In this paper we present a compiler called ASPSMT2SMT, which implements this translation. The system uses ASP grounder GRINGO and SMT solver Z3. GRINGO partially grounds input programs while leaving some variables to be processed by Z3. We demonstrate that the system can effectively handle real number computations for reasoning about continuous changes.

show abstract

“…System ASPMT2SMT uses a syntax similar to system CPLUS2ASP [8] for declarations and a syntax similar to system F2LP [9] for rules.…”

Section: Syntax Of Input Languagementioning

confidence: 99%

System aspmt2smt: Computing ASPMT Theories by SMT Solvers

Bartholomew

Lee

2014

Logics in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

show abstract

“…The code for this program was initially written in the input language F2lp (Lee and Palla, ). F2lp is an implementation of the First‐Order Logic stable model semantics by Ferraris et al.…”

Section: Methodsmentioning

confidence: 99%

A logic approach to modelling nomenclatural change

2017

Self Cite

View full text Add to dashboard Cite

We utilize an Answer Set Programming (ASP) approach to show that the principles of nomenclature are tractable in computational logic. To this end we design a hypothetical, 20 nomenclatural taxon use case, with starting conditions that embody several overarching principles of the International Code of Zoological Nomenclature, including Binomial Nomenclature, Priority, Coordination, Homonymy, Typification and the structural requirement of Gender Agreement. The use case ending conditions are triggered by the reinterpretation of the diagnostic features of one of 12 type specimens anchoring the corresponding species-level epithets. Permutations of this child-to-parent reassignment action lead to 36 alternative scenarios, where each scenario requires a set of 1-14 logically contingent nomenclatural emendations. We show that an ASP transition system approach can correctly infer the Code-mandated changes for each scenario, and visually output the ending conditions. The results provide a foundation for further developing logic-based nomenclatural change optimization and validation services, which could be applied in global nomenclatural registries. More generally, logic explorations of nomenclatural and taxonomic change scenarios provide a novel means of assessing design biases inherent in the principles of nomenclature, and can therefore inform the design of future, big data-compatible identifier systems that recognize and mitigate these constraints.

show abstract

“…From a logic programming perspective, the explanation features from lppf are based on [4] but there exist other approaches for justification of ASP programs (see [6] for a recent survey). Similarly, the functional extension of ASP is based on [3] since, although other functional extensions exist, it is the only one allowing free nesting of functional terms, a feature that can be freely used in any lppf rule. For future work, we plan to keep extending the lppf language with new aggregate functions and with causal literals [5] that would allow rule conditions that test if an atom has been a cause of another atom.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

“…For each case we have variables from both the recipient and the donor as well as from the transplantation itself. The tool web-liver provides a web interface (written in python) for a logic programming interpreter called lppf (Logic Programs with Partial Functions [3]), an extension of Answer Set Programming (ASP) [1] with two additional features: (1) partial functions; and (2) computation of explanations for the (functional) answer sets.…”

Section: Introductionmentioning

confidence: 99%

A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation

Aguado

Cabalar

Fandinno

et al. 2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In this paper we present web-liver, a rule-based system for decision support in the medical domain, focusing on its application in a liver transplantation unit for implementing policies for donorpatient matching. The rule-based system is built on top of an interpreter for logic programs with partial functions, called lppf, that extends the paradigm of Answer Set Programming (ASP) adding two main features: (1) the inclusion of partial functions and (2) the computation of causal explanations for the obtained solutions. The final goal of web-liver is assisting the medical experts in the design of new donor-patient matching policies that take into account not only the patient severity but also the transplantation utility. As an example, we illustrate the tool behaviour with a set of rules that implement the utility index called SOFT.

show abstract

System f2lp – Computing Answer Sets of First-Order Formulas

Cited by 29 publications

References 7 publications

System aspmt2smt: Computing ASPMT Theories by SMT Solvers

System aspmt2smt: Computing ASPMT Theories by SMT Solvers

A logic approach to modelling nomenclatural change

A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation

Contact Info

Product

Resources

About