Sciweavers

2236 search results - page 235 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
CADE
2008
Springer
16 years 6 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
PPDP
2010
Springer
15 years 4 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
KCAP
2003
ACM
15 years 11 months ago
Modularisation of domain ontologies implemented in description logics and related formalisms including OWL
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
Alan L. Rector
WSC
1998
15 years 7 months ago
Input Modeling Tools for Complex Problems
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
Barry L. Nelson, Michael Yamnitsky
TIME
2007
IEEE
16 years 23 days ago
Multilingual Extension of Temporal Expression Recognition Using Parallel Corpora
This paper presents the automatic extension of TERSEO to other languages, a knowledge-based system for the recognition and normalization of temporal expressions, originally develo...
Marcel Puchol-Blasco, Estela Saquete, Patricio Mar...