Sciweavers

6554 search results - page 902 / 1311
» Constraint Logic Programming
Sort
View
CNL
2009
15 years 7 months ago
The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
Marcos Cramer, Bernhard Fisseni, Peter Koepke, Dan...
ENTCS
2008
116views more  ENTCS 2008»
15 years 6 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
ACTAC
2002
75views more  ACTAC 2002»
15 years 6 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
AROBOTS
1998
113views more  AROBOTS 1998»
15 years 6 months ago
Grounding Mundane Inference in Perception
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
Ian Horswill
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
A Model for Coherent Distributed Memory For Race Condition Detection
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
Franck Butelle, Camille Coti