Sciweavers

1461 search results - page 86 / 293
» Analysis of Constraint Logic Programs
Sort
View
OOPSLA
2001
Springer
15 years 2 months ago
Points-To Analysis for Java using Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
ATAL
2007
Springer
15 years 1 months ago
Negotiation by abduction and relaxation
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
Chiaki Sakama, Katsumi Inoue
AGP
1994
IEEE
15 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
SAS
2001
Springer
15 years 2 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CP
2006
Springer
15 years 1 months ago
Constraint Based Resilience Analysis
Abstract. In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in mo...
Helmut Simonis