Sciweavers

3470 search results - page 299 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
173
Voted
ICTAC
2005
Springer
16 years 3 days ago
A Rewriting Logic Sampler
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
José Meseguer
ASP
2003
Springer
15 years 12 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
PPDP
1999
Springer
15 years 11 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie
EUSAI
2007
Springer
15 years 8 months ago
A Compiler for the Smart Space
Developing applications for smart spaces is a challenging task. Most programming systems narrowly focus on the embedded computer infrastructure and neglect the spatial aspect of th...
Urs Bischoff, Gerd Kortuem
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 6 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur