Sciweavers

590 search results - page 110 / 118
» From Relational Specifications to Logic Programs
Sort
View
AI
2008
Springer
13 years 7 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
TACS
2001
Springer
13 years 12 months ago
Lightweight Analysis of Object Interactions
The state of the practice in object-oriented software development has moved beyond reuse of code to reuse of conceptual structures such as design patterns. This paper draws attenti...
Daniel Jackson, Alan Fekete
AI
2010
Springer
13 years 7 months ago
Interactive semantics
instruments. A melody expresses abstract artistic conception or emotion. The explanation ability plays the key role in the externalization and internalization from one form of expr...
Hai Zhuge
BMCBI
2008
242views more  BMCBI 2008»
13 years 7 months ago
annot8r: GO, EC and KEGG annotation of EST datasets
Background: The expressed sequence tag (EST) methodology is an attractive option for the generation of sequence data for species for which no completely sequenced genome is availa...
Ralf Schmid, Mark L. Blaxter