Sciweavers

2585 search results - page 208 / 517
» Automating Coherent Logic
Sort
View
CSL
2010
Springer
15 years 7 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
LISP
2006
160views more  LISP 2006»
15 years 6 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
CL
1999
Springer
15 years 6 months ago
An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
Jimmy Ho-Man Lee, Ho-fung Leung
WWW
2004
ACM
16 years 7 months ago
CTR-S: a logic for specifying contracts in semantic web services
A requirements analysis in the emerging field of Semantic Web Services (SWS) (see http://daml.org/services/swsl/requirements/) has identified four major areas of research: intelli...
Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan
LPAR
2001
Springer
15 years 11 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin