Sciweavers

47 search results - page 9 / 10
» Solving the Round Robin Problem Using Propositional Logic
Sort
View
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 11 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
AUSAI
2004
Springer
14 years 14 days ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
AI
2007
Springer
13 years 7 months ago
Learning action models from plan examples using weighted MAX-SAT
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
Qiang Yang, Kangheng Wu, Yunfei Jiang
FSS
2007
102views more  FSS 2007»
13 years 7 months ago
Extraction of fuzzy rules from support vector machines
The relationship between support vector machines (SVMs) and Takagi–Sugeno–Kang (TSK) fuzzy systems is shown. An exact representation of SVMs as TSK fuzzy systems is given for ...
Juan Luis Castro, L. D. Flores-Hidalgo, Carlos Jav...