- Extending and Implementing the Stable Model Semantics Patrik Simons 1 , Ilkka Niemela 2 , and Timo Soininen 3
- Petri Net Analysis and Nonmonotonic Reasoning Keijo Heljanko and Ilkka Niemela
- The E#ect of Structural Branching on the E#ciency of Clause Learning SAT Solving
- On the Impact of Stratication on the Complexity of Nonmonotonic Reasoning
- Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits
- Incorporating Learning in Grid-Based Randomized SAT Solving
- BMC'03 Preliminary Version BMC via On-the-Fly Determinization
- Solving Alternating Boolean Equation Systems in Answer Set Programming
- Unified Configuration Knowledge Representation Using Weight Constraint Rules
- Planning as satisfiability: parallel plans and algorithms for plan search
- Towards EOEcient Default Reasoning Ilkka Niemel#
- Unfolding Partiality and Disjunctions in Stable Model Semantics Tomi Janhunen, Ilkka Niemela, Patrik Simons
- Justification-Based Non-Clausal Local Search for SAT Matti Jarvisalo and Tommi Junttila and Ilkka Niemela1
- Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits #
- Incorporating Learning in GridBased Randomized SAT Solving
- A Comparison of the Static and the Disjunctive Wellfounded Semantics and its Implementation
- Extending the Smodels System with Cardinality and Weight Constraints
- Strategies for Solving SAT in Grids by Randomized Antti E. J. Hyvrinen, Tommi Junttila, and Ilkka Niemel
- DisLoP: A Research Project on Disjunctive Logic Programming
- Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
- Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
- A Tableau Calculus for Minimal Model Ilkka Niemela
- A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning
- Representing Con guration Knowledge With Weight Constraint Rules Timo Soininen
- Planning as satisfiability: parallel plans and algorithms for plan search
- A Fixpoint De nition of Dynamic Constraint Satisfaction
- Bounded LTL Model Checking with Stable Models #
- Hyper Tableaux Peter Baumgartner \Delta Ulrich Furbach \Delta Ilkka Niemela
- Stable Model Semantics of Weight Constraint Ilkka Niemela 1 , Patrik Simons 1 , and Timo Soininen 2
- Autoepistemic Logic as a Basis for Automating Nonmonotonic
- On the Impact of Stratication on the Complexity of Nonmonotonic Ilkka Niemel#
- Finding MAPs for Belief Networks using Rule-based Constraint Programming
- Solving Alternating Boolean Equation Systems in Answer Set Programming
- Implementing Circumscription Using a Tableau Method Ilkka Niemel a 1
- Towards an Ecient Tableau Method for Boolean Circuit Satis ability Checking
- Answer Set Programming without Unstratified Ilkka Niemela
- Prioritized Component Systems Gerhard Brewka
- Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
- Evaluating an Algorithm for Default Reasoning Ilkka Niemel# and Patrik Simons
- Smodels an implementation of the stable model and wellfounded semantics for normal logic
- JustificationBased Local Search with Adaptive Noise Strategies
- Developing a Declarative Rule Language for Applications in Product Con guration
- Efficient Implementation of the Well founded and Stable Model Seman
- The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving
- Strategies for Solving SAT in Grids by Randomized Antti E. J. Hyvrinen, Tommi Junttila, and Ilkka Niemel
- Justification-Based Local Search with Adaptive Noise Strategies
- JustificationBased NonClausal Local Search for SAT Matti J arvisalo and Tommi Junttila and Ilkka Niemel a 1
- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
