Publication:4804883
From MaRDI portal
zbMath1010.68530MaRDI QIDQ4804883
Publication date: 1 May 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2404/24040017.htm
Related Items
Well-founded operators for normal hybrid MKNF knowledge bases, Unnamed Item, Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction, A pearl on SAT and SMT solving in Prolog, Solving constraint satisfaction problems with SAT modulo theories, New methods for proving the impossibility to solve problems through reduction of problem spaces, Formalization and implementation of modern SAT solvers, M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures, Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis, Compact and efficiently verifiable models for concurrent systems, Uncertain logic processing: logic-based inference and reasoning using Dempster-Shafer models, Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable, Long-distance Q-resolution with dependency schemes, Processes and continuous change in a SAT-based planner, Building Bridges Between Sets of Partial Orders, An Algorithm for Direct Construction of Complete Merged Processes