Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are combined according to combinators whi...
详细信息
ISBN:
(纸本)9781581134452
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are combined according to combinators which express the desired optimization criteria. Constraint Handling Rules (CHRs) constitute a high-level natural formalism to specify constraint solvers and propagation algorithms. In this paper we present a framework to design and specify soft constraint solvers by using CHRs. In this way, we extend the range of applicability of CHRs to soft constraints rather than just classical ones, and we provide a straightforward implementation for soft constraint solvers.
A formal model for similarity-based fuzzy unification in multi-adjoint logic programs is presented. On this computational model, a similarity-based unification approach is constructed by simply adding axioms of fuzzy ...
详细信息
The evaluation games for the first-order logic and least fixed point logics and their algorithmic complexity were analyzed. The complexity of a model checking problem having two inputs, a structure and a formula, can ...
详细信息
The evaluation games for the first-order logic and least fixed point logics and their algorithmic complexity were analyzed. The complexity of a model checking problem having two inputs, a structure and a formula, can be measured in terms of both inputs, and is referred to as the combined complexity of the model checking problem. Model checking problems, for almost any logic, can be cast as strategy problems for appropriate model checking games. For first-order logic, evaluation games are very simple in the sense that winning conditions are positional, and that games are well-founded, which means that all possible plays are finite.
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for ...
详细信息
Temporal logic is widely used for specifying hardware and software systems. Typically two types of properties are distinguished, safety and liveness properties. While safety can easily be checked by reachability analy...
详细信息
We present a logic programming based asynchronous multi-agent system in which agents can communicate with one another;update themselves and each other;abduce hypotheses to explain observations, and use them to generat...
详细信息
Constraint programming is recognized as an efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction with other optimization paradigms such as local search, yiel...
详细信息
Constraint programming is recognized as an efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction with other optimization paradigms such as local search, yielding hybrid algorithms with constraints. Such combinations lack a language supporting an elegant description and retaining the original declarativity of Constraint logic programming. We propose a language, SALSA, dedicated to specifying (local, global or hybrid) search algorithms. We illustrate its use on a few examples from combinatorial optimization for which we specify complex optimization procedures with a few simple lines of code of high abstraction level. We report preliminary experiments showing that such a language can be implemented on top of CP systems, yielding a powerful environment for combinatorial optimization.
BDI logics, introduced by Rao et al., have been used as the theoretical basis of specification and implementation of rational agents. The aim of our research is to make full use of the expressive power of BDI logics a...
详细信息
The main contribution of this paper is a formal characterization of recursive object specifications based on a denotational untyped semantics of the object calculus and the discussion of existence of those (recursive)...
详细信息
ISBN:
(纸本)0769514839
The main contribution of this paper is a formal characterization of recursive object specifications based on a denotational untyped semantics of the object calculus and the discussion of existence of those (recursive) specifications. The semantics is then applied to prove soundness of a programminglogic [2] for the object calculus [1] and to suggest possible extensions. For the purposes of this discussion we use an informal logic of predomains in order to avoid any commitment to a particular syntax of specification logic.
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that improves the time and memory efficienc...
详细信息
暂无评论