Sciweavers

925 search results - page 12 / 185
» Connectivity on Complete Lattices
Sort
View
ACL
2007
15 years 1 months ago
Grammar Approximation by Representative Sublanguage: A New Model for Language Learning
We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic ...
Smaranda Muresan, Owen Rambow
JSYML
2007
85views more  JSYML 2007»
14 years 11 months ago
Substructural fuzzy logics
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
George Metcalfe, Franco Montagna
EJC
2010
14 years 11 months ago
Connectivity of chamber graphs of buildings and related complexes
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Anders Björner, Kathrin Vorwerk
IMR
2004
Springer
15 years 5 months ago
Finite Element Mesh Sizing for Surfaces Using Skeleton
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
William Roshan Quadros, Steven J. Owen, Michael L....
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 3 months ago
Binary Sequent Calculi for Truth-invariance Entailment of Finite Many-valued Logics
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new binary sequ...
Zoran Majkic