599 search results - page 48 / 120 » Integrating answer set programming and constraint logic prog... |
159
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
133
Voted
ESWS
2005
Springer
15 years 9 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
113
Voted
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
157
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
128
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...