Sciweavers

611 search results - page 43 / 123
» Yuri, Logic, and Computer Science
Sort
View
AIR
2010
96views more  AIR 2010»
14 years 10 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
ASM
2004
ASM
15 years 3 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
DIS
2006
Springer
15 years 1 months ago
Prediction of Domain-Domain Interactions Using Inductive Logic Programming from Multiple Genome Databases
Protein domains are the building blocks of proteins, and their interactions are crucial in forming stable protein-protein interactions (PPI) and take part in many cellular processe...
Thanh Phuong Nguyen, Tu Bao Ho
LICS
2007
IEEE
15 years 4 months ago
Local Action and Abstract Separation Logic
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yan...
BIRTHDAY
1992
Springer
15 years 1 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson