392 publications
 On the Complexity of CCG Parsing (Marco Kuhlmann, Giorgio Satta, Peter Jonsson), In Computational Linguistics, 2018. 
 Constants and Finite Unary Relations in Qualitative Constraint Reasoning (Peter Jonsson), In Artificial Intelligence, volume 257, 2018. 
 Tractability Conditions for Numeric CSPs (Peter Jonsson, Johan Thapper), In Theoretical Computer Science, volume 715, 2018. 
 Why are CSPs Based on Partition Schemes Computationally Hard? (Peter Jonsson, Victor Lagerkvist), In Proceedings of the 43nd International Symposium on Mathematical Foundations of Computer Science (MFCS2018), 2018. 
 The Complexity of Boolean Surjective GeneralValued CSPs (Peter Fulla, Hannes Uppman, Stanislav Zivny), In ACM Transactions on Computation Theory, volume 11, 2018. 
 Classification Transfer for Qualitative Reasoning Problems (Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet), In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI2018), 2018. 
 A Refined Understanding of Costoptimal Planning with Polytree Causal Graphs (Christer Bäckström, Peter Jonsson, Sebastian Ordyniak), In Proceedings of the 11th Annual Symposium on Combinatorial Search (SoCS2018), 2018. 
 Novel Structural Parameters for Acyclic Planning Using Tree Embeddings (Christer Bäckström, Peter Jonsson, Sebastian Ordyniak), In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI2018), 2018. 
 Time Complexity of Constraint Satisfaction via Universal Algebra (Peter Jonsson, Victor Lagerkvist, Biman Roy), In Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS2017), 2017. 
 Strong Partial Clones and the Time Complexity of SAT Problems (Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini), In Journal of Computer and System Sciences, 2017. 
 An Initial Study of Time Complexity in Infinitedomain Constraint Satisfaction (Peter Jonsson, Victor Lagerkvist), In Artificial Intelligence, 2017. 
 Circuit Satisfiability and Constraint Satisfaction around Skolem Arithmetic (Christian Glasser, Peter Jonsson, Barnaby Martin), In Theoretical Computer Science, 2017. 
 Logic + Control: on Program Construction and Verification (Wlodek Drabent), In Theory and Practice of Logic Programming, 2017. 
 Proving Completeness of Logic Programs with the Cut (Wlodek Drabent), In Formal Aspects of Computing, 2017. 
 Complexity of Phylogeny Constraint Satisfaction Problems (Peter Jonsson Manuel Bodirsky, Trung Van Pham), In ACM Transactions on Computational Logic, 2017. 
 A Modeltheoretical View on Qualitative Constraint Reasoning (Manuel Bodirsky, Peter Jonsson), In Journal of Artificial Intelligence Research, 2017. 
 Time and Space Bounds for Planning (Christer Bäckström, Peter Jonsson), In Journal of Artificial Intelligence Research, 2017. 
 Plan Reordering and Parallel Execution  A Parameterized Complexity View (Meysam Aghighi, Christer Bäckström), In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI2017), 2017. 
 The Power of Primitive Positive Definitions with Polynomially Many Variables (Victor Lagerkvist, Magnus Wahlström), In Journal of Logic and Computation, 2016. 
 A Preliminary Investigation of Satisfiability Problems Not Harder than 1in3SAT (Victor Lagerkvist, Biman Roy), In Proc. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS2016), 2016. 
 Strong Partial Clones and the Complexity of Constraint Satisfaction Problems: Limitations and Applications (Victor Lagerkvist), PhD thesis, Linköping University, 2016. 
 Finite Unary Relations and Qualitative Constraint Satisfaction (Peter Jonsson), In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI2016), 2016. 
 Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals (Peter Jonsson, Johan Thapper), In Journal of Computer and System Sciences, 2016. 
 Circuit Satisfiability and Constraint Satisfaction Problems around Skolem Arithmetic (Christian Glaßer, Peter Jonsson, Barnaby Martin), In Proceedings of the 12th Conference on Computability in Europe (CiE2016), 2016. 
 On definite program answers and least Herbrand models (Wlodek Drabent), In Theory and Practice of Logic Programming, 2016. 
 Correctness and completeness of logic programs (Wlodek Drabent), In ACM Transactions on Computational Logics, 2016. 
 The Complexity of Phylogeny Constraint Satisfaction (Manuel Bodirsky, Peter Jonsson, Trung Van Pham), In Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS2016), 2016. 
 The Reducts of the Homogeneous Binary Branching Crelation (Manuel Bodirsky, Peter Jonsson, Trung Van Pham), In Journal of Symbolic Logic, 2016. 
 Upper and Lower Time and Space Bounds for Planning (Christer Bäckström, Peter Jonsson), In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI2016), 2016. 
 Analysing Approximability and Heuristics in Planning Using the Exponentialtime Hypothesis (Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg), In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI2016), 2016. 
 Refining Complexity Analyses in Planning by Exploiting the Exponential Time Hypothesis (Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg), In Annals of Mathematics and Artificial Intelligence, 2016. 
 A Multiparameter Complexity Analysis of Costoptimal and Netbenefit Planning (Meysam Aghighi, Christer Bäckström), In Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS2016), 2016. 
 On Some Combinatorial Optimization Problems: Algorithms and Complexity (Hannes Uppman), PhD thesis, Linköping University, 2015. 
 Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Victor Lagerkvist), In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS2015), 2015. 
 Bounded Bases of Strong Partial Clones (Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini), In Proceedings of the 45th International Symposium on MultipleValued Logic (ISMVL2015), 2015. 
 Parsing to Noncrossing Dependency Graphs (Marco Kuhlmann, Peter Jonsson), In Transactions of the Association for Computational Linguistics, 2015. 
 Constructing NPintermediate Problems by Blowing Holes with Parameters of Various Properties (Peter Jonsson, Victor Lagerkvist, Gustav Nordh), In Theoretical Computer Science, 2015. 
 Upper and Lower Bounds on the Time Complexity of Infinitedomain CSPs (Peter Jonsson, Victor Lagerkvist), In Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP2015), 2015. 
 An Approximabilityrelated Parameter on Graphs  Properties and Applications (Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper), In Discrete Mathematics and Theoretical Computer Science, 2015. 
 Some Fixed Parameter Tractability Results for Planning with Nonacyclic Domaintransition Graphs (Christer Bäckström), In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI2015), 2015. 
 A Complete Parameterized Complexity Analysis of Bounded Planning (Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider), In Journal of Computer and System Sciences, 2015. 
 Tractable Costoptimal Planning over Restricted Polytree Causal Graphs (Meysam Aghighi, Peter Jonsson, Simon Ståhlberg), In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI2015), 2015. 
 Costoptimal and Netbenefit Planning  A Parameterised Complexity View (Meysam Aghighi, Christer Bäckström), In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI2015), 2015. 
 Tractability Frontier for DuallyClosed OrdHorn Quantified Constraint Satisfaction Problems (Michal Wrona), In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS2014), 2014. 
 LocalToGlobal Consistency Implies Tractability of Abduction (Michal Wrona), In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI2014), 2014. 
 Computational Complexity of the Minimum Cost Homomorphism Problem on Threeelement Domains (Hannes Uppman), In Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS2014), 2014. 
 Weak Bases of Boolean Coclones (Victor Lagerkvist), In Information Processing Letters, volume 114, 2014. 
 Polynomially Closed Coclones (Victor Lagerkvist, Magnus Wahlström), In Proceedings of the 44th International Symposium on MultipleValued Logic (ISMVL2014), 2014. 
 Approximability of the Twostage Stochastic Knapsack Problem with Discretely Distributed Weights (Stefanie Kosuch), In Discrete Applied Mathematics, volume 165, 2014. 
 Relating the Time Complexity of Optimization Problems in Light of the ExponentialTime Hypothesis (Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman), In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS2014), 2014. 
 Limitations of Acyclic Causal Graphs for Planning (Anders Jonsson, Peter Jonsson, Tomas Lööw), In Artificial Intelligence, volume 210, 2014. 
 Affine Consistency and the Complexity of Semilinear Constraints (Peter Jonsson, Johan Thapper), In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS2014), 2014. 
 On Completeness of Logic Programs (Wlodek Drabent), In Proceedings of the 24th International Symposium on Logicbased Program Synthesis and Transformation (LOPSTR2014), 2014. 
 Automaton Plans (Christer Bäckström, Anders Jonsson, Peter Jonsson), In Journal of Artificial Intelligence Research, 2014. 
 Parameterising the Complexity of Planning by the Number of Paths in the Domaintransition Graphs (Christer Bäckström), In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI2014), 2014. 
 Oversubscription Planning: Complexity and Compilability (Meysam Aghighi, Peter Jonsson), In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI2014), 2014. 
 ThreeElement MinSol and Conservative MinCostHom (Hannes Uppman), In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP2013), 2013. 
 The Complexity of Abduction for Equality Constraint Languages (Johannes Schmidt, Michal Wrona), In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL2013), 2013. 
 Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis (Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini), In Proceedings of the 24th Annual ACMSIAM Symposium on Discrete Algorithms (SODA2013), 2013. 
 When Acyclicity Is Not Enough: Limitations of the Causal Graph (Anders Jonsson, Peter Jonsson, Tomas Lööw), In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS2013), 2013. 
 Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction (Peter Jonsson, Victor Lagerkvist, Gustav Nordh), In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (CP2013), 2013. 
 Computational Complexity of Linear Constraints over the Integers (Peter Jonsson, Tomas Lööw), In Artificial Intelligence, 2013. 
 Exploiting Structure in CSPrelated Problems (Tommy Färnqvist), PhD thesis, Linköping University, 2013. 
 Paradigms for Parameterized Enumeration (Nadia Creignou, Arne Meier, JulianSteffen Müller, Johannes Schmidt, Heribert Vollmer), In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS2013), 2013. 
 Fast Detection of Unsolvable Planning Instances Using Local Consistency (Christer Bäckström, Peter Jonsson, Simon Ståhlberg), In Proceedings of the 6th Annual Symposium on Combinatorial Search (SoCS2013), 2013. 
 Parameterized Complexity and Kernel Bounds for Hard Planning Problems (Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider), In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC2013), 2013. 
 A Refined View of Causal Graphs and Component Sizes: SPclosed Graph Classes and Beyond (Christer Bäckström, Peter Jonsson), In Journal of Artificial Intelligence Research, 2013. 
 Bridging the Gap Between Refinement and Heuristics in Abstraction (Christer Bäckström, Peter Jonsson), In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI2013), 2013. 
 Syntactically Characterizing LocaltoGlobal Consistency in ORDHorn (Michal Wrona), In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP2012), 2012. 
 MaxSurCSP on Two Elements (Hannes Uppman), In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP2012), 2012. 
 Schedulability Analysis for the Dynamic Segment of FlexRay: A Generalization to Slot Multiplexing (Bogdan Tanasa, Unmesh Bordoloi, Stefanie Kosuch, Petru Eles, Zebo Peng), In RealTime and Embedded Technology and Applications Symposium (RTAS2012), 2012. 
 Stochastic Shortest Path Problem with Uncertain Delays (Jianqiang Cheng, Stefanie Kosuch, Abdel Lisser), In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (ICORES2012), 2012. 
 Counting Homomorphisms via Hypergraphbased Structural Restrictions (Tommy Färnqvist), In 2nd International Symposium on Combinatorial Optimization (ISCO2012), 2012. 
 Constraint Optimization Problems and Bounded Treewidth Revisited (Tommy Färnqvist), In 9th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR2012), 2012. 
 Trichotomies in the Complexity of Minimal Inference (Arnaud Durand, Miki Hermann, Gustav Nordh), In Theory of Computing Systems, volume 50, 2012. 
 A Simple Correctness Proof for Magic Transformation (Wlodek Drabent), In Theory and Practice of Logic Programming, volume 12, 2012. 
 Logic + Control: An Example (Wlodek Drabent), In Proceedings of the 28th International Conference on Logic Programming (ICLP2012), 2012. 
 Guarded OrdHorn: A Tractable Fragment of Quantified Constraint Satisfaction (Hubie Chen, Michal Wrona), In Proceedings of the 19th International Symposium on Temporal Representation and Reasoning (TIME2012), 2012. 
 Essential Convexity and Complexity of Semialgebraic Constraints (Manuel Bodirsky, Peter Jonsson, Timo von Oertzen), In Logical Methods in Computer Science, volume 8, 2012. 
 Horn versus Full Firstorder: Complexity Dichotomies in Algebraic Constraint Satisfaction (Manuel Bodirsky, Peter Jonsson, Timo von Oertzen), In Journal of Logic and Computation, volume 22, 2012. 
 Equivalence Constraints (Manuel Bodirsky, Michal Wrona), In Proceedings of the 21st EACSL Annual Conference on Computer Science Logic (CSL2012), 2012. 
 From Macro Plans to Automata Plans (Christer Bäckström, Anders Jonsson, Peter Jonsson), In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI2012), 2012. 
 The Complexity of Planning Revisited — A Parameterized Analysis (Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, and Stefan Szeider), In Proceedings of the 26th (US) National Conference on Artificial Intelligence (AAAI2012), 2012. 
 Abstracting Abstraction in Search II: Complexity Analysis (Christer Bäckström, Peter Jonsson), In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS2012), 2012. 
 Abstracting Abstraction in Search with Applications to Planning (Christer Bäckström, Peter Jonsson), In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR2012), 2012. 
 Algorithms and Limits for Compact Plan Representation (Christer Bäckström, Peter Jonsson), In Journal of Artificial Intelligence Research, volume 44, 2012. 
 On the complexity of submodular function minimisation on diamonds (Fredrik Kuivinen), In Discrete Optimization, volume 8, 2011. 
 An Ant Colony Optimization Algorithm for the TwoStage Knapsack Problem (Stefanie Kosuch), In Proceedings of the 10th Biennial International Conference on Artificial Evolution (EA2011), 2011. 
 Approximability of the TwoStage Knapsack problem with discretely distributed weights (Stefanie Kosuch), In Proceedings of the 10th CologneTwente Workshop on Graphs and Combinatorial Optimization, 2011. 
 Towards an Ant Colony Optimization algorithm for the TwoStage Knapsack problem (Stefanie Kosuch), In Proceedings of the 7th ALIO/EURO Workshop on Applied Combinatorial Optimization, 2011. 
 Min CSP on four elements: moving beyond submodularity (Peter Jonsson, Fredrik Kuivinen, Johan Thapper), In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP2011), 2011. 
 Discretetime temporal reasoning with Horn DLRs (Peter Jonsson, Tomas Lööw), In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI11), 2011. 
 All PSPACEcomplete Planning Problems are Equal but some are more Equal than Others (Christer Bäckström, Peter Jonsson), In Proceedings of the 4th Annual Symposium on Combinatorial Search (SoCS2011), 2011. 
 Limits for compact representations of plans (Christer Bäckström, Peter Jonsson), In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS2011), 2011. 
 Aspects of a Constraint Optimisation Problem (Johan Thapper), PhD thesis, Linköping University, 2010. 
 A dichotomy theorem for the general minimum cost homomorphism problem (Rustem Takhanov), In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS2010), Schloss Dagstuhl–LeibnizZentrum fuer Informatik, 2010. 
 On the monotonization of a training set (Rustem Takhanov), In Journal of Computational Mathematics and Mathematical Physics, volume 50, 2010. 
 Extensions of the minimum cost homomorphism problem (Rustem Takhanov), In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON2010), Springer, volume 6196, 2010. 
 A note on the hardness of Skolemtype sequences (Gustav Nordh), In Discrete Applied Mathematics, Elsevier, volume 158, 2010. 
 Approximating integer programs with positive righthand sides (Peter Jonsson, Johan Thapper), In Information Processing Letters, Elsevier NorthHolland, Inc., volume 110, 2010. 
 Approximability of clausal constraints (Peter Jonsson, Gustav Nordh), In Theory of Computing Systems, Springer, volume 46, 2010. 
 Retractions to pseudoforests (Tomás Feder, Pavol Hell, Peter Jonsson, Andrei Krokhin, Gustav Nordh), In SIAM Journal on Discrete Mathematics, volume 24, 2010. 
 Hybrid reasoning with nonmonotonic rules (Wlodzimierz Drabent), In Proceedings of the 6th international conference on Semantic technologies for software engineering, ReasoningWeb'10, SpringerVerlag, volume 6325, 2010. 
 Hybrid rules with wellfounded semantics (Wlodzimierz Drabent, Jan Maluszynski), In Knowl. Inf. Syst., Springer, volume 25, 2010. 
 Frozen Boolean partial coclones (Gustav Nordh, Bruno Zanuttini), In Proceedings of the 39th International Symposium on MultipleValued Logic (ISMVL2009), 2009. 
 Algorithms and Hardness Results for Some Valued CSPs (Fredrik Kuivinen), PhD thesis, Linköping University, 2009. 
 Hard constraint satisfaction problems have hard gaps at location 1 (Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen), In Theor. Comput. Sci., volume 410, 2009. 
 Approximability of the maximum solution problem for certain families of algebras (Peter Jonsson, Johan Thapper), In Proceedings of the 4th International Computer Science Symposium in Russia (CSR2009), 2009. 
 Approximability distance in the space of Hcolourability problems (Tommy Färnqvist, Peter Jonsson, Johan Thapper), In Proceedings of the 4th International Computer Science Symposium in Russia (CSR2009), 2009. 
 Properties of an approximabilityrelated parameter on circular complete graphs (Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper), In Proceedings of the 5th Latinamerican Algorithms, Graphs, and Optimization Symposium (LAGOS2009), 2009. 
 Trichotomy in the Complexity of Minimal Inference (Arnaud Durand, Miki Hermann, Gustav Nordh), In Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS2009), 2009. 
 Hybrid Reasoning with Rules and Ontologies (Wlodzimierz Drabent, Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner, Thomas Lukasiewicz, Jan Maluszynski), Chapter in REWERSE, 2009. 
 Semantic Techniques for the Web, The REWERSE Perspective (Francois Bry, Jan Maluszynski), (Francois Bry, Jan Maluszynski, eds.), Springer, volume 5500, 2009. 
 Integration of Rules and Ontologies (Jan Maluszynski), Chapter in Encyclopedia of Database Systems, Springer, 2009. 
 Integer Programming with 2Variable Equations and 1Variable Inequalities (Manuel Bodirsky, Gustav Nordh, Timo von Oertzen), In Proceedings of the 8th CologneTwente Workshop on Graphs and Combinatorial Optimization, CTW 2009, 2009. 
 Semilinear program feasibility (Manuel Bodirsky, Peter Jonsson, Timo von Oertzen), In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP2009), 2009. 
 Integer Programming with 2Variable Equations and 1Variable Inequalities (Manuel Bodirsky, Gustav Nordh, Timo von Oertzen), In Information Processing Letters, volume 109, 2009. 
 Reasoning Web, 4th International Summer School 2008, Venice, Italy, September 711, 2008, Tutorial Lectures (Cristina Baroglio, Piero A. Bonatti, Jan Maluszynski, Massimo Marchiori, Axel Polleres, Sebastian Schaffert (Ed)), In Reasoning Web (Cristina Baroglio, Piero A. Bonatti, Jan Maluszynski, Massimo Marchiori, Axel Polleres, Sebastian Schaffert, eds.), Springer, 2008. 
 FourValued Extension of Rough Sets (Aida Vitória, Andrzej Szalas, Jan Maluszynski), In Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 1719, 2008. Proceedings, Springer, 2008. 
 Perfect Skolem sets (Gustav Nordh), In Discrete Mathematics, volume 308, 2008. 
 What makes propositional abduction tractable (Gustav Nordh, Bruno Zanuttini), In Artificial Intelligence, volume 172, 2008. 
 Paraconsistent Logic Programs with FourValued Rough Sets (Jan Maluszynski, Andrzej Szalas, Aida Vitória), In Rough Sets and Current Trends in Computing, 6th International Conference, RSCTC 2008, Akron, OH, USA, October 2325, 2008, Proceedings, Springer, 2008. 
 Submodular functions on diamonds (Fredrik Kuivinen), In Proceedings of the 7th International Symposium on Combinatorial Optimization (CO2008), 2008. 
 Max Ones generalised to larger domains (Peter Jonsson, Fredrik Kuivinen, Gustav Nordh), In SIAM Journal on Computing, volume 38, 2008. 
 Introduction to the Maximum Solution Problem (Peter Jonsson, Gustav Nordh), Chapter in Complexity of Constraints: An Overview of Current Research Themes (Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer, eds.), SpringerVerlag, 2008. 
 Computational complexity of auditing finite attributes in statistical databases (Peter Jonsson, Andrei Krokhin), In Journal of Computer and System Sciences, volume 74, 2008. 
 A Comparative Study of Industrial Static Analysis Tools (Pär Emanuelsson, Ulf Nilsson), In Electronic Notes in Theoretical Computer Science, volume 217, 2008. (Proc. Systems Software Verification 08.) 
 The approximability of Max CSP with fixedvalue constraints (Vladimir Deineko, Peter Jonsson, Mikael Klasson, Andrei Krokhin), In Journal of the ACM, ACM, volume 55, 2008. 
 Extending XML Query Language Xcerpt by Ontology Queries (Wlodzimierz Drabent, Artur Wilk), In Proceedings of IEEE / WIC / ACM International Conference on Web Intelligence (WI 2007), Silicon Valley, USA, 2007, 2007. 
 Algorithms, Measures, and Upper Bounds for Satisfiability and Related Problems (Magnus Wahlström), PhD thesis, Linköping University, 2007. 
 NPcompleteness of generalized multi Skolem sequences (Gustav Nordh), In Discrete Applied Mathematics, volume 16, 2007. 
 Complexity Dichotomies for CSPrelated Problems (Gustav Nordh), PhD thesis, Linköping University, 2007. 
 A FourValued Logic for Rough SetLike Approximate Reasoning (Jan Maluszynski, Andrzej Szalas, Aida Vitória), In Transactions on Rough Sets, volume 6, 2007. 
 The maximum solution problem on graphs (Peter Jonsson, Gustav Nordh, Johan Thapper), In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS2007), 2007. 
 Ruling out polynomialtime approximation schemes for hard constraint satisfaction problems (Peter Jonsson, Andrei Krokhin, Fredrik Kuivinen), In Proceedings of the 2nd International Computer Science Symposium in Russia (CSR2007), 2007. 
 Maximum Hcolourable subdigraphs and constraint optimization with arbitrary weights (Peter Jonsson, Andrei Krokhin), In Journal of Computer and System Sciences, volume 73, 2007. 
 Bounded treewidth and CSPrelated problems (Tommy Färnqvist, Peter Jonsson), In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC2007), 2007. 
 HDrules: A Hybrid System Interfacing Prolog with DLreasoners (Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszynski), In Proceedings of the ICLP'07 Workshop on Applications of Logic Programming to the Web, Semantic Web and Semantic Web Services, ALPSWS 2007, Porto, CEURWS.org, volume 287, 2007. 
 WellFounded Semantics for Hybrid Rules (Wlodzimierz Drabent, Jan Maluszynski), In Web Reasoning and Rule Systems, Lecture Notes in Computer Science 4524, Springer, 2007. 
 Hybrid Reasoning with Rules and Constraints under WellFounded Semantics (Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszynski), In Web Reasoning and Rule Systems, Lecture Notes in Computer Science 4524, Springer, 2007. 
 A Prototype of a Descriptive Type System for Xcerpt (Artur Wilk, Wlodzimierz Drabent), In PPSWR, Springer, 2006. 
 Refined Counting of Fully Packed Loop Configurations (Johan Thapper), In Séminaire Lotharingien de Combinatoire, volume 56, 2006. 
 An Approach to Post Mortem Diagnosability Analysis for Interacting Finite State Systems (D. Lawesson, U. Nilsson, I. Klein), In Electronic Notes in Theoretical Computer Science, volume 149, 2006. (Proc. of MoChArt 2005) 
 Approximability of bounded occurrence Max Ones (Fredrik Kuivinen), In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS2006), 2006. 
 The approximability of threevalued Max CSP (Peter Jonsson, Mikael Klasson, Andrei Krokhin), In SIAM Journal on Computing, volume 35, 2006. 
 Approximability of integer programming with generalised constraints (Peter Jonsson, Fredrik Kuivinen, Gustav Nordh), In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP2006), 2006. 
 Generalised integer programming based on logically defined relations (Peter Jonsson, Gustav Nordh), In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS2006), 2006. 
 Combining XML querying with ontology reasoning: Xcerpt and DIG (Wlodzimierz Drabent, Artur Wilk), In RuleML06 Workshop: Ontology and Rule Integration, 2006. 
 Towards More Precise Typing Rules for (Wlodzimierz Drabent), In Principles and Practice of Semantic Web Reasoning, 4th International Workshop, PPSWR 2006, Budva, Montenegro, Springer, 2006. 
 Exact Algorithms for Exact Satisfiability (Vilhelm Dahllöf), PhD thesis, Linköping University, 2006. 
 Combining Safe Rules and Ontologies by Interfacing of Reasoners (Uwe Aßmann, Jakob Henriksson, Jan Maluszynski), In PPSWR, Lecture Notes in Computer Science 4187, 2006. 
 Faster exact solving of SAT formulae with a low number of occurrences per variable (Magnus Wahlström), In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT2005), Springer, 2005. 
 An algorithm for the SAT problem for formulae of linear length (Magnus Wahlström), In Proceedings of the 13th Annual European Symposium on Algorithms (ESA2005), Springer, 2005. 
 Reasoning Web 2005 (Norbert Eisinger, Jan Maluszynski (Ed)), (Norbert Eisinger, Jan Maluszynski, eds.), Springer, 2005. 
 RoSy: A Rough Knowledge Base System (Robin Andersson, Aida Vitoria, Jan Maluszynski, Henryk Jan Komorowski), In Rough Sets, Fuzzy Sets, Data Mining, and GranularSoft Computing, Springer, 2005. 
 The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups (Gustav Nordh), In Theoretical Computer Science, volume 345, 2005. 
 A Trichotomy in the Complexity of Propositional Circumscription (Gustav Nordh), In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2005. 
 Propositional Abduction is Almost Always Hard (Gustav Nordh, Bruno Zanuttini), In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI05), 2005. 
 An Approach to Diagnosability Analysis of Interacting Finite State Systems (Dan Lawesson), PhD thesis, Linköping University, 2005. 
 Tight inapproximability results for the maximum solution equation problem over Z_p (Fredrik Kuivinen), In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS2005), Springer, 2005. 
 Adding Clauses to Poor Man's Logic (Without Increasing the Complexity) (Peter Jonsson), In Journal of Applied NonClassical Logics, volume 15, 2005. 
 Towards Types for Web Rule Languages (Wlodzimierz Drabent), Chapter in Reasoning Web 2005, Springer, 2005. 
 Supermodularity on chains and complexity of maximum constraint satisfaction problems (Vladimir Deineko, Peter Jonsson, Mikael Klasson, Andrei Krokhin), In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroCOMB2005), 2005. 
 Applications of General Exact Satisfiability in Propositional Logic Modelling (Vilhelm Dahllöf), In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Springer, 2005. 
 Algorithms for Max Hamming Exact Satisfiability (Vilhelm Dahllöf), In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC2005), Springer, 2005. 
 Counting Models for 2SAT and 3SAT Formulae (Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström), In Theoretical Computer Science, volume 332, 2005. 
 Proving Correctness and Completeness of Normal Programs  A Declarative Approach (Wlodzimierz Drabent, Miroslawa Milkowska), In Theory and Practice of Logic Programming, volume 5, 2005. 
 Descriptive Typing Rules for Xcerpt (Sacha Berger, Emmanuel Coquery, Wlodzimierz Drabent, Artur Wilk), In Principles and Practice of Semantic Web Reasoning, Third International Workshop, PPSWR 2005, Springer, 2005. 
 Partitioning based algorithms for some colouring problems (Ola Angelsmark), In Proceedings of the Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 2005. 
 Algorithms for the Maximum Hamming Distance Problem (Ola Angelsmark, Johan Thapper), In Recent Advances in Constraints, Springer, 2005. 
 A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems (Ola Angelsmark, Johan Thapper), In Proceedings of the 18th International FLAIRS Conference (FLAIRS2005), Special Track on Constraint Solving and Programming, AAAI Press, 2005. 
 Constructing Algorithms for Constraint Satisfaction and Related Problems (Ola Angelsmark), PhD thesis, Linköping University, 2005. 
 Proceedings of the First International Workshop on Teaching Logic Programming: TeachLP 2004, St Malo, (M. Ducass?é, U. Nilsson, D. Seipel, eds.), LiU Epress, 2004. 
 Towards Rough Datalog: Embedding Rough Sets in Prolog (Jan Maluszynski, Aida Vitoria), Chapter in "RoughNeural Computing:Techniques for Computing with Words" (Sankar Pal, Lech Polkowski, Andrzej Skowron, eds.), SpringerVerlag, volume XXV, 2004. 
 Exact Algorithms for Finding Minimum Transversals in Rank3 Hypergraphs (Magnus Wahlström), In Journal of Algorithms, volume 51, 2004. 
 The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups (Gustav Nordh), In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS2004), 2004. 
 An Algebraic Approach to the Complexity of Propositional Circumscription (Gustav Nordh, Peter Jonsson), In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS2004), 2004. 
 The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups (Gustav Nordh, Peter Jonsson), In Proceedings of the 10th Annual International Computing and Combinatorics Conference (COCOON2004), 2004. 
 Constraint satisfaction problems on intervals and lengths (Andrei Krokhin, Peter Jeavons, Peter Jonsson), In SIAM Journal on Discrete Mathematics, volume 17, 2004. 
 Recognizing Frozen Variables in Constraint Satisfaction Problems (Peter Jonsson, Andrei Krokhin), In Theoretical Computer Science, volume 329, 2004. 
 Complexity Classification in Qualitative Temporal Constraint Reasoning (Peter Jonsson, Andrei Krokhin), In Artificial Intelligence, volume 160, 2004. 
 The Complexity of Counting Homomorphisms Seen from the Other Side (Victor Dalmau, Peter Jonsson), In Theoretical Computer Science, volume 329, 2004. 
 Algorithms for Four Variants of the Exact Satisfability Problem (Vilhelm Dahllöf, Peter Jonsson, Richard Beigel), In Theoretical Computer Science, volume 320, 2004. 
 New Algorithms for the Maximum Hamming Distance Problem (Ola Angelsmark, Johan Thapper), In Proceedings of the Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 2004. 
 From rough sets to rough knowledge bases (A. Vitoria, C.V.Damasio, J. Maluszynski), In Fundamenta Informaticae, volume 57, 2003. 
 Query Answering in Rough Knowledge Bases (A. Vitoria, C.V.Damasio, J. Maluszynski), In Proceedings of the Nineth Int. Conf. on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing RSFDGrC'2003) (G.Wang, Q.Liu, Y.Y. Yao, A. Skowron, eds.), SpringerVerlag, volume 2639, 2003. 
 On integrating rules into the Semantic Web (Jan Maluszynski), In Electronic Notes in Theoretical Computer Science (G. Vidal, ed.), Elsevier, volume 86, 2003. 
 Principles and Practice of Semantic Web Reasoning (F. Bry, N. Henze, J. Maluszynski(eds.)), SpringerVerlag, volume 2901, 2003. 
 On Types for XML Query Language Xcerpt (A. Wilk, W. Drabent), In International Workshop, PPSWR 2003, Mumbai, India, December 8, 2003, Proceedings, Springer Verlag, 2003. (ISBN: 3540205829) 
 Fault Isolation in Discrete Event Systems by Observational Abstraction (D. Lawesson, U. Nilsson, I. Klein), In Proc of 42nd IEEE Conf on Decision and Control (CDC), Maui Hawaii, IEEE Computer Society Press, 2003. 
 Fault Isolation Using Automatic Abstraction To Avoid State Space Explosion (D. Lawesson, U. Nilsson, I. Klein), In Workshop on Model Checking and Artificial Intelligence, Acapulco, 2003. 
 Model Checking Based Fault Isolation Using Automatic Abstraction (D. Lawesson, U. Nilsson, I. Klein), In Proc. of the 14th Intl Workshop of Principles of Diagnosis, Washington DC, 2003. 
 Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra (Andrei Krokhin, Peter Jeavons, Peter Jonsson), In Journal of the ACM, volume 5, 2003. 
 Point algebras for temporal reasoning: Algorithms and complexity (Mathias Broxvall, Peter Jonsson), In Artificial Intelligence, volume 2, 2003. 
 Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems (Ola Angelsmark, Peter Jonsson), In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP2003), 2003. 
 Static and Dynamic Slicing of Constraint Logic Programs (G.Szilagyi, T.Gyimothy, J. Maluszynski), In Automated Software Engineering, volume 9, 2002. 
 Towards Rough Datalog: embedding Rough Sets in Prolog (J. Maluszynski, A. Vitoria), In RoughNeuro Computing (L. Polkowski S. K. Pal, A. Skowron eds, eds.), SpringerVerlag, 2002. (To appear) 
 Fault Isolation using Process Algebra Models (Dan Lawesson, Ulf Nilsson, Inger Klein), In 13th Intl Workshop on Principles of Diagnosis, DX02, 2002. 
 The Complexity of Constraints on Intervals and Lengths (Andrei Krokhin, Peter Jeavons, Peter Jonsson), In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS2002), 2002. 
 Extending the Point Algebra into the Qualitative Algebra (Andrei Krokhin, Peter Jonsson), In Proceedings of the 9th International Symposium on Temporal Representation and Reasoning (TIME2002), 2002. 
 Using parametric set constraints for locating errors in CLP programs (W. Drabent, J. Maluszynski, P. Pietrzak), In Theory and Practice of Logic Programming, volume 2, 2002. 
 Counting Satisfying Assignments in 2SAT and 3SAT (Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström), In Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON2002), 2002. 
 An Algorithm for Counting Maximum Weighted Independent Sets and its Applications (Vilhelm Dahllöf, Peter Jonsson), In Proceedings of the 13th Annual ACMSIAM Symposium on Discrete Algorithms (SODA2002), 2002. 
 A Logic Based Asynchronous MultiAgent System (P. Dell'Acqua, U. Nilsson, L.M. Pereira), In Electronic Notes in Theoretical Computer Science, Elsevier, volume 70, 2002. 
 Constraint Satisfaction on Infinite Domains: Composing Domains and Decomposing Constraints (Mathias Broxvall), In Proceedings of the 8th International Conference on Principles on Knowledge Representation and Reasoning (KR2002), Morgan Kaufmann, 2002. 
 Disjunctions, Independence, Refinements (Mathias Broxvall, Peter Jonsson, Jochen Renz), In Artificial Intelligence, volume 140, 2002. 
 A Method for Metric Temporal Reasoning (Mathias Broxvall), In Proceedings of the 18th (US) National Conference on Artificial Intelligence (AAAI2002), 2002. 
 Finite Domain Constraint Satisfaction Using Quantum Computation (Vilhelm Dahllöf Ola Angelsmark, Peter Jonsson), In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS2002), 2002. 
 Determining the Number of Solutions to Binary CSP Instances (Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper), In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP2002), 2002. 
 A Complete Classification of Complexity in Allen's Algebra in the Presence of a NonTrivial Basic Relation (Andrei Krokhin, Peter Jeavons, Peter Jonsson), In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI01), 2001. 
 Parametric Descriptive Types for (C)LP (W. Drabent, J. Maluszynski, P. Pietrzak), In The 10th International French Speaking Conference for Logic and Constraint Programming (P. Codognet, ed.), Hermes Science Publications, 2001. 
 Semantic Inspection of Software Artifacts: From Theory To Practice (Tim Heyer), PhD thesis, Dept of Computer and Information Science, Linköping University, 2001. 
 Semantic Inspection of UML Designs (Tim Heyer), In Proc. of the 1st Workshop on Inspection in Software Engineering, WISE'01, 2001. 
 ModelChecking Based Fault Isolation in UML (Dan Lawesson, Ulf Nilsson, Inger Klein), In Proc. 12th Intl Workshop on Principles of Diagnosis, DX01, 2001. 
 Proving Correctness and Completeness of Normal Programs: A Declarative Approach (W. Drabent, M. Milkowska), In Proceedings of the 17th International Conf. on Logic Programming (ICLP'01), SpringerVerlag, 2001. 
 Unavoidable Configurations of Parameterized Rings of Processes (Marie Duflot, Laurent Fribourg, Ulf Nilsson), In Proc. CONCUR'01, SpringerVerlag, 2001. 
 The Point Algebra for Branching Time Revisited (Mathias Broxvall), In Proceedings of the 17th Joint German/Austrin Conference on Artificial Intelligence (KI2001), 2001. 
 Constraint Logic Programming for Local and Symbolic Modelchecking (Ulf Nilsson, Johan L?übcke), In Proc. of the Int'l Conf. on Computational Logic (CL2000), SpringerVerlag, 2000. 
 Towards Behavioral Model Fault Isolation for Object Oriented Control Systems (Dan Lawesson), PhD thesis, Dept of Computer and Information Science, Linköping University, 2000. 
 Fault Isolation in Object Oriented Control Systems (M. Larsson, I. Klein, D. Lawesson, U. Nilsson), In IFAC SAFEPROCESS 2000, Budapest, 2000. 
 Boolean Constraint Satisfaction: Complexity Results for Optimization Problems with Arbitrary Weights (Peter Jonsson), In Theoretical Computer Science, volume 244, 2000. 
 Towards Efficient Universal PlanningA Randomized Approach (Peter Jonsson, Patrik Haslum, Christer Bäckström), In Artificial Intelligence, volume 117, 2000. 
 Planning with Reduced Operator Sets (Patrik Haslum, Peter Jonsson), In Proc. of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS2000), 2000. 
 Locating Type Errors in Untyped CLP Programs (W. Drabent, J. Maluszynski, P. Pietrzak), In Analysis and Visualization Tools for Constraint Programming, SpringerVerlag, 2000. 
 Typebased Diagnosis of CLP Programs (W. Drabent, J. Maluszynski, P. Pietrzak), In Electronic Notes in Theoretical Computer Science, volume 30, 2000. 
 Building Tractable Disjunctive Constraints (David Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis), In Journal of the ACM, volume 47, 2000. 
 Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints (Mathias Broxvall, Peter Jonsson, Jochen Renz), In Proc. of the Sixth International Conference on Principles and Practice of Constraint Programming (CP2000), 2000. 
 Disjunctive Temporal Reasoning in Partially Ordered Time Structures (Mathias Broxvall, Peter Jonsson), In Proceedings of the 17th (US) National Conference on Artificial Intelligence (AAAI2000), 2000. 
 Constraints, Adjunctions and (Co)algebras (Ola Angelsmark), In Workshop on Coalgebraic Methods in Computer Science (CMCS2000), Berlin, 2000. 
 Some Observations on Durations, Scheduling and Allen's Algebra (Ola Angelsmark, Peter Jonsson), In Proc. of the Sixth International Conference on Principles and Practice of Constraint Programming (CP2000), 2000. 
 Onthefly Model Checking of CTL Formulas using Constraint Logic Programming (Johan L?übcke, Ulf Nilsson), In Intl Workshop of Constraint Programming for Timecritical Applications, Lisbon, 1999. 
 Efficient Planning for a Miniature Assembly Line (Inger Klein, Peter Jonsson, Christer Bäckström), In Artificial Intelligence in Engineering, volume 13, 1999. 
 Computational Complexity of Relating Time Points with Intervals (Peter Jonsson, Thomas Drakengren, Christer Bäckström), In Artificial Intelligence, volume 109, 1999. 
 Strong Bounds on the Approximability of Two PSPACEhard Problems in Propositional Planning (Peter Jonsson), In Annals of Mathematics and Artificial Intelligence, volume 26, 1999. 
 Unique Kernel Diagnosis (Anders Henriksson), PhD thesis, Linköping University, 1999. 
 Some Results on the Complexity of Planning with Incomplete Information (Patrik Haslum, Peter Jonsson), In Proc. of the Fifth European Conference on Planning (ECP99), 1999. 
 It Is Declarative: On Reasoning about Logic Programs (Wlodek Drabent), In Intl Conf on Logic Programming, Las Cruces, NM, 1999. 
 Type Analysis for CHIP (W. Drabent, P. Pietrzak), In Proc. of the Seventh International Conference on Algebraic Methotology and Software Technology (AMAST'98), SpringerVerlag, 1999. 
 Typebased Diagnosis of CLP Programs (Wlodek Drabent, Jan Maluszynski, Pawel Pietrzak), In Proc. of 10th Workshop on Logic Programming Environments, Las Cruces, NM, 1999. 
 Diagnosis of CHIP programs using type information (Marco Comini, Wlodek Drabent, Pawel Pietrzak), In APPIAGULPPRODE'99  1999 Joint Conference on Declarative Programming, L'Aquila Italy, 1999. 
 Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time (Mathias Broxvall, Peter Jonsson), In Proc. of the Fifth International Conference on Principles and Practice of Constraint Programming (CP'99), SpringerVerlag, 1999. 
 Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP (Marcus Bjäreland, Peter Jonsson), In Proc. of the Fifth International Conference on Principles and Practice of Constraint Programming (CP'99), SpringerVerlag, 1999. 
 Static Incorrectness Diagnosis of CLP(FD) (Pawel Pietrzak), PhD thesis, Linköping University, 1998. 
 The Reviewer's Workbench: An Internet Tool for Program Committees (Ulf Nilsson), In PAPPACT 98: Practical Applications of Prolog and Constraint Technology, 1998. 
 Detailed Design of Avionics Control Software (U. Nilsson, S. Streiffert, A. Törne), In Proc of 19th IEEE RealTime Systems Symposium, 1998. 
 CTL Model Checking using Tabled Logic Programs (Johan L?übcke, Ulf Nilsson), In Intl Workshop of Constraint Programming for Timecritical Applications, Nice, 1998. 
 Nearoptimal Nonapproximability Results for Some NPO PBcomplete Problems (Peter Jonsson), In Information Processing Letters, volume 68, 1998. 
 Tractable plan existence does not imply tractable plan generation (Peter Jonsson, Christer Bäckström), In Annals of Mathematics and Artificial Intelligence, volume 22, 1998. 
 Statevariable Planning Under Structural Restrictions: Algorithms and Complexity (Peter Jonsson, Christer Bäckström), In Artificial Intelligence, volume 100, 1998. 
 A Unifying Approach to Temporal Constraint Reasoning (Peter Jonsson, Christer Bäckström), In Artificial Intelligence, volume 102, 1998. 
 A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in $P\omega$ (Thomas Drakengren), In Theoretical Comptuer Science, volume 193, 1998. 
 Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic (Thomas Drakengren, Peter Jonsson), In Journal of Logic and Computation, volume 8, 1998. 
 A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations (Thomas Drakengren, Peter Jonsson), In Artificial Intelligence, volume 106, 1998. 
 Computational Aspects of Reordering Plans (Christer Bäckström), In Journal of Artificial Intelligence Research, volume 9, 1998. 
 Tabulated Resolution for Wellfounded Semantics (Roland Bol, Lars Degerstedt), In J. of Logic Programming, volume 34, 1998. 
 Directional Types and the Annotation Method (J. Boye, J. Małuszyński), In J. Logic Programming, volume 33, 1997. (The postscript gives an early version..) 
 Towards a Complete Classification of Tractability in Allen's Algebra (Thomas Drakengren, Peter Jonsson), In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI97), Morgan Kaufmann, 1997. 
 Reasoning About Action in Polynomial Time (Thomas Drakengren, Marcus Bjäreland), In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI97), Morgan Kaufmann, 1997. 
 Declarative Diagnosis of Constraint Programs: an Assertion Based Approach (J. Boye, W. Drabent, J. Maluszynski), In Proceedings of AADEBUG'97 (Third International Workshop on Automated Debugging), 1997. (Linköping, Sweden) 
 A FloydHoare Method for Prolog (W. Drabent), In Linköping Electronic Articles in Computer and Information Science, volume 2, 1997. (A former version was presented at a postconference workshop "Verification and Analysis of Logic Programs" at JICSLP '96.) 
 Type Inference for CLP(FD) (Pawel Pietrzak), In Proc of Intl Logic Programming Symposium 97, MIT Press, 1997. (Poster. Extended version in the Workshop on Tools and Environments for (Constraint) Logic Programming, 1997) 
 Automatic Verification of Petri Nets in a CLP Framework (Hans Olsen), PhD thesis, Linköping University, 1997. 
 A Decompositional Approach for Computing Least FixedPoints of Datalog Programs with ZCounters (Laurent Fribourg, Hans Olsen), In Journal of Constraints, volume 2, 1997. 
 Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic (Laurent Fribourg, Hans Olsen), In CONCUR'97, 1997. 
 The Program Committee Virtual Workbench (Ulf Nilsson), In 2nd International Workshop on Logic Programming Tools for Internet Applications, 1997. (Invited talk) 
 A Nonapproximability Result for Finite Function Generation (Peter Jonsson), In Information Processing Letters, volume 63, 1997. 
 Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time (Thomas Drakengren, Peter Jonsson), In Journal of Artificial Intelligence Research, volume 7, 1997. 
 A Complete Classification of Tractability in RCC5 (Peter Jonsson, Thomas Drakengren), In Journal of Artificial Intelligence Research, volume 6, 1997. 
 Declarative Error Diagnosis of GAPLog Programs (Fredrik Eklund), PhD thesis, Linköping University, 1997. 
 Algorithms and Complexity for Temporal and Spatial Formalisms (Thomas Drakengren), PhD thesis, Linköping University, 1997. 
 Twentyone Large Tractable Subclasses of Allen's Algebra (Thomas Drakengren, Peter Jonsson), In Artificial Intelligence, volume 93, 1997. 
 It is declarative: On Proving Partial Correctness of Logic Programs (W Drabent), In Workshop on Verification, Model Checking and Abstract Interpretation, 1997. 
 On the Role of Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs (F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M. Hermenegildo, J. Maluszynski, G. Puebla), In Proceedings of AADEBUG'97 (The Third International Workjshop on Automated Debugging), 1997. 
 Automatic Synthesis of Control Programs in Polynomial Time for an Assembly Line (Inger Klein, Peter Jonsson, Christer Bäckström), In Proceedings of the IEEE Conference on Decision and Control (CDC96), 1996. 
 Tractable Subclasses of the PointInterval Algebra: A Complete Classification (Peter Jonsson, Thomas Drakengren, Christer Bäckström), In Proceedings of the 5th International Conference on Principles on Knowledge Representation and Reasoning (KR96) (J. Doyle, L. Aiello, eds.), Morgan Kaufmann, 1996. 
 Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report (Thomas Drakengren, Peter Jonsson), In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI96), 1996. 
 A LinearProgramming Approach to Temporal Reasoning (Peter Jonsson, Christer Bäckström), In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI96), 1996. 
 On the Size of Reactive Plans (Peter Jonsson, Christer Bäckström), In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI96), 1996. 
 Planning with Abstraction Hierarchies can be Exponentially Less Efficient (Christer Bäckström, Peter Jonsson), In 4th International Symposium of AI and Mathematics, 1996. (Invited talk. Only abstract published.) 
 Tractable plan existence does not imply tractable plan generation (Peter Jonsson, Christer Bäckström), In 4th International Symposium of AI and Mathematics, 1996. 
 Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic (Laurent Fribourg, Hans Olsen), Technical report, LIENS9624 Ecole Normale Superieure, 1996. 
 A Decompositional Approach for Computing Least FixedPoints of Datalog Programs with ZCounters (Laurent Fribourg, Hans Olsen), Technical report, LIENS9612 Ecole Normale Superieure, 1996. 
 Reductions of Petri nets and Unfolding of Propositional Logic Programs (Laurent Fribourg, Hans Olsen), In LOPSTR'96, 1996. 
 Studies in Action Planning: Algorithms and Complexity (Peter Jonsson), PhD thesis, Linköping University, 1996. 
 Uniqueness of Scott's Reflexive Domain in $P\omega$ (Thomas Drakengren), In Theoretical Comptuer Science, volume 155, 1996. 
 Completeness of SLDNFResolution for Nonfloundering Queries (W. Drabent), In J. of Logic Programming, volume 27, 1996. 
 Tabulationbased Logic Programming: A Multilevel View of Query Answering (Lars Degerstedt), PhD thesis, Linköping University, 1996. 
 On Negation as Instantiation (A. Di Pierro, W. Drabent), In 5th International Conf. Algebraic and Logic Programming (M. Hanus, M. RodriguezArtalejo, eds.), SpringerVerlag, 1996. 
 Directional Types in Logic Programming (Johan Boye), PhD thesis, Linköping University, 1996. 
 Tractable Planning for an Assembly Line (Inger Klein, Peter Jonsson, Christer Bäckström), In New Directions in AI Planning: EWSP'95—3rd European Workshop on Planning (Malik Ghallab, Alfredo Milani, eds.), IOS Press, 1995. 
 Incremental Planning (Peter Jonsson, Christer Bäckström), In New Directions in AI Planning: EWSP'95—3rd European Workshop on Planning (Malik Ghallab, Alfredo Milani, eds.), IOS Press, 1995. 
 Five Years of Tractable Planning (Christer Bäckström), In New Directions in AI Planning: EWSP'95—3rd European Workshop on Planning (Malik Ghallab, Alfredo Milani, eds.), IOS Press, 1995. 
 Planning with Abstraction Hierarchies can be Exponentially Less Efficient (Christer Bäckström, Peter Jonsson), In Proceedings of the Symposium on Abstraction, Reformulation and Approximation, SARA95 (Alon Levy, Pandurang Nayak, eds.), 1995. (Same paper as IJCAI'95) 
 Planning with Abstraction Hierarchies can be Exponentially Less Efficient (Christer Bäckström, Peter Jonsson), In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI95) (Chris Mellish, ed.), Morgan Kaufmann, 1995. 
 Abstract Interpretation: A Kind of Magic (Ulf Nilsson), In Theoretical Comp. Sci., volume 142, 1995. 
 What is failure? An Approach to Constructive Negation (Wlodek Drabent), In Acta Informatica, volume 32, 1995. 
 Datalog Programs with Arithmetical Constraints: Hierarchic, Periodic and Spiralling Least Fixpoints (Laurent Fribourg, Hans Olsen), Technical report, LIENS9526 Ecole Normale Superieure, 1995. 
 Logic, Programming and Prolog (U. Nilsson, J. Małuszyński), John Wiley, 1995. 
 Exploiting Groundness in Logic Programs (Andreas Kågedal), PhD thesis, Linköping University, 1995. 
 Complexity of Statevariable Planning Under Structural Restrictions (Peter Jonsson), PhD thesis, Linköping University, 1995. 
 Magic Computation for Wellfounded Semantics (L. Degerstedt, U. Nilsson), In Nonmonotonic Extensions of Logic Programming, SpringerVerlag, 1995. 
 Expressive Equivalence of Planning Formalisms (Christer Bäckström), In Artificial Intelligence, volume 76, 1995. (ARTINT 1234.) 
 Complexity Results for SAS$^+$ Planning (Christer Bäckström, Bernhard Nebel), In Computational Intelligence, volume 11, 1995. 
 Two Aspects of Directional Types (J. Boye, J. Małuszyński), In Proc. of Int'l Conf on Logic Programming 95, MIT Press, 1995. 
 Directional Types and the Assertion Method (J. Boye, J. Małuszyński), Technical report, INRIA Rocquencourt, 1995. (RR2471) 
 Optimization of GAPLog programs (Fredrik Eklund, Andreas Kågedal), In Proceedings of the Tenth Logic Programming Workshop (N. E. Fuchs, G. Gottlob, eds.), 1994. (Report no. 94.10) 
 Complexity Results for StateVariable Planning under Mixed Syntactical and Structural Restrictions (Peter Jonsson, Christer Bäckström), In Proceedings of the 6th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA94) (Philippe Jorrand, ed.), World Scientific Publishing, 1994. 
 Reasoning about RunTime Properties of Logic Programs (Wlodek Drabent), Invited lecture at BENELOG 1994, Sixth Benelux Workshop on Logic Programming, 1994. 
 Executing Parallel Plans Faster by Adding Actions (Christer Bäckström), In Proceedings of the 11th European Conference on Artificial Intelligence (ECAI94) (Anthony G. Cohn, ed.), Wiley, 1994. 
 Tractable Planning with State Variables by Exploiting Structural Restrictions (Peter Jonsson, Christer Bäckström), In Proceedings of the 12th (US) National Conference on Artificial Intelligence (AAAI94), 1994. 
 An Implementation of Gaplog with Dataflow Declarations (P. Sundblad), Master's thesis, Linköping University, 1994. (Report no: LiTHIDAEx9424) 
 Multipass evaluation of functional logic programs (J. Paakki), Chapter in Proc. 21th ACM Symposium on Principles of Programming Languages, The ACM, 1994. 
 Collage Induction: Proving Properties of Logic Programs by Program Synthesis (H. Olsén), Technical report 464, Department of Computer and Information Science, 1994. 
 A Dataflow Analysis Method for Ground Prolog (A. Kågedal), Chapter in Proceedings of the 11th International Conference on Logic Programming (Pascal Van Hentenryck, ed.), The MIT Press, 1994. (Poster abstract) 
 Felsökning i GAPLog: En modell för exekvering av logikprogram med fördröjda funktionsanrop (Tim Heyer), Master's thesis, Linköping University, 1994. (Reportno: LiTHIDAEx9441. The report is in Swedish) 
 Direct, Dual and Contrapositive Proofs by Induction (L. Fribourg, H. Olsén), Chapter in Proc. of International Workshop on Logic Program Synthesis and Transformation, LOPSTR'94, Preprints, Pisa University, 1994. 
 Synthesis of Directionality Information for GAPLog Programs (Fredrik Eklund), Master's thesis, Linköping University, 1994. 
 Planning using Transformation between Equivalent Formalisms: A Case Study of Efficiency (Christer Bäckström), In Comparative Analysis of AI Planning Systems (David Wilkins, ed.), 1994. (Held in conjunction with AAAI94 shortciteaaai94) 
 Finding Least Constrained Plans and Optimal Parallel Executions is Harder than We thought (Christer Bäckström), In Current Trends in AI Planning: EWSP'93—2nd European Workshop on Planning (Christer Bäckström, Erik Sandewall, eds.), IOS Press, 1993. 
 Tractable Planning Problems: A Challenge for Deductive Planning (Christer Bäckström), In Deductive Approaches to Plan Generation and Plan Recognition (Susanne Biundo, Richard Waldinger, eds.), 1993. (All talks invited. Only abstracts published.) 
 Completeness of SLDNFResolution for Nonfloundering Queries (W. Drabent), In Logic Programming  Proceedings of the 1993 International Symposium (D. Miller, ed.), MIT Press, 1993. (A poster abstract) 
 Complexity Results for SAS$^+$ Planning (Christer Bäckström, Bernhard Nebel), In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI93) (Ruzena Bajcsy, ed.), Morgan Kaufmann, 1993. 
 Goaldirected Bottomup Evaluation of Normal Logic Programs (U. Nilsson), In Proc. of the International Logic Programming Symposium, \rm Vancouver, MIT Press, 1993. (Poster abstract) 
 Logic Programs with External Procedures (J. Małuszyński, S. Bonnier, J. Boye, A. Kågedal, F. Klu\'zniak, U. Nilsson), Chapter in Logic Programming Languages, Constraints, Functions, and Objects (K.R. Apt, J.W. de Bakker, J.J.M.M. Rutten, eds.), The MIT Press, 1993. 
 Improvements to CompileTime Analysis for Ground Prolog (A. Kågedal), Chapter in Programming Language Implementation and Logic Programming 93 (M. Bruynooghe, J. Penjam, eds.), SpringerVerlag, 1993. (LNCS 724) 
 Automatic Diagnosis of VLSI Circuits Using Algorithmic Debugging (K. Kuchcinski, W. Drabent, J. Małuszynski), Chapter in AADEBUG'93, Proc. of the 1st Int. Workshop on Automated and Algorithmic Debugging (Peter Fritzson, ed.), SpringerVerlag, 1993. (LNCS 749) 
 SLSresolution Without Floundering (W. Drabent), In Proc. 2nd International Workshop on Logic Programming and NonMonotonic Reasoning (L. M. Pereira, A. Nerode, eds.), MIT Press, 1993. 
 Tabulated Resolution for Wellfounded Semantics (L. Degerstedt), PhD thesis, Linköping University, 1993. 
 A Grammatical View of Logic Programming (P. Deransart, J. Małuszynski), MIT Press, 1993. 
 Dependencybased Groundness Analysis of Functional Logic Programs (Johan Boye), Technical report 398, Department of Computer and Information Science, 1993. 
 Avoiding Dynamic Delays in Functional Logic Programs (J. Boye), In Programming Language Implemantation and Logic Programming 93 (M. Bruynooghe, J. Penjam, eds.), SpringerVerlag, 1993. 
 Dependencybased Groundness Analysis of Functional Logic Programs (Johan Boye, Jukka Paakki, Jan Małuszyński), Technical report IDAR9320, Dept of Computer and Information Science, 1993. 
 Synthesis of Directionality Information for Functional Logic Programs (J. Boye, J. Paakki, J. Małuszynski), Chapter in Proc. of the Workshop on Static Analysis, WSA'93 (P. Cousot, M. Falaschi, G. Filé, A. Rauzy, eds.), SpringerVerlag, 1993. 
 Tabulated Resolution for WellFounded Semantics (R. Bol, L. Degerstedt), Chapter in Proc. of the 1993 International Logic Programming Symposium (D. Miller, ed.), MIT Press, 1993. 
 Equivalence and Tractability Results for SAS$^+$ Planning (Christer Bäckström), In Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR92) (Bill Swartout, Bernhard Nebel, eds.), Morgan Kaufmann, 1992. 
 Uncertainty and Parallelism in Action Structures (Christer Bäckström), In ECAI92 Workshop: Beyond Sequential Planning (Gerd Grosse, ed.), 1992. 
 On the Computational Complexity of Planning and Story Understanding (Christer Bäckström, Bernhard Nebel), In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI92) (Bernd Neumann, ed.), Wiley, 1992. 
 On the Computational Complexity of Temporal Projection and Plan Validation (Bernhard Nebel, Christer Bäckström), In Proceedings of the 10th (US) National Conference on Artificial Intelligence (AAAI92), 1992. 
 Computational Complexity of Reasoning about Plans (Christer Bäckström), PhD thesis, Linköping University, 1992. 
 A Formal Basis for Horn Clause Logic with External Polymorphic Functions (S. Bonnier), PhD thesis, Linköping University, 1992. 
 Towards a Methodology for the Design of Abstract Machines for Logic Programming Languages (U. Nilsson), In Journal of Logic Programming, volume 16, 1992. 
 Abstract Interpretations & Abstract Machines: Contributions to a Methodology for the Implementation of Logic Programs (U. Nilsson), PhD thesis, Department of Computer and Information Science, 1992. 
 Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems (G. Lindstrom, J. Maluszynski, T. Ogi), Chapter in Programming Language Implementation and Logic Programming 92 (M. Bruynooghe, M. Wirsing, eds.), SpringerVerlag, 1992. (LNCS 631) 
 Logic Programming with External Procedures: An Implementation (A. Kågedal), Technical report 326, Department of Computer and Information Science, 1992. 
 A Unifying View of Structural Induction and Computation Induction for Logic Programs (L. Fribourg, H. Olsén), Chapter in Proc. of Logic Program Synthesis and Transformation (LOPSTR 92), SpringerVerlag, 1992. (Workshops in Computing series) 
 What is Failure? Or: Constructive Negation by Fail Answers (W. Drabent), In Proc. of the International Conference on Computing and Information, ICCI'92, IEEE Computer Society Press, 1992. 
 Logic Programs with Polymorphic Types: A Condition for Static Type Checking (S. Bonnier, J. Wallgren), In Proc. 3rd International Workshop on Conditional Term Rewriting Systems (M. Rusinowitsch, J.L. Rémy, eds.), SpringerVerlag, 1992. 
 On the Planning Problem in Sequential Control (Inger Klein, Christer Bäckström), In Proceedings of the 30th IEEE Conference on Decision and Control (CDC91), 1991. 
 Planning in Polynomial Time: The SASPUBS Class (Christer Bäckström, Inger Klein), In Computational Intelligence, volume 7, 1991. 
 Parallel NonBinary Planning in Polynomial Time (Christer Bäckström, Inger Klein), In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI91) (Ray Reiter, John Mylopoulos, eds.), Morgan Kaufmann, 1991. 
 Enriching Prolog with SUnification (A. Kågedal, F. Klu\'zniak), In PHOENIX Seminar and Workshop on Declarative Programming (J. Darlington, R. Dietrich, eds.), SpringerVerlag, 1991. 
 Our LIPS are Sealed: Interfacing SML and Logic Programming (G. Lindstrom, J. Maluszynski, T. Ogi), In Proc. of the Third Int. Workshop on Standard ML (R. Harper, ed.), 1991. 
 Semantics of Disjunctive Logic Programs and Deductive Databases (T. Przymusinski), Technical report LiTHIDAR9132, Department of Computer and Information Science, 1991. (accepted to The Second Int. Conference on Deductive and ObjectOriented Databases, Munich December 1991) 
 Stable Semantics for Disjunctive Logic Programs (T. Przymusinski), Technical report LiTHIDAR9122, Department of Computer and Information Science, 1991. (to appear in Journal of New Generation Computing) 
 Induction using Extended Prolog Execution and ProofExtraction (H. Olsén), Master's thesis, Linköping University, 1991. 
 Abstract Interpretation: A Kind of Magic (U. Nilsson), Chapter in Programming Language Implementation and Logic Programming 91 (J. Maluszynski, M. Wirsing, eds.), SpringerVerlag,, 1991. (Extended version to appear in Theoretical Computer Science) 
 Attribute Grammars and Logic Programs: A Comparison of Concepts (J. Maluszynski), Chapter in Attribute Grammars, Applications and Systems, Prague Summer School (H. Alblas, B. Melichar, eds.), SpringerVerlag, 1991. 
 SPILL: A Specification Language Based on Logic Programming (F. Kluzniak), Technical report LiTHIDAR9128, Department of Computer and Information Science, 1991. 
 PageBreak: An Exercise in Specification and Derivation (F. Kluzniak), Technical report LiTHIDAR9127, Department of Computer and Information Science, 1991. 
 Towards Practical Executable Specifications in Logic (F. Kluzniak), Technical report LiTHIDAR9126, Department of Computer and Information Science, 1991. 
 A Decision Procedure for a Subtheory of Linear Arithmetic with Lists (L. Fribourg), Technical report LiTHIDAR9133, Department of Computer and Information Science, 1991. 
 Constructive Negation by Fail Answers (W. Drabent), Technical report LiTHIDAR9123, Department of Computer and Information Science, 1991. 
 Strict Completion of Logic Programs (W. Drabent, M. Martelli), In New Generation Computing, volume 9, 1991. 
 Operational Completeness of Logic Programs with External Procedures (J. Boye), Master's thesis, Linköping University, 1991. (Report no: LiTHIDAEx9104) 
 SSLDResolution: An Operational Semantics for Logic Programs with External Procedures (J. Boye), Chapter in Programming Language Implementation and Logic Programming 91 (J. Maluszynski, M. Wirsing, eds.), SpringerVerlag, 1991. 
 Unification in Incompletely Specified Theories: A Case Study (S. Bonnier), Chapter in Mathematical Foundations of Computer Science 1991 (A. Tarlecki, ed.), SpringerVerlag, 1991. 
 A Simple Fixed Point Characterization of ThreeValued Stable Model Semantics (S. Bonnier, U. Nilsson, T. Näslund), In Information Processing Letters, volume 40, 1991. 
 Planning in Polynomial Time (Christer Bäckström, Inger Klein), In Expert Systems in Engineering: Principles and Applications. International Workshop (G Gottlob, W Nejdl, eds.), Springer, volume 462, 1990. 
 Debugging Prolog Programs Declaratively (S. NadjmTehrani), Chapter in Proc. of META'90 (M. Bruynooghe, ed.), MIT Press, 1990. 
 Systematic Semantic Approximations of Logic Programs (U. Nilsson), Chapter in Programming Language Implementation and Logic Programming 90 (P. Deransart, J. Małuszynski, eds.), SpringerVerlag, 1990. (LNCS 456) 
 SLDFAResolution  Computing Answers for Negative Queries (T. Näslund), Technical report 253, Department of Computer and Information Science, 1990. 
 Logic, Programming and Prolog (U. Nilsson, J. Małuszynski), Wiley and Sons, 1990. 
 What Kind of Grammars are Logic Programs. (P. Deransart, J. Maluszynski), Chapter in Logic and Logic Grammars for Language Processing (P. SaintDizier, S. Szpakowicz, eds.), Ellis Horwood, 1990. 
 Logical Modelling of Simplified Geometrical Objects and Mechanical Assembly Processes (Christer Bäckström), In Advances in Spatial Reasoning (SuShing Chen, ed.), Ablex, volume 1, 1990. 
 A Systematic Approach to Abstract Interpretation of Logic Programs (U. Nilsson), Technical report 196, Department of Computer and Information Science, 1989. 
 Towards a Framework for the Abstract Interpretation of Logic Programs (U. Nilsson), In Programming Language Implementation and Logic Programming 88, SpringerVerlag, 1989. 
 Contributions to the Declarative Approach to Debugging Prolog Programs (S. NadjmTehrani), Technical report 187, Department of Computer and Information Science, 1989. 
 Fail Substitutions for Negation as Failure (J. Małuszynski, T. Näslund), Chapter in Proc. of NACLP (E.L. Lusk, R.A. Overbeek, eds.), MIT Press, 1989. 
 Algorithmic Debugging with Assertions (W. Drabent, S. NadjmTehrani, J. Maluszynski), In Metaprogramming in Logic Programming (H. Abramson, M.H. Rogers, eds.), MIT Press, 1989. 
 A Grammatical View of Logic Programming (P. Deransart, J. Małuszyński), In Programming Language Implementation and Logic Programming 88, SpringerVerlag, 1989. 
 Horn Clause Logic with External Procedures: Towards a Theoretical Framework. (S. Bonnier), Technical report 197, Department of Computer and Information Science, 1989. 
 A Representation of Coordinated Actions Characterized by Interval Valued Conditions (Christer Bäckström), In Proceedings of the 3rd International Symposium on Methodologies for Intelligent systems (ISMIS88) (Zbigniew W Ras, Lorenza Saitta, eds.), NorthHolland, 1988. 
 Action Structures with Implicit Coordination (Christer Bäckström), In Proceedings of the 3rd International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA88) (Tim O'Shea, Vasil Sgurev, eds.), NorthHolland, 1988. 
 A Representation of Coordinated Actions (Christer Bäckström), In Proceedings of the 1st Scandinavian Conference on Artificial Intelligence (SCAI88) (Thore Danielsen, ed.), IOS Press, 1988. (em Award winning paper) 
 Logic Programming with External Procedures: Introducing SUnification (J. Leszczylowski, S. Bonnier, J. Małuszyński), In Information Processing Letters, volume 27, 1988. 
 The Use of Assertions in Algorithmic Debugging (W. Drabent, S. NadjmTehrani, J. Małuszyński), In Proc. of Fifth Generation Computer Systems 88, 1988. 
 Inductive Assertion Method for Logic Programs (W. Drabent, J. Małuszyński), In Theoretical Computer Science, volume 59, 1988. 
 Towards a Clean Amalgamation of Logic Programs with External Procedures (S. S. Bonnier, J. Małuszyński), In Proc. of International Conference and Symposium on Logic Programming 88, MIT Press, 1988. (Also in \em Proc. of PLILP '88, LNCS 348, SpringerVerlag, 1989) 
 Do Logic Programs Resemble Programs in Conventional Languages? (W. Drabent), In Proceedings of 1987 Symposium on Logic Programming, 1987. 
 AID: An Alternative Implementation of DCGs (Ulf Nilsson), In New Generation Comput., volume 4, 1986. 
 Relating Logic Programs and Attribute Grammars (P. Deransart, J. Małuszyński), In J.\ of Logic Programming, volume 2, 1985. 
 Modelling Data Dependencies in Logic Programs by Attribute Grammars (P. Deransart, J. Małuszyński), Technical report RR 323, INRIA, 1984. 
