Checking depth-limited consistency and inconsistency in knowledge-based systems

International Journal of Intelligent Systems

Volumn 16, Issue 3, 2001, Pages 319-331

  Millns, Iain ^a   Eaglestone, Barry ^b  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DEPTH PERCEPTION; HEURISTIC PROGRAMMING; RANDOM PROCESSES;

COMBINATORIAL SPACE EXPLOSION; DEPTH LIMITED CONSISTENCY;

KNOWLEDGE BASED SYSTEMS;

EID: 0035278983     PISSN: 08848173     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-111X(200103)16:3<319::AID-INT1010>3.0.CO;2-U     Document Type: Article

References (13)

1. La saturation au secours de la non-monotonie
2. The complexity of theorem proving procedures
3. Pushing the envelope: Planning, propositional logic, and stochastic search
4. ModGen: Theorem proving by model generation
5. Verification of knowledge bases: A unifying logical view
6. Tabu search for SAT
7. Boosting complete technique thanks to local search methods
8. The breakout method for escaping from local minima
9. Computational challenges in propositional reasoning and search
10. Local search strategies for satisfiability testing
11. A new method for solving hard satisfiability problems