Sciweavers

2148 search results - page 235 / 430
» From process logic to program logic
Sort
View
PPDP
2010
Springer
13 years 6 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
AI
2007
Springer
13 years 8 months ago
From here to human-level AI
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...
John McCarthy
SIGSOFT
2007
ACM
14 years 9 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
ADC
1999
Springer
97views Database» more  ADC 1999»
14 years 17 days ago
Pseudo-Naive Evaluation
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
Donald A. Smith, Mark Utting
ICALP
2007
Springer
14 years 2 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk