Sciweavers

378 search results - page 29 / 76
» Higher-order transformation of logic programs
Sort
View
LOPSTR
2009
Springer
14 years 3 months ago
A Transformational Approach for Proving Properties of the CHR Constraint Store
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe
PLANX
2007
13 years 10 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
NMELP
1994
14 years 17 days ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
CC
1998
Springer
134views System Software» more  CC 1998»
14 years 22 days ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
ENTCS
2002
125views more  ENTCS 2002»
13 years 8 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...