Sciweavers

4513 search results - page 665 / 903
» Logic programming with satisfiability
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
ICSE
2010
IEEE-ACM
15 years 8 months ago
Dynamic symbolic data structure repair
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
Ishtiaque Hussain, Christoph Csallner
132
Voted
SIGADA
2001
Springer
15 years 8 months ago
Targeting Ada95/DSA for distributed simulation of multiprotocol communication networks
The last years have seen an increasing, albeit restricted simulation of large-scale networks on shared memory parallel platforms. As the complexity of communication protocols and ...
Dhavy Gantsou
TOOLS
2000
IEEE
15 years 8 months ago
Generic Components to Foster Reuse
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of softwar...
Lothar Baum, Martin Becker
TOOLS
1999
IEEE
15 years 8 months ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee