Sciweavers

1776 search results - page 268 / 356
» Using a Logic Programming Language with Persistence and Cont...
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 1 months 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...
KBSE
2003
IEEE
14 years 2 months ago
A Programmable Client-Server Model: Robust Extensibility via DSLs
The client-server model has been successfully used to support a wide variety of families of services in the context of distributed systems. However, its server-centric nature make...
Charles Consel, Laurent Réveillère
ICMLA
2008
13 years 10 months ago
A Fully Automatic Crossword Generator
This paper presents a software system that is able to generate crosswords with no human intervention including definition generation and crossword compilation. In particular, the ...
Leonardo Rigutini, Michelangelo Diligenti, Marco M...
HICSS
1998
IEEE
128views Biometrics» more  HICSS 1998»
14 years 1 months ago
A Situation Calculus Model of Hypertext
We utilize the situation calculus to develop a logical model of hypertext systems. The work builds upon the earlier work of Bieber and Kimbrough in the logical modeling of hyperte...
Richard B. Scherl, Michael Bieber, Fabio Vitali
APAL
2008
104views more  APAL 2008»
13 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy