16 search results - page 3 / 4 » Checking Full Satisfiability of Conceptual Models |
AAAI
2006
13 years 11 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
SAC
2010
ACM
13 years 9 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
DLOG
2009
13 years 7 months ago
2009
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
SIGSOFT
2009
ACM
14 years 10 months ago
2009
ACM
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
ASPLOS
2011
ACM
13 years 1 months ago
2011
ACM
This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E’s use in developing practical tools for comprehensive perfo...