Sciweavers

1199 search results - page 109 / 240
» Automated Extraction of Problem Structure
Sort
View
DATE
2007
IEEE
146views Hardware» more  DATE 2007»
14 years 3 months ago
Data-flow transformations using Taylor expansion diagrams
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...
SAT
2010
Springer
125views Hardware» more  SAT 2010»
14 years 1 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
CADE
2005
Springer
14 years 9 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
BMCBI
2005
99views more  BMCBI 2005»
13 years 9 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
ICLP
1999
Springer
14 years 1 months ago
Event, Property, and Hierarchy in Order-Sorted Logic
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...
Ken Kaneiwa, Satoshi Tojo