229 search results - page 38 / 46 » On Reductive Semantics of Aggregates in Answer Set Programmi... |
WABI
2009
Springer
15 years 6 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
VMCAI
2007
Springer
15 years 5 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
FLOPS
2008
Springer
15 years 1 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
112
click to vote
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...