256
Voted
LPNMR
2011
Springer
14 years 6 months ago
2011
Springer
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 expre...
182
Voted
LPNMR
2011
Springer
14 years 6 months ago
2011
Springer
This paper investigates a new approach for computing the inference of defeasible logic. The algorithm proposed can substantially reduced the theory size increase due to transformat...
175
Voted
LPNMR
2011
Springer
14 years 6 months ago
2011
Springer
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...
198
Voted
LPNMR
2011
Springer
14 years 6 months ago
2011
Springer
We present an approach to integrating rules and ontologies on the basis of the first-order stable model semantics defined by Ferraris, Lee and Lifschitz. We show that a few exist...
178
Voted
LPNMR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
161
Voted
LOGCOM
2011
14 years 6 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
162
Voted
LOGCOM
2011
14 years 6 months ago
2011
235
click to vote
LCTRTS
2011
Springer
14 years 6 months ago
2011
Springer
nguage does not provide any abstractions for exception handling or other forms of error handling, leaving programmers to devise their own conventions for detecting and handling er...
149
Voted
LATA
2011
Springer
14 years 6 months ago
2011
Springer
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
187
Voted
LATA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...