Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Journal of Experimental & Theoretical Artificial Intelligence
Answer Set Programming with Constraints Using Lazy Grounding
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Module-Based Framework for Multi-language Constraint Modeling
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Efficient haplotype inference with answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Integrating answer set reasoning with constraint solving techniques
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
| Hi-index | 0.00 |
The advent of ASP has reinvigorated the field of logic programming. ASP has a simple syntax, which from the beginning appealed logic programmers--thanks also to its similarity to Prolog 's syntax. ASP has a well-understood declarative semantics, which can adequately capture non-monotonicity. ASP benefits from good implementations, which guarantee an adequate level of efficiency and reflect the declarative nature of the paradigm--differently from the case of Prolog , where there is a disconnect between declarative semantics and the implementation of its operational semantics.