Practical Aspects of Declarative Languages
12th International Symposium, PADL 2010, Madrid, Spain, January 18-19, 2010. Proceedings
Page
%P
28 Result(s)
-
Chapter
Types, Modes and so Much More – The Prolog Way
We present in a tutorial way some ideas developed in the context of the Ciao Prolog system that we believe could be useful for the future evolution of Prolog. We concentrate primarily on one area: the use of a...
-
Chapter
Prolog: Past, Present, and Future
We argue that various extensions proposed for Prolog—tabling, constraints, parallelism, coroutining, etc.—must be integrated seamlessly in a single system. We also discuss how goal-directed predicate answer se...
-
Chapter and Conference Paper
Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
Automated commonsense reasoning is essential for building human-like AI systems featuring, for example, explainable AI. Event Calculus (EC) is a family of formalisms that model commonsense reasoning with a so...
-
Chapter and Conference Paper
A Haskell Implementation of a Rule-Based Program Transformation for C Programs
Obtaining good performance when programming heterogeneous computing platforms poses significant challenges for the programmer. We present a program transformation environment, implemented in Haskell, where arc...
-
Chapter and Conference Paper
Reversible Language Extensions and Their Application in Debugging
A range of methodologies and techniques are available to guide the design and implementation of language extensions and domain-specific languages on top of a base language. A simple yet powerful technique to t...
-
Chapter and Conference Paper
Supporting Pruning in Tabled LP
This paper analyzes issues which appear when supporting pruning operators in tabled LP. A version of the once/1 control predicate tailored for tabled predicates is presented, and an implementation analyzed and ev...
-
Chapter and Conference Paper
A Segment-Swap** Approach for Executing Trapped Computations
We consider the problem of supporting goal-level, independent and-parallelism (IAP) in the presence of non-determinism. IAP is exploited when two or more goals which will not interfere at run time are schedule...
-
Chapter and Conference Paper
A General Implementation Framework for Tabled CLP
This paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementati...
-
Book and Conference Proceedings
-
Chapter
Correction to: Modeling and Negotiating Service Quality
Correction to: Chapter “Modeling and Negotiating Service Quality” in: M. Papazoglou et al. (Eds.): Service Research Challenges and Solutions for the Future Internet, LNCS 6500, https://doi.org/10...
-
Chapter and Conference Paper
Building Dynamic Models of Service Compositions with Simulation of Provision Resources
Efficient and competitive provision of service compositions depends both on the composition structure, and on planning and management of computational resources necessary for provision. Resource constraints on...
-
Chapter
Analytical Quality Assurance
As we described in Chapter 1, Services are often provisioned within short-term, volatile and highly dynamic (business) processes. These processes are designed in an abstract manner and when instantiated can in...
-
Chapter
Modeling and Negotiating Service Quality
In this chapter the research problems of specifying and negotiating QoS and its corresponding quality documents are analyzed. For this reason, this chapter is separated into two main sections, Section 6.1 and ...
-
Chapter and Conference Paper
A Tabling Implementation Based on Variables with Multiple Bindings
Suspension-based tabling systems have to save and restore computation states belonging to OR branches. Stack freezing combined with (forward) trailing is among the better-known implementation approaches for th...
-
Chapter and Conference Paper
Modeling Concurrent Systems with Shared Resources
Testing is the more widely used approach to (partial) system validation in industry. The introduction of concurrency makes exhaustive testing extremely costly or just impossible, requiring shifting to formal v...
-
Chapter and Conference Paper
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation
Tabled evaluation has proved to be an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. “Native” implementations of tabled evaluation offer go...
-
Chapter and Conference Paper
Automatic Coding Rule Conformance Checking Using Logic Programming
An extended practice in the realm of Software Engineering and programming in industry is the application of coding rules. Coding rules are customarily used to constrain the use (or abuse) of certain programming l...
-
Chapter and Conference Paper
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithm...
-
Chapter and Conference Paper
A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
The growing popularity of multicore architectures has renewed interest in language-based approaches to the exploitation of parallelism. Logic programming has proved an interesting framework to this end, and th...
-
Chapter and Conference Paper
An Improved Continuation Call-Based Implementation of Tabling
Tabled evaluation has been proved an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. Several “native” implementations of tabled evaluation h...
