Functional answer set programming
- Pedro Cabalar
- Computer ScienceTheory and Practice of Logic Programming
- 18 June 2010
This paper starts from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and proposes a variant QEL=ℱ where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions ( or operations).
Propositional theories are strongly equivalent to logic programs
- Pedro Cabalar, P. Ferraris
- Philosophy, Computer ScienceTheory and Practice of Logic Programming
- 16 January 2007
Any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head, under the answer sets semantics.
Temporal Equilibrium Logic: A First Approach
- Pedro Cabalar, Gilberto Pérez Vega
- PhilosophyInternational Conference/Workshop on Computer…
- 12 February 2007
An extension of Equilibrium Logic consisting in the inclusion of modal temporal operators, as those used in Linear Temporal Logic, is introduced, resulting in a very expressive formalism that allows nonmonotonic reasoning for temporal domains.
Strongly Equivalent Temporal Logic Programs
- Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal Martín
- Computer ScienceEuropean Conference on Logics in Artificial…
- 28 September 2008
A linear temporal extension of Equilibrium Logic and its monotonic basis, the intermediate logic of Here-and-There (HT), provides a sufficient condition for temporal strong equivalence and can be transformed into a provability test into the standard Linear Temporal Logic (LTL), something that can be automatically checked using any of the LTL available provers.
Automata-Based Computation of Temporal Equilibrium Models
- Pedro Cabalar, Stephane Demri
- Computer ScienceInternational Workshop/Symposium on Logic-based…
- 18 July 2011
This paper proposes a method for the latter that consists in building a Buchi automaton that accepts exactly the temporal equilibrium models of a given theory, providing an automata-based decision procedure and illustrating the ω-regularity of such sets.
M3DISEEN: A Novel Machine Learning Approach for Predicting the 3D Printability of Medicines.
- M. Elbadawi, Brais Muñiz Castro, A. Goyanes
- Biology, Materials ScienceInternational journal of pharmaceutics
- 19 September 2020
Minimal Logic Programs
- Pedro Cabalar, D. Pearce, A. Valverde
- Computer ScienceInternational Conference on Logic Programming
- 8 September 2007
This work proposes a method consisting in the generation of the set of prime implicates of the original theory, starting from its set of countermodels (in the logic of Here-and-There), in a similar vein to the Quine-McCluskey method forminimisation of boolean functions.
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
- Pedro Cabalar, D. Pearce, A. Valverde
- Computer ScienceASp
- 5 December 2005
The paper shows how to effectively obtain an equivalent program starting from an arbitrary theory and shows that in general there is no polynomial time transformation if the authors require the resulting program to share precisely the vocabulary or signature of the initial theory.
telingo = ASP + Time
- Pedro Cabalar, R. Kaminski, Philip Morkisch, Torsten Schaub
- Computer ScienceInternational Conference on Logic Programming and…
- 3 June 2019
Telingo is described, an extension of the ASP system clingo with temporal operators over finite linear time and insights into its implementation are provided and an empirical evaluation contrasting standard incremental ASP programs with their temporal counterparts in telingo’s input language is provided.
Causal Graph Justifications of Logic Programs*
- Pedro Cabalar, J. Fandinno, Michael Fink
- Computer Science, PhilosophyTheory and Practice of Logic Programming
- 1 July 2014
This work defines the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct and shows that the causal justifications obtained for a given atom have a direct correspondence to (relevant) syntactic proofs of that atom using the program rules involved in the graphs.
...
...