Publicaties
Gekozen filters:
Gekozen filters:
Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions Universiteit Gent
Putting logic-based distributed systems on stable grounds Universiteit Hasselt
In the Declarative Networking paradigm, Datalog-like languages are used to express distributed computations. Whereas recently formal operational semantics for these languages have been developed, a corresponding declarative semantics has been lacking so far. The challenge is to capture precisely the amount of nondeterminism that is inherent to distributed computations due to concurrency, networking delays, and asynchronous communication. This ...
Groundedness in Logics with a Fixpoint Semantics KU Leuven
In the field of knowledge representation and reasoning, many different logics are developed. Often, these logics exhibit striking similarities, either because they emerged from related ideas, or because they use similar underlying fundamental principles. Approximation fixpoint theory (AFT) is an abstract algebraical unifying framework that aims at exposing these principles by formalising them in lattice theory. It has been successfully applied ...
A Tarskian informal semantics for answer set programming KU Leuven
In their seminal papers on stable model semantics, Gelfond and Lifschitz introduced ASP by casting programs as epistemic theories, in which rules represent statements about the knowledge of a rational agent. To the best of our knowledge, theirs is still the only published systematic account of the intuitive meaning of rules and programs under the stable semantics. In current ASP practice, however, we find numerous applications in which rational ...
Reducing fuzzy answer set programming to model finding in fuzzy logics Universiteit Gent
In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy ...
Stable-unstable semantics: Beyond NP with normal logic programs KU Leuven
© 2016 Cambridge University Press. Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated ...
Reconstructing constructional semantics: the dative subject construction in Old Norse-Icelandic, Latin, Ancient Greek, Old Russian and Old Lithuanian Universiteit Gent
As the historical linguistic community is well aware, reconstructing semantics is a notoriously difficult undertaking. Such reconstruction has so far mostly been carried out on lexical items, like words and morphemes, and has not been conducted for larger and more complex linguistic units, which intuitively seems to be a more intricate task, especially given the lack of methodological criteria and guidelines within the field. This follows ...
Modeling negotiation using multi-focused answer sets Universiteit Gent
Answer Set Programming (ASP) is a form of declarative pro- gramming based on the stable model semantics. The idea of ASP is to represent a computational problem by a set of (propositional) rules P such that particular minimal models of P , the stable models, correspond to the solutions of the original problem. Communicating ASP (CASP) allows for a number of ASP programs to collaborate by asking each other questions. In CASP, there is no longer a ...
Communicating ASP and the polynomial hierarchy Universiteit Gent
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expressiveness of this framework crucially depends on the nature of the communication mechanism that is adopted. The communication mechanism we introduce in this paper allows us to focus on a sequence of programs, where each program in the sequence may successively ...