SLT-Resolution for the Well-Founded Semantics
Journal of Automated Reasoning
Semantics of Normal Logic Programs with Embedded Implications
Proceedings of the 17th International Conference on Logic Programming
Proving Correctness and Completeness of Normal Programs - A Declarative Approach
Proceedings of the 17th International Conference on Logic Programming
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
How to Incorporate Negation in a Prolog Compiler
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Constructive negation by bottom-up computation of literal answers
Proceedings of the 2004 ACM symposium on Applied computing
Proving correctness and completeness of normal programs – a declarative approach
Theory and Practice of Logic Programming
Implementing type-based constructive negation
Proceedings of the 2007 ACM symposium on Applied computing
Elimination of Local Variables from Definite Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Well-founded semantics for hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Chess revision: acquiring the rules of chess variants through FOL theory revision from examples
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
An algorithm for local variable elimination in normal logic programs
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
A transformational semantics of static embedded implications of normal logic programs
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Hi-index | 0.00 |