Sciweavers

844 search results - page 97 / 169
» More On Implicit Syntax
Sort
View
127
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 8 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
138
Voted
ECSQARU
2007
Springer
15 years 7 months ago
Approaches to Constructing a Stratified Merged Knowledge Base
Many merging operators have been proposed to merge either flat or stratified knowledge bases. The result of merging by such an operator is a flat base (or a set of models of the me...
Anbu Yue, Weiru Liu, Anthony Hunter
142
Voted
GI
2009
Springer
15 years 7 months ago
An Eclipse Framework for Rapid Development of Rich-featured GEF Editors based on EMF Models
Abstract: Model-based development has an increasing importance in modern software engineering and other domains. Visual models such as Petri nets and UML diagrams proved to be an a...
Tony Modica, Enrico Biermann, Claudia Ermel
EMNLP
2007
15 years 5 months ago
Syntactic Re-Alignment Models for Machine Translation
We present a method for improving word alignment for statistical syntax-based machine translation that employs a syntactically informed alignment model closer to the translation m...
Jonathan May, Kevin Knight
152
Voted
AAAI
2000
15 years 5 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski