Sciweavers

935 search results - page 31 / 187
» From Logic Programming Towards Multi-Agent Systems
Sort
View
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
15 years 6 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
134
Voted
WLP
2004
Springer
15 years 7 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
Misa Keinänen, Ilkka Niemelä
ENTCS
2007
105views more  ENTCS 2007»
15 years 1 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
XSYM
2005
Springer
107views Database» more  XSYM 2005»
15 years 7 months ago
Logic Wrappers and XSLT Transformations for Tuples Extraction from HTML
Abstract. Recently it was shown that existing general-purpose inductive logic programming systems are useful for learning wrappers (known as L-wrappers) to extract data from HTML d...
Costin Badica, Amelia Badica
POPL
2012
ACM
13 years 9 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...