Solving 3-SAT using constraint programming and fail detection

Authors:
Gary Yat-Chung Wong;K. Y. Wong;K. H. Yeung
Affiliations:
Dept. of Electronic Engineering, City University of Hong Kong, Hong Kong;Computer Studies Program, Macao Polytechnic Institute, Macao;Dept. of Electronic Engineering, City University of Hong Kong, Hong Kong
Venue:
AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
Year:
2005

Citing 8
Cited 0

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Arc and path consistence revisited

Artificial Intelligence
Backtrack-free and backtrack-bounded search

Search in Artificial Intelligence
Network-based heuristics for constraint satisfaction problems

Search in Artificial Intelligence
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The object-relational database management systems (ORDBMS) appear due to the common acceptance of the object oriented paradigm and its integration with relational databases, combining the powerful modelling capabilities of the object oriented model and ...