Search Results for author:
Found 4 papers, 0 papers with code
Revisiting Explicit Negation in Answer Set Programming
A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation.
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the QELF interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction.
Interpolable Formulas in Equilibrium Logic and Answer Set Programming
Interpolation is an important property of classical and many non-classical logics that has been shown to have interesting applications in computer science and AI.
The aurora experimental framework for the performance evaluation of speech recognition systems under noisy conditions
Aurora is developing standards for Distributed Speech Recognition (DSR) where the speech analysis is done in the telecommunication terminal and the recognition at a central location in the telecom network.
