scientific article; zbMATH DE number 1765679
From MaRDI portal
Publication:4539619
zbMATH Open0988.68608MaRDI QIDQ4539619FDOQ4539619
Enrico Giunchiglia, Massimo Maratea, Davide Zambonin, Armando Tacchella
Publication date: 10 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830347
Title of this publication is not available (Why is that?)
Recommendations
- AI*IA 2005: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 1890620
- Heuristic search and pruning in polynomial constraints satisfaction
- Search techniques for SAT-based Boolean optimization
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
- scientific article; zbMATH DE number 1759450
- Heuristic-based backtracking relaxation for propositional satisfiability
- Optimal satisfiability for propositional calculi and constraint satisfaction problems.
- scientific article; zbMATH DE number 776082
- Progress in Artificial Intelligence
Cited In (11)
- Towards an efficient library for SAT: A manifesto
- Theory and Applications of Satisfiability Testing
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Title not available (Why is that?)
- Heuristic-based backtracking relaxation for propositional satisfiability
- The SAT-based approach to separation logic
- Answer set programming based on propositional satisfiability
- Title not available (Why is that?)
- Evaluation of a Catalytic Search Algorithm
- Title not available (Why is that?)
- Backjumping for quantified Boolean logic satisfiability
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539619)
