Sciweavers

300 search results - page 55 / 60
» An extension of the Cayley-Sylvester formula
Sort
View
BIRTHDAY
2008
Springer
13 years 10 months ago
From Domain to Requirements
This is a discursive paper. That is, it shows some formulas (but only as examples so that the reader may be convinced that there is, perhaps, some substance to our claims), no theo...
Dines Bjørner
DATE
2008
IEEE
142views Hardware» more  DATE 2008»
13 years 9 months ago
Algorithms for Maximum Satisfiability using Unsatisfiable Cores
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
João Marques-Silva, Jordi Planes
AAAI
2004
13 years 9 months ago
Making Argumentation More Believable
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting ar...
Anthony Hunter
FLAIRS
2001
13 years 9 months ago
Detection of Inconsistencies in Complex Product Configuration Data Using Extended Propositional SAT-Checking
We present our consistency support tool BIS, an extension to the electronic product data management system (EPDMS) used at DaimlerChrysler AG to configure the Mercedes lines of pa...
Carsten Sinz, Andreas Kaiser, Wolfgang Küchli...
FMOODS
2003
13 years 9 months ago
Inheritance of Temporal Logic Properties
Abstract. Inheritance is one of the key features for the success of objectoriented languages. Inheritance (or specialisation) supports incremental design and re-use of already writ...
Heike Wehrheim