Sciweavers

581 search results - page 68 / 117
» Coordination in answer set programming
Sort
View
ASP
2005
Springer
15 years 11 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
JELIA
2010
Springer
15 years 4 months ago
A Normal Form for Linear Temporal Equilibrium Logic
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
Pedro Cabalar
ASP
2003
Springer
15 years 11 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
POPL
2008
ACM
16 years 6 months ago
Demand-driven alias analysis for C
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
Xin Zheng, Radu Rugina
KI
2007
Springer
16 years 7 days ago
Semantic Graph Visualisation for Mobile Semantic Web Interfaces
Information visualisation benefits from the Semantic Web: multimodal mobile interfaces to the Semantic Web offer access to complex knowledge and information structures. Natural l...
Daniel Sonntag, Philipp Heim