1455 search results - page 213 / 291 » Programming in Logic with Constraints for Natural Language P... |
CP
2007
Springer
15 years 3 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
KI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
121
click to vote
ANSOFT
2002
14 years 9 months ago
2002
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
101
click to vote
MODELS
2010
Springer
14 years 8 months ago
2010
Springer
Formal analysis can be used to verify that a model of the system adheres to its requirements. As such, traditional formal analysis focuses on whether known (desired) system propert...
IFIP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Applying changes to software engineering processes in organisations usually raises many problems of varying nature. Basing on a real-world 2-year project and a simultaneo...