Sciweavers

3546 search results - page 503 / 710
» A Causal Logic of Logic Programming
Sort
View
AAAI
1994
14 years 4 days ago
Inducing Deterministic Prolog Parsers from Treebanks: A Machine Learning Approach
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
John M. Zelle, Raymond J. Mooney
BIRTHDAY
2010
Springer
13 years 12 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
CNL
2009
13 years 12 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...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 11 months ago
Cardinality heterogeneities in Web service composition: Issues and solutions
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
Michael Mrissa, Philippe Thiran, Jean-Marie Jacque...
ENTCS
2008
116views more  ENTCS 2008»
13 years 11 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