1391 search results - page 41 / 279 » Completeness of Neighbourhood Logic |
RTA
1995
Springer
14 years 17 days ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
FPGA
1998
ACM
14 years 1 months ago
1998
ACM
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
ICLP
1995
Springer
14 years 17 days ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
APAL
2008
13 years 9 months ago
2008
A propositional logic of explicit proofs, LP, was introduced in [2], completing a project begun long ago by G