Sciweavers

3983 search results - page 470 / 797
» Conceptual logic programs
Sort
View
PPDP
1999
Springer
15 years 8 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 6 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 4 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
SEMWEB
2010
Springer
15 years 2 months ago
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
Carlos Viegas Damásio, José Jú...
DIMACS
1996
15 years 5 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin