Sciweavers

382 search results - page 48 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 3 days ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
LOPSTR
2004
Springer
14 years 1 months ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
Santiago Escobar, José Meseguer, Prasanna T...
POPL
2001
ACM
14 years 8 months ago
A generic type system for the Pi-calculus
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
Atsushi Igarashi, Naoki Kobayashi
SAS
2004
Springer
14 years 1 months ago
On Logics of Aliasing
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
Marius Bozga, Radu Iosif, Yassine Lakhnech
ATAL
2006
Springer
13 years 11 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...