Back to Results
First PageMeta Content
Applied mathematics / Formal methods / Logic in computer science / Constraint programming / Boolean algebra / Boolean satisfiability problem / Resolution / Unit propagation / Clause / Theoretical computer science / Automated theorem proving / Mathematics


Exploring the Computational Tradeoff of more Reasoning and Less Searching Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario
Add to Reading List

Document Date: 2002-05-15 13:05:48

Open Document

File Size: 61,12 KB

Share Result on Facebook

City

Seattle / Springer-Verlag / Beijing / /

Company

3Sat / CNF / /

/

Facility

Less Searching Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto / University of Pennsylvania / /

IndustryTerm

recursive algorithm / tree search / equality processing / less search / ucsc-bf family equality processing / backtrack-bounded search / search reduction / search tree / web-based framework / basic algorithm / net nodes/second search rate / backtracking tree search / /

Organization

Artifical Intelligence / Reasoning and Less Searching Fahiem Bacchus Dept. of Computer Science University of Toronto Toronto / University of Pennsylvania / CPU Sec / /

Person

Laurent Simon / Min Li / Van Gelder / Bart Selman / Philippe Chatalic / /

/

ProvinceOrState

Pennsylvania / New York / Washington / /

PublishedMedium

Journal of the ACM / Communications of the ACM / Lecture Notes in Computer Science / /

Technology

encryption / filtering algorithm / Propositional Satisfiability Search Algorithms / recursive algorithm / basic algorithm / /

URL

http /

SocialTag