Sciweavers

2018 search results - page 252 / 404
» Code Normal Forms
Sort
View
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
14 years 12 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
COMMA
2008
14 years 11 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
LREC
2008
134views Education» more  LREC 2008»
14 years 11 months ago
Generating a Morphological Lexicon of Organization Entity Names
This paper describes methods used for generating a morphological lexicon of organization entity names in Croatian. This resource is intended for two primary tasks: template-based ...
Nikola Ljubesic, Tomislava Lauc, Damir Boras
LREC
2008
155views Education» more  LREC 2008»
14 years 11 months ago
OpenCCG Workbench and Visualization Tool
Combinatorial Category Grammar is (CCG) a lexicalized grammar formalism which is expressed by syntactic category, a logical form representation. There are difficulties in represen...
Thepchai Supnithi, Suchinder Singh, Taneth Ruangra...
PLANX
2008
14 years 11 months ago
XML Stream Processing Using a Lazy Concurrent Language
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
Shin-Cheng Mu, Ta-Chung Tsai, Keisuke Nakano