Sciweavers

1729 search results - page 204 / 346
» Deterministic Expressions in C
Sort
View
DOCENG
2003
ACM
14 years 3 months ago
Handling syntactic constraints in a DTD-compliant XML editor
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Y. S. Kuo, Jaspher Wang, N. C. Shih
CP
2003
Springer
14 years 3 months ago
Semi-automatic Modeling by Constraint Acquisition
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
Remi Coletta, Christian Bessière, Barry O'S...
WOLLIC
2010
Springer
14 years 3 months ago
On Anaphora and the Binding Principles in Categorial Grammar
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
Glyn Morrill, Oriol Valentín
KR
2010
Springer
14 years 3 months ago
Set-Oriented Logical Connectives: Syntax and Semantics
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
Stuart C. Shapiro
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 2 months ago
Solving large-scale linear circuit problems via convex optimization
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...