Michal Wrona. Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014). 2014.
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt and Hannes Uppman. Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014). 2014.
Peter Jonsson and Johan Thapper. Affine Consistency and the Complexity of Semilinear Constraints. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014). 2014.
Christer Bäckström. Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs. In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI-2014). 2014.
Michal Wrona. Local-To-Global Consistency Implies Tractability of Abduction. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-2014). 2014.
Meysam Aghighi and Peter Jonsson. Oversubscription Planning: Complexity and Compilability. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-2014). 2014.
Victor Lagerkvist. Weak Bases of Boolean Co-clones. Information Processing Letters, To appear.
Anders Jonsson, Peter Jonsson and Tomas Lööw. Limitations of Acyclic Causal Graphs for Planning. Artificial Intelligence, To appear.
Victor Lagerkvist and Magnus Wahlström. Polynomially Closed Co-clones. In Proceedings of the 44th International Symposium on Multiple-Valued Logic (ISMVL-2014). 2014.
Hannes Uppman. Computational Complexity of the Minimum Cost Homomorphism Problem on Three-element Domains. In Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS-2014). 2014.
Stefanie Kosuch. Approximability of the Two-stage Stochastic Knapsack Problem with Discretely Distributed Weights. Discrete Applied Mathematics, Vol 165, 2014.
Johannes Schmidt and Michal Wrona. The Complexity of Abduction for Equality Constraint Languages. In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL-2013). 2013.
Peter Jonsson, Victor Lagerkvist and Gustav Nordh. Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (CP-2013). 2013.
Christer Bäckström and Peter Jonsson. A Refined View of Causal Graphs and Component Sizes: SP-closed Graph Classes and Beyond. Journal of Artificial Intelligence Research, 2013.
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt and Heribert Vollmer. Paradigms for Parameterized Enumeration. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-2013). 2013.
Christer Bäckström, Peter Jonsson and Simon Ståhlberg. Fast Detection of Unsolvable Planning Instances Using Local Consistency. In Proceedings of the 6th Annual Symposium on Combinatorial Search (SoCS-2013). 2013.
Hannes Uppman. Three-Element Min-Sol and Conservative Min-Cost-Hom. In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP-2013). 2013.
Christer Bäckström and Peter Jonsson. Bridging the Gap Between Refinement and Heuristics in Abstraction. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-2013). 2013.
Peter Jonsson and Tomas Lööw. Computational Complexity of Linear Constraints over the Integers. Artificial Intelligence, 2013.
Anders Jonsson, Peter Jonsson and Tomas Lööw. When Acyclicity Is Not Enough: Limitations of the Causal Graph. In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS-2013). 2013.
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak and Stefan Szeider. Parameterized Complexity and Kernel Bounds for Hard Planning Problems. In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC-2013). 2013.
Peter Jonsson, Victor Lagerkvist, Gustav Nordh and Bruno Zanuttini. Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2013). 2013.
Wlodek Drabent. A Simple Correctness Proof for Magic Transformation. Theory and Practice of Logic Programming, 12(6), 2012.
Manuel Bodirsky, Peter Jonsson and Timo von Oertzen. Essential Convexity and Complexity of Semi-algebraic Constraints. Logical Methods in Computer Science, 8(4), 2012.
Manuel Bodirsky and Michal Wrona. Equivalence Constraints. In Proceedings of the 21st EACSL Annual Conference on Computer Science Logic (CSL-2012). 2012.
Hannes Uppman. Max-Sur-CSP on Two Elements. In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP-2012). 2012.
Michal Wrona. Syntactically Characterizing Local-to-Global Consistency in ORD-Horn. In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP-2012). 2012.
Manuel Bodirsky, Peter Jonsson and Timo von Oertzen. Horn versus Full First-order: Complexity Dichotomies in Algebraic Constraint Satisfaction. Journal of Logic and Computation, Vol 22, 2012.
Hubie Chen and Michal Wrona. Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. In Proceedings of the 19th International Symposium on Temporal Representation and Reasoning (TIME-2012). 2012.
Christer Bäckström and Peter Jonsson. Abstracting Abstraction in Search II: Complexity Analysis. In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS-2012). 2012.
Christer Bäckström, Anders Jonsson, and Peter Jonsson. Macros, Reactive Plans and Compact Representations. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI-2012). 2012.
Christer Bäckström, Anders Jonsson, and Peter Jonsson. From Macro Plans to Automata Plans. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI-2012). 2012.
Wlodek Drabent. Logic + Control: An Example. In Proceedings of the 28th International Conference on Logic Programming (ICLP-2012). 2012.
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, and Stefan Szeider. The Complexity of Planning Revisited --- A Parameterized Analysis. In Proceedings of the 26th (US) National Conference on Artificial Intelligence (AAAI-2012). 2012.
Arnaud Durand, Miki Hermann, and Gustav Nordh. Trichotomies in the Complexity of Minimal Inference. Theory of Computing Systems, 50(3), 2012.
Christer Bäckström and Peter Jonsson. Algorithms and Limits for Compact Plan Representation. Journal of Artificial Intelligence Research, Vol 44, 2012.
Christer Bäckström and Peter Jonsson. Abstracting Abstraction in Search with Applications to Planning. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR-2012). 2012.
Bogdan Tanasa, Unmesh Bordoloi, Stefanie Kosuch, Petru Eles, and Zebo Peng. Schedulability Analysis for the Dynamic Segment of FlexRay: A Generalization to Slot Multiplexing. In Real-Time and Embedded Technology and Applications Symposium (RTAS-2012). 2012.
Tommy Färnqvist. Counting Homomorphisms via Hypergraph-based Structural Restrictions. In 2nd International Symposium on Combinatorial Optimization (ISCO-2012). 2012.
Tommy Färnqvist. Constraint Optimization Problems and Bounded Tree-width Revisited. In 9th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR-2012). 2012.
Jianqiang Cheng, Stefanie Kosuch and Abdel Lisser. Stochastic Shortest Path Problem with Uncertain Delays. In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (ICORES-2012). 2012.
Stefanie Kosuch. An Ant Colony Optimization Algorithm for the Two-Stage Knapsack Problem. In Proceedings of the 10th Biennial International Conference on Artificial Evolution (EA-2011). 2011.
Peter Jonsson, Fredrik Kuivinen and Johan Thapper. Min CSP on four elements: moving beyond submodularity. In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP-2011). 2011.
Christer Bäckström and Peter Jonsson. All PSPACE-complete Planning Problems are Equal but some are more Equal than Others. In Proceedings of the 4th Annual Symposium on Combinatorial Search (SoCS-2011). 2011.
Fredrik Kuivinen. On the complexity of submodular function minimisation on diamonds. Discrete Optimization, 8(3), 2011.
Stefanie Kosuch. Approximability of the Two-Stage Knapsack problem with discretely distributed weights. In Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. 2011.
Peter Jonsson and Tomas Lööw. Discrete-time temporal reasoning with Horn DLRs. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11). 2011.
Stefanie Kosuch. Towards an Ant Colony Optimization algorithm for the Two-Stage Knapsack problem. In Proceedings of the 7th ALIO/EURO Workshop on Applied Combinatorial Optimization. 2011.
Christer Bäckström and Peter Jonsson. Limits for compact representations of plans. In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS-2011). 2011.
Wlodzimierz Drabent. Hybrid reasoning with non-monotonic rules. In Proceedings of the 6th international conference on Semantic technologies for software engineering, ReasoningWeb'10. Lecture Notes In Computer Science, Springer-Verlag, 2010.
Wlodzimierz Drabent and Jan Maluszynski. Hybrid rules with well-founded semantics. Knowl. Inf. Syst., 25(1), 2010.
Rustem Takhanov. Extensions of the minimum cost homomorphism problem. In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON-2010). Lecture Notes in Computer Science, Springer, 2010.
Rustem Takhanov. On the monotonization of a training set. Journal of Computational Mathematics and Mathematical Physics, 50(7), 2010.
Peter Jonsson and Johan Thapper. Approximating integer programs with positive right-hand sides. Information Processing Letters, 110(10), 2010.
Johan Thapper. Aspects of a Constraint Optimisation Problem. Linköping Studies in Science and Technology, PhD Dissertation no 1294, 2010.
Gustav Nordh. A note on the hardness of Skolem-type sequences. Discrete Applied Mathematics, 158(8), 2010.
Tomás Feder and Pavol Hell and Peter Jonsson and Andrei Krokhin and Gustav Nordh. Retractions to pseudoforests. SIAM Journal on Discrete Mathematics, 24(1), 2010.
Rustem Takhanov. A dichotomy theorem for the general minimum cost homomorphism problem. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS-2010). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2010.
Peter Jonsson and Gustav Nordh. Approximability of clausal constraints. Theory of Computing Systems, 46(2), 2010.
Jan Maluszynski. Integration of Rules and Ontologies. In Encyclopedia of Database Systems. Springer, 2009.
Wlodzimierz Drabent and Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner and Thomas Lukasiewicz and Jan Maluszynski. Hybrid Reasoning with Rules and Ontologies. In REWERSE. 2009.
Fredrik Kuivinen. Algorithms and Hardness Results for Some Valued CSPs. Linköping Studies in Science and Technology, PhD Dissertation no 1274, 2009.
Manuel Bodirsky and Gustav Nordh and Timo von Oertzen. Integer Programming with 2-Variable Equations and 1-Variable Inequalities. In Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009. 2009.
Francois Bry and Jan Maluszynski. Semantic Techniques for the Web, The REWERSE Perspective. Springer, 2009.
Robert Engström and Tommy Färnqvist and Peter Jonsson and Johan Thapper. Properties of an approximability-related parameter on circular complete graphs. In Proceedings of the 5th Latin-american Algorithms, Graphs, and Optimization Symposium (LAGOS-2009). 2009.
Peter Jonsson and Andrei A. Krokhin and Fredrik Kuivinen. Hard constraint satisfaction problems have hard gaps at location 1. Theor. Comput. Sci., 410(38-40), 2009.
Manuel Bodirsky and Peter Jonsson and Timo von Oertzen. Semilinear program feasibility. In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP-2009). 2009.
Arnaud Durand and Miki Hermann and Gustav Nordh. Trichotomy in the Complexity of Minimal Inference. In Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS-2009). 2009.
Tommy Färnqvist and Peter Jonsson and Johan Thapper. Approximability distance in the space of H-colourability problems. In Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009). 2009.
Peter Jonsson and Johan Thapper. Approximability of the maximum solution problem for certain families of algebras. In Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009). 2009.
Gustav Nordh and Bruno Zanuttini. Frozen Boolean partial co-clones. In Proceedings of the 39th International Symposium on Multiple-Valued Logic (ISMVL-2009). 2009.
Manuel Bodirsky and Gustav Nordh and Timo von Oertzen. Integer Programming with 2-Variable Equations and 1-Variable Inequalities. Information Processing Letters, 109(11), 2009.
Fredrik Kuivinen. Submodular functions on diamonds. In Proceedings of the 7th International Symposium on Combinatorial Optimization (CO-2008). 2008.
Vladimir Deineko and Peter Jonsson and Mikael Klasson and Andrei Krokhin. The approximability of Max CSP with fixed-value constraints. Journal of the ACM, 55(4), 2008.
Pär Emanuelsson and Ulf Nilsson. A Comparative Study of Industrial Static Analysis Tools. Electronic Notes in Theoretical Computer Science, Vol 217, 2008. (Proc. Systems Software Verification 08.)
Peter Jonsson and Andrei Krokhin. Computational complexity of auditing finite attributes in statistical databases. Journal of Computer and System Sciences, Vol 74, 2008.
Peter Jonsson and Fredrik Kuivinen and Gustav Nordh. Max Ones generalised to larger domains. SIAM Journal on Computing, 38(1), 2008.
Peter Jonsson and Gustav Nordh. Introduction to the Maximum Solution Problem. In Complexity of Constraints: An Overview of Current Research Themes. Lecture Notes in Computer Science 5250, Springer-Verlag, 2008.
Jan Maluszynski and Andrzej Szalas and Aida Vitoria. Paraconsistent Logic Programs with Four-Valued Rough Sets. In Rough Sets and Current Trends in Computing, 6th International Conference, RSCTC 2008, Akron, OH, USA, October 23-25, 2008, Proceedings. Lecture Notes in Computer Science 5306, Springer, 2008.
Gustav Nordh. Perfect Skolem sets. Discrete Mathematics, 308(9), 2008.
Gustav Nordh and Bruno Zanuttini. What makes propositional abduction tractable. Artificial Intelligence, 172(10), 2008.
Aida Vitoria and Andrzej Szalas and Jan Maluszynski. Four-Valued Extension of Rough Sets. In Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 17-19, 2008. Proceedings. Lecture Notes in Computer Science 5009, Springer, 2008.
Cristina Baroglio and Piero A. Bonatti and Jan Maluszynski and Massimo Marchiori and Axel Polleres and Sebastian Schaffert (Ed). Reasoning Web, 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures. In Reasoning Web. Lecture Notes in Computer Science 5224, Springer, 2008.
Wlodzimierz Drabent and Jakob Henriksson and Jan Maluszynski. HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners. In Proceedings of the ICLP'07 Workshop on Applications of Logic Programming to the Web, Semantic Web and Semantic Web Services, ALPSWS 2007, Porto. CEUR Workshop Proceedings, CEUR-WS.org, 2007.
Wlodzimierz Drabent and Jakob Henriksson and Jan Maluszynski. Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics. In Web Reasoning and Rule Systems, Lecture Notes in Computer Science 4524. Springer, 2007.
Wlodzimierz Drabent and Jan Maluszynski. Well-Founded Semantics for Hybrid Rules. In Web Reasoning and Rule Systems, Lecture Notes in Computer Science 4524. Springer, 2007.
Wlodzimierz Drabent and Artur Wilk. Extending XML Query Language Xcerpt by Ontology Queries. In Proceedings of IEEE / WIC / ACM International Conference on Web Intelligence (WI 2007), Silicon Valley, USA, 2007. 2007.
Tommy Färnqvist and Peter Jonsson. Bounded tree-width and CSP-related problems. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC-2007). 2007.
Jan Maluszynski, Andrzej Szalas and Aida Vitoria. A Four-Valued Logic for Rough Set-Like Approximate Reasoning. Transactions on Rough Sets, Vol 6, 2007.
Peter Jonsson and Andrei Krokhin. Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. Journal of Computer and System Sciences, 73(5), 2007.
Gustav Nordh. NP-completeness of generalized multi Skolem sequences. Discrete Applied Mathematics, 16(155), 2007.
Gustav Nordh. Complexity Dichotomies for CSP-related Problems. Linköping Studies in Science and Technology, PhD Dissertation no 1091, 2007.
Peter Jonsson, Andrei Krokhin and Fredrik Kuivinen. Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems. In Proceedings of the 2nd International Computer Science Symposium in Russia (CSR-2007). 2007.
Peter Jonsson, Gustav Nordh and Johan Thapper. The maximum solution problem on graphs. In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS-2007). 2007.
Magnus Wahlström. Algorithms, Measures, and Upper Bounds for Satisfiability and Related Problems. Linköping Studies in Science and Technology, PhD Dissertation no 1079, 2007.
Wlodzimierz Drabent. Towards More Precise Typing Rules for. In Principles and Practice of Semantic Web Reasoning, 4th International Workshop, PPSWR 2006, Budva, Montenegro. Lecture Notes in Computer Science 4187, Springer, 2006.
Artur Wilk and Wlodzimierz Drabent. A Prototype of a Descriptive Type System for Xcerpt. In PPSWR. Lecture Notes in Computer Science 4187, Springer, 2006.
Wlodzimierz Drabent and Artur Wilk. Combining XML querying with ontology reasoning: Xcerpt and DIG. In RuleML-06 Workshop: Ontology and Rule Integration. 2006.
Uwe A\ssmann and Jakob Henriksson and Jan Maluszynski. Combining Safe Rules and Ontologies by Interfacing of Reasoners. In PPSWR, Lecture Notes in Computer Science 4187. 2006.
Vilhelm Dahllöf. Exact Algorithms for Exact Satisfiability. Linköping Studies in Science and Technology, PhD Dissertation no 1013, 2006.
Peter Jonsson and Mikael Klasson and Andrei Krokhin. The approximability of three-valued Max CSP. SIAM Journal on Computing, 35(6), 2006.
Peter Jonsson and Gustav Nordh. Generalised integer programming based on logically defined relations. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS-2006). 2006.
Fredrik Kuivinen. Approximability of bounded occurrence Max Ones. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS-2006). 2006.
D. Lawesson and U. Nilsson and I. Klein. An Approach to Post Mortem Diagnosability Analysis for Interacting Finite State Systems. Electronic Notes in Theoretical Computer Science, 149(2), 2006. (Proc. of MoChArt 2005)
Peter Jonsson, Fredrik Kuivinen and Gustav Nordh. Approximability of integer programming with generalised constraints. In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP-2006). 2006.
Johan Thapper. Refined Counting of Fully Packed Loop Configurations. Seminaire Lotharingien de Combinatoire, Vol 56, 2006.
Robin Andersson and Aida Vitoria and Jan Maluszynski and Henryk Jan Komorowski. RoSy: A Rough Knowledge Base System. In Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing. Lecture Notes in Computer Science 3642, Springer, 2005.
Ola Angelsmark. Partitioning based algorithms for some colouring problems. In Proceedings of the Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming. 2005.
Ola Angelsmark. Constructing Algorithms for Constraint Satisfaction and Related Problems. Linköping Studies in Science and Technology, PhD Dissertation no 947, 2005.
Ola Angelsmark and Johan Thapper. A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems. In Proceedings of the 18th International FLAIRS Conference (FLAIRS-2005), Special Track on Constraint Solving and Programming. AAAI Press, 2005.
Ola Angelsmark and Johan Thapper. Algorithms for the Maximum Hamming Distance Problem. In Recent Advances in Constraints. Lecture Notes in Artificial Intelligence 3010, Springer, 2005.
Sacha Berger and Emmanuel Coquery and Wlodzimierz Drabent and Artur Wilk. Descriptive Typing Rules for Xcerpt. In Principles and Practice of Semantic Web Reasoning, Third International Workshop, PPSWR 2005. Lecture Notes in Computer Science 3703, Springer, 2005.
Vilhelm Dahllöf. Algorithms for Max Hamming Exact Satisfiability. In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC-2005). Lecture Notes in Computer Science 3827, Springer, 2005.
Vilhelm Dahllöf. Applications of General Exact Satisfiability in Propositional Logic Modelling. In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Lecture Notes in Computer Science 3452, Springer, 2005.
Vilhelm Dahllöf and Peter Jonsson and Magnus Wahlström. Counting Models for 2SAT and 3SAT Formulae. Theoretical Computer Science, 332(1-3), 2005.
Wlodzimierz Drabent. Towards Types for Web Rule Languages. In Reasoning Web 2005. Lecture Notes in Computer Science 3564, Springer, 2005.
Wlodzimierz Drabent and Miroslawa Milkowska. Proving Correctness and Completeness of Normal Programs - A Declarative Approach. Theory and Practice of Logic Programming, 5(6), 2005.
Peter Jonsson. Adding Clauses to Poor Man's Logic (Without Increasing the Complexity). Journal of Applied Non-Classical Logics, 15(3), 2005.
Fredrik Kuivinen. Tight inapproximability results for the maximum solution equation problem over Z_p. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS-2005). Lecture Notes in Computer Science 3618, Springer, 2005.
Dan Lawesson. An Approach to Diagnosability Analysis of Interacting Finite State Systems. Linköping Studies in Science and Technology, PhD Dissertation no 974, 2005.
Gustav Nordh. A Trichotomy in the Complexity of Propositional Circumscription. In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. 2005.
Gustav Nordh. The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. Theoretical Computer Science, 345(2-3), 2005.
Gustav Nordh and Bruno Zanuttini. Propositional Abduction is Almost Always Hard. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05). 2005.
Vladimir Deineko and Peter Jonsson and Mikael Klasson and Andrei Krokhin. Supermodularity on chains and complexity of maximum constraint satisfaction problems. In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroCOMB-2005). 2005.
Magnus Wahlström. An algorithm for the SAT problem for formulae of linear length. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA-2005). Lecture Notes in Computer Science 3669, Springer, 2005.
Magnus Wahlström. Faster exact solving of SAT formulae with a low number of occurrences per variable. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT-2005). Lecture Notes in Computer Science 3569, Springer, 2005.
Norbert Eisinger and Jan Maluszynski (Ed). Reasoning Web 2005. Springer, 2005.
Andrei Krokhin and Peter Jeavons and Peter Jonsson. Constraint satisfaction problems on intervals and lengths. SIAM Journal on Discrete Mathematics, 17(3), 2004.
Ola Angelsmark and Johan Thapper. New Algorithms for the Maximum Hamming Distance Problem. In Proceedings of the Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming. 2004.
Victor Dalmau and Peter Jonsson. The Complexity of Counting Homomorphisms Seen from the Other Side. Theoretical Computer Science, 329(1--3), 2004.
Peter Jonsson and Andrei Krokhin. Recognizing Frozen Variables in Constraint Satisfaction Problems. Theoretical Computer Science, 329(1--3), 2004.
Peter Jonsson and Andrei Krokhin. Complexity Classification in Qualitative Temporal Constraint Reasoning. Artificial Intelligence, 160(1-2), 2004.
Jan Maluszynski and Aida Vitoria. Towards Rough Datalog: Embedding Rough Sets in Prolog. In "Rough-Neural Computing:Techniques for Computing with Words". Cognitive Technologies, Springer-Verlag, 2004.
Gustav Nordh. The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS-2004). 2004.
Gustav Nordh and Peter Jonsson. The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. In Proceedings of the 10th Annual International Computing and Combinatorics Conference (COCOON-2004). 2004.
Gustav Nordh and Peter Jonsson. An Algebraic Approach to the Complexity of Propositional Circumscription. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS-2004). 2004.
Vilhelm Dahllöf and Peter Jonsson and Richard Beigel. Algorithms for Four Variants of the Exact Satisfability Problem. Theoretical Computer Science, 320(2-3), 2004.
Magnus Wahlström. Exact Algorithms for Finding Minimum Transversals in Rank-3 Hypergraphs. Journal of Algorithms, 51(2), 2004.
Ola Angelsmark and Peter Jonsson. Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP-2003). 2003.
Mathias Broxvall and Peter Jonsson. Point algebras for temporal reasoning: Algorithms and complexity. Artificial Intelligence, 2(149), 2003.
F. Bry and N. Henze and J. Maluszynski(eds.). Principles and Practice of Semantic Web Reasoning. Springer-Verlag, 2003.
Andrei Krokhin and Peter Jeavons and Peter Jonsson. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. Journal of the ACM, 5(50), 2003.
D. Lawesson and U. Nilsson and I. Klein. Model Checking Based Fault Isolation Using Automatic Abstraction. In Proc. of the 14th Intl Workshop of Principles of Diagnosis, Washington DC. 2003.
D. Lawesson and U. Nilsson and I. Klein. Fault Isolation Using Automatic Abstraction To Avoid State Space Explosion. In Workshop on Model Checking and Artificial Intelligence, Acapulco. 2003.
D. Lawesson and U. Nilsson and I. Klein. Fault Isolation in Discrete Event Systems by Observational Abstraction. In Proc of 42nd IEEE Conf on Decision and Control (CDC), Maui Hawaii. IEEE Computer Society Press, 2003.
Jan Maluszynski. On integrating rules into the Semantic Web. In Electronic Notes in Theoretical Computer Science. Elsevier, 2003.
A. Vitoria and C.V.Damasio and J. Maluszynski. Query Answering in Rough Knowledge Bases. In Proceedings of the Nineth Int. Conf. on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing RSFDGrC'2003). LNAI, Springer-Verlag, 2003.
A. Vitoria and C.V.Damasio and J. Maluszynski. From rough sets to rough knowledge bases. Fundamenta Informaticae, 57(2-4), 2003.
A. Wilk and W. Drabent. On Types for XML Query Language Xcerpt. In International Workshop, PPSWR 2003, Mumbai, India, December 8, 2003, Proceedings. LNCS, Springer Verlag, 2003. (ISBN: 3-540-20582-9)
Andrei Krokhin, Peter Jeavons and Peter Jonsson. The Complexity of Constraints on Intervals and Lengths. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS-2002). 2002.
Mathias Broxvall. A Method for Metric Temporal Reasoning. In Proceedings of the 18th (US) National Conference on Artificial Intelligence (AAAI-2002). 2002.
Mathias Broxvall. Constraint Satisfaction on Infinite Domains: Composing Domains and Decomposing Constraints. In Proceedings of the 8th International Conference on Principles on Knowledge Representation and Reasoning (KR-2002). Morgan Kaufmann, 2002.
Vilhelm Dahllöf and Peter Jonsson. An Algorithm for Counting Maximum Weighted Independent Sets and its Applications. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2002). 2002.
P. Dell'Acqua and U. Nilsson and L.M. Pereira. A Logic Based Asynchronous Multi-Agent System. Electronic Notes in Theoretical Computer Science, 70(5), 2002.
G.Szilagyi, T.Gyimothy and J. Maluszynski. Static and Dynamic Slicing of Constraint Logic Programs. Automated Software Engineering, 9(1), 2002.
Andrei Krokhin and Peter Jonsson. Extending the Point Algebra into the Qualitative Algebra. In Proceedings of the 9th International Symposium on Temporal Representation and Reasoning (TIME-2002). 2002.
Dan Lawesson and Ulf Nilsson and Inger Klein. Fault Isolation using Process Algebra Models. In 13th Intl Workshop on Principles of Diagnosis, DX02. 2002.
J. Maluszynski and A. Vitoria. Towards Rough Datalog: embedding Rough Sets in Prolog. In Rough-Neuro Computing. Springer-Verlag, 2002. (To appear)
Mathias Broxvall, Peter Jonsson and Jochen Renz. Disjunctions, Independence, Refinements. Artificial Intelligence, 140(1--2), 2002.
Ola Angelsmark, Peter Jonsson, Svante Linusson and Johan Thapper. Determining the Number of Solutions to Binary CSP Instances. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP-2002). 2002.
Ola Angelsmark, Vilhelm Dahllöf and Peter Jonsson. Finite Domain Constraint Satisfaction Using Quantum Computation. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS-2002). 2002.
Vilhelm Dahllöf, Peter Jonsson and Magnus Wahlström. Counting Satisfying Assignments in 2-SAT and 3-SAT. In Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON-2002). 2002.
W. Drabent, J. Maluszynski and P. Pietrzak. Using parametric set constraints for locating errors in CLP programs. Theory and Practice of Logic Programming, 2(4-5), 2002. [postscript]
Andrei Krokhin, Peter Jeavons and Peter Jonsson. A Complete Classification of Complexity in Allen's Algebra in the Presence of a Non-Trivial Basic Relation. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01). 2001.
Mathias Broxvall. The Point Algebra for Branching Time Revisited. In Proceedings of the 17th Joint German/Austrin Conference on Artificial Intelligence (KI-2001). 2001.
W. Drabent and M. Milkowska. Proving Correctness and Completeness of Normal Programs: A Declarative Approach. In Proceedings of the 17th International Conf. on Logic Programming (ICLP'01). Lecture Notes in Computer Science, LNCS 2237, Springer-Verlag, 2001.
Marie Duflot and Laurent Fribourg and Ulf Nilsson. Unavoidable Configurations of Parameterized Rings of Processes. In Proc. CONCUR'01. LNCS 2154, Springer-Verlag, 2001.
Tim Heyer. Semantic Inspection of UML Designs. In Proc. of the 1st Workshop on Inspection in Software Engineering, WISE'01. 2001.
Tim Heyer. Semantic Inspection of Software Artifacts: From Theory To Practice. PhD thesis no 725, 2001.
Dan Lawesson and Ulf Nilsson and Inger Klein. Model-Checking Based Fault Isolation in UML. In Proc. 12th Intl Workshop on Principles of Diagnosis, DX01. 2001.
W. Drabent, J. Maluszynski and P. Pietrzak. Parametric Descriptive Types for (C)LP. In The 10th International French Speaking Conference for Logic and Constraint Programming. Hermes Science Publications, 2001.
Ola Angelsmark. Constraints, Adjunctions and (Co)algebras. In Workshop on Coalgebraic Methods in Computer Science (CMCS-2000), Berlin. 2000.
Ola Angelsmark and Peter Jonsson. Some Observations on Durations, Scheduling and Allen's Algebra. In Proc. of the Sixth International Conference on Principles and Practice of Constraint Programming (CP2000). 2000.
Mathias Broxvall and Peter Jonsson. Disjunctive Temporal Reasoning in Partially Ordered Time Structures. In Proceedings of the 17th (US) National Conference on Artificial Intelligence (AAAI-2000). 2000.
David Cohen and Peter Jeavons and Peter Jonsson and Manolis Koubarakis. Building Tractable Disjunctive Constraints. Journal of the ACM, 47(5), 2000.
W. Drabent and J. Maluszynski and P. Pietrzak. Type-based Diagnosis of CLP Programs. Electronic Notes in Theoretical Computer Science, 30(4), 2000.
W. Drabent and J. Maluszynski and P. Pietrzak. Locating Type Errors in Untyped CLP Programs. In Analysis and Visualization Tools for Constraint Programming. LNCS 1870, Springer-Verlag, 2000.
Patrik Haslum and Peter Jonsson. Planning with Reduced Operator Sets. In Proc. of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-2000). 2000.
Peter Jonsson. Boolean Constraint Satisfaction: Complexity Results for Optimization Problems with Arbitrary Weights. Theoretical Computer Science, 244(1--2), 2000.
M. Larsson and I. Klein and D. Lawesson and U. Nilsson. Fault Isolation in Object Oriented Control Systems. In IFAC SAFEPROCESS 2000, Budapest. 2000.
Dan Lawesson. Towards Behavioral Model Fault Isolation for Object Oriented Control Systems. Licentiate thesis no 863, 2000.
Mathias Broxvall, Peter Jonsson and Jochen Renz. Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints. In Proc. of the Sixth International Conference on Principles and Practice of Constraint Programming (CP2000). 2000.
Ulf Nilsson and Johan L?übcke. Constraint Logic Programming for Local and Symbolic Model-checking. In Proc. of the Int'l Conf. on Computational Logic (CL2000). LNAI 1861, Springer-Verlag, 2000.
Peter Jonsson, Patrik Haslum and Christer Bäckström. Towards Efficient Universal Planning-A Randomized Approach. Artificial Intelligence, 117(1), 2000.
Marcus Bjäreland and Peter Jonsson. Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. In Proc. of the Fifth International Conference on Principles and Practice of Constraint Programming (CP'99). LNCS 1713, Springer-Verlag, 1999.
Mathias Broxvall and Peter Jonsson. Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. In Proc. of the Fifth International Conference on Principles and Practice of Constraint Programming (CP'99). LNCS 1713, Springer-Verlag, 1999.
Marco Comini and Wlodek Drabent and Pawel Pietrzak. Diagnosis of CHIP programs using type information. In APPIA-GULP-PRODE'99 - 1999 Joint Conference on Declarative Programming. L'Aquila Italy, 1999.
Wlodek Drabent. It Is Declarative: On Reasoning about Logic Programs. In Intl Conf on Logic Programming. Las Cruces, NM, 1999.
Wlodek Drabent and Jan Maluszynski and Pawel Pietrzak. Type-based Diagnosis of CLP Programs. In Proc. of 10th Workshop on Logic Programming Environments. Las Cruces, NM, 1999.
W. Drabent and P. Pietrzak. Type Analysis for CHIP. In Proc. of the Seventh International Conference on Algebraic Methotology and Software Technology (AMAST'98). LNCS 1548, Springer-Verlag, 1999.
Patrik Haslum and Peter Jonsson. Some Results on the Complexity of Planning with Incomplete Information. In Proc. of the Fifth European Conference on Planning (ECP-99). 1999.
Anders Henriksson. Unique Kernel Diagnosis. Licentiate thesis, 1999.
Peter Jonsson. Strong Bounds on the Approximability of Two PSPACE-hard Problems in Propositional Planning. Annals of Mathematics and Artificial Intelligence, Vol 26, 1999.
Peter Jonsson and Thomas Drakengren and Christer Bäckström. Computational Complexity of Relating Time Points with Intervals. Artificial Intelligence, 109(1--2), 1999.
Inger Klein and Peter Jonsson and Christer Bäckström. Efficient Planning for a Miniature Assembly Line. Artificial Intelligence in Engineering, 13(1), 1999.
Johan L?übcke and Ulf Nilsson. On-the-fly Model Checking of CTL Formulas using Constraint Logic Programming. In Intl Workshop of Constraint Programming for Time-critical Applications. Lisbon, 1999.
Roland Bol and Lars Degerstedt. Tabulated Resolution for Well-founded Semantics. J. of Logic Programming, 34(2), 1998. [postscript]
Christer Bäckström. Computational Aspects of Reordering Plans. Journal of Artificial Intelligence Research, Vol 9, 1998.
Thomas Drakengren. A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in $P\omega$. Theoretical Comptuer Science, 193(1--2), 1998.
Thomas Drakengren and Peter Jonsson. A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations. Artificial Intelligence, 106(2), 1998.
Thomas Drakengren and Peter Jonsson. Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. Journal of Logic and Computation, 8(6), 1998.
Peter Jonsson. Near-optimal Nonapproximability Results for Some NPO PB-complete Problems. Information Processing Letters, 68(5), 1998.
Peter Jonsson and Christer Bäckström. A Unifying Approach to Temporal Constraint Reasoning. Artificial Intelligence, 102(1), 1998.
Peter Jonsson and Christer Bäckström. State-variable Planning Under Structural Restrictions: Algorithms and Complexity. Artificial Intelligence, 100(1--2), 1998.
Peter Jonsson and Christer Bäckström. Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence, 22(3,4), 1998.
Johan L?übcke and Ulf Nilsson. CTL Model Checking using Tabled Logic Programs. In Intl Workshop of Constraint Programming for Time-critical Applications. Nice, 1998.
Ulf Nilsson. The Reviewer's Workbench: An Internet Tool for Program Committees. In PAPPACT 98: Practical Applications of Prolog and Constraint Technology. 1998.
Nilsson, U. and Streiffert, S. and Törne, A.. Detailed Design of Avionics Control Software. In Proc of 19th IEEE Real-Time Systems Symposium. 1998. [postscript]
Pawel Pietrzak. Static Incorrectness Diagnosis of CLP(FD). Licentiate thesis no 742, 1998. [postscript]
Boye, J. and Drabent, W. and Maluszynski, J.. Declarative Diagnosis of Constraint Programs: an Assertion Based Approach. In Proceedings of AADEBUG'97 (Third International Workshop on Automated Debugging). 1997. (Linköping, Sweden) [postscript]
J. Boye and J. Maluszynski. Directional Types and the Annotation Method. J. Logic Programming, 33(3), 1997. (The postscript gives an early version..) [postscript]
Bueno, F. and Deransart, P. and Drabent, W. and Ferrand, G. and Hermenegildo, M. and Maluszynski, J. and Puebla, G.. On the Role of Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs. In Proceedings of AADEBUG'97 (The Third International Workjshop on Automated Debugging). 1997. [postscript]
Drabent, W. It is declarative: On Proving Partial Correctness of Logic Programs. In Workshop on Verification, Model Checking and Abstract Interpretation. 1997. [postscript]
Drabent, W.. A Floyd-Hoare Method for Prolog. Linköping Electronic Articles in Computer and Information Science, 2(13), 1997. (A former version was presented at a post-conference workshop "Verification and Analysis of Logic Programs" at JICSLP '96.)
Thomas Drakengren. Algorithms and Complexity for Temporal and Spatial Formalisms. Linköping Studies in Science and Technology. Dissertation No. 498, 1997.
Thomas Drakengren and Marcus Bjäreland. Reasoning About Action in Polynomial Time. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97). Morgan Kaufmann, 1997.
Thomas Drakengren and Peter Jonsson. Twenty-one Large Tractable Subclasses of Allen's Algebra. Artificial Intelligence, Vol 93, 1997.
Thomas Drakengren and Peter Jonsson. Towards a Complete Classification of Tractability in Allen's Algebra. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97). Morgan Kaufmann, 1997.
Thomas Drakengren and Peter Jonsson. Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. Journal of Artificial Intelligence Research, Vol 7, 1997.
Fredrik Eklund. Declarative Error Diagnosis of GAPLog Programs. Licentiate thesis no 627, 1997. [postscript]
Laurent Fribourg and Hans Olsen. Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. CONCUR'97, 1997.
Laurent Fribourg and Hans Olsen. A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Journal of Constraints, 2(3/4), 1997.
Peter Jonsson. A Nonapproximability Result for Finite Function Generation. Information Processing Letters, Vol 63, 1997.
Peter Jonsson and Thomas Drakengren. A Complete Classification of Tractability in RCC-5. Journal of Artificial Intelligence Research, Vol 6, 1997.
Nilsson, U. The Program Committee Virtual Workbench. In 2nd International Workshop on Logic Programming Tools for Internet Applications. 1997. (Invited talk)
Hans Olsen. Automatic Verification of Petri Nets in a CLP Framework. Linköping Studies in Science and Technology. Dissertation no. 495, 1997. [postscript]
Pietrzak, P. Type Inference for CLP(FD). 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) [postscript]
Johan Boye. Directional Types in Logic Programming. Linköping Studies in Science and Technology, dissertation no. 437, 1996. [postscript]
Christer Bäckström and Peter Jonsson. Planning with Abstraction Hierarchies can be Exponentially Less Efficient. In 4th International Symposium of AI and Mathematics. 1996. (Invited talk. Only abstract published.)
Lars Degerstedt. Tabulation-based Logic Programming: A Multi-level View of Query Answering. Linköping Studies in Science and Technology, dissertation no. 462, 1996. [postscript]
W. Drabent. Completeness of SLDNF-Resolution for Nonfloundering Queries. J. of Logic Programming, 27(2), 1996. [postscript]
Thomas Drakengren. Uniqueness of Scott's Reflexive Domain in $P\omega$. Theoretical Comptuer Science, 155(1), 1996.
Thomas Drakengren and Peter Jonsson. Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96). 1996.
Laurent Fribourg and Hans Olsen. Reductions of Petri nets and Unfolding of Propositional Logic Programs. LOPSTR'96, 1996.
Peter Jonsson. Studies in Action Planning: Algorithms and Complexity. Linköping Studies in Science and Technology. Dissertation No. 431, 1996.
Peter Jonsson and Christer Bäckström. On the Size of Reactive Plans. In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96). 1996.
Peter Jonsson and Christer Bäckström. A Linear-Programming Approach to Temporal Reasoning. In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96). 1996.
Peter Jonsson and Christer Bäckström. Tractable plan existence does not imply tractable plan generation. In 4th International Symposium of AI and Mathematics. 1996.
Peter Jonsson and Thomas Drakengren and Christer Bäckström. Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. In Proceedings of the 5th International Conference on Principles on Knowledge Representation and Reasoning (KR-96). Morgan Kaufmann, 1996.
Inger Klein and Peter Jonsson and Christer Bäckström. Automatic Synthesis of Control Programs in Polynomial Time for an Assembly Line. In Proceedings of the IEEE Conference on Decision and Control (CDC-96). 1996.
A. Di Pierro and W. Drabent. On Negation as Instantiation. In 5th International Conf. Algebraic and Logic Programming. Lecture Notes in Computer Science 1139, Springer-Verlag, 1996. [postscript]
J. Boye and J. Maluszynski. Two Aspects of Directional Types. In Proc. of Int'l Conf on Logic Programming 95. MIT Press, 1995. [postscript]
Christer Bäckström. Expressive Equivalence of Planning Formalisms. Artificial Intelligence, 76(1--2), 1995. (ARTINT 1234.)
Christer Bäckström. Five Years of Tractable Planning. In New Directions in AI Planning: EWSP'95---3rd European Workshop on Planning. Frontiers in AI and Applications, IOS Press, 1995.
Christer Bäckström and Peter Jonsson. Planning with Abstraction Hierarchies can be Exponentially Less Efficient. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95). Morgan Kaufmann, 1995.
Christer Bäckström and Peter Jonsson. Planning with Abstraction Hierarchies can be Exponentially Less Efficient. In Proceedings of the Symposium on Abstraction, Reformulation and Approximation, SARA-95. 1995. (Same paper as IJCAI'95)
Christer Bäckström and Bernhard Nebel. Complexity Results for SAS$^+$ Planning. Computational Intelligence, 11(4), 1995.
L. Degerstedt and U. Nilsson. Magic Computation for Well-founded Semantics. In Non-monotonic Extensions of Logic Programming. Lecture Notes in Artificial Intelligence 927, Springer-Verlag, 1995. [postscript]
Drabent, W.. What is failure? An Approach to Constructive Negation. Acta Informatica, 32(1), 1995. [postscript]
Peter Jonsson. Complexity of State-variable Planning Under Structural Restrictions. Licentiate Thesis no 478, 1995.
Peter Jonsson and Christer Bäckström. Incremental Planning. In New Directions in AI Planning: EWSP'95---3rd European Workshop on Planning. Frontiers in AI and Applications, IOS Press, 1995.
Inger Klein and Peter Jonsson and Christer Bäckström. Tractable Planning for an Assembly Line. In New Directions in AI Planning: EWSP'95---3rd European Workshop on Planning. Frontiers in AI and Applications, IOS Press, 1995.
Andreas Kågedal. Exploiting Groundness in Logic Programs. Linköping Studies in Science and Technology. Dissertation No. 383, 1995. [postscript]
Ulf Nilsson. Abstract Interpretation: A Kind of Magic. Theoretical Comp. Sci., Vol 142, 1995. [postscript]
U. Nilsson and J. Maluszynski. Logic, Programming and Prolog (2 ed). John Wiley, 1995.
Christer Bäckström. Planning using Transformation between Equivalent Formalisms: A Case Study of Efficiency. In Comparative Analysis of AI Planning Systems. 1994. (Held in conjunction with AAAI-94 shortciteaaai94)
Christer Bäckström. Executing Parallel Plans Faster by Adding Actions. In Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-94). Wiley, 1994.
Fredrik Eklund and Andreas Kågedal. Optimization of GAPLog programs. In Proceedings of the Tenth Logic Programming Workshop. 1994. (Report no. 94.10) [postscript]
L. Fribourg and H. Olsen. Direct, Dual and Contrapositive Proofs by Induction. In Proc. of International Workshop on Logic Program Synthesis and Transformation, LOPSTR'94. Preprints, Pisa University, 1994.
Peter Jonsson and Christer Bäckström. Tractable Planning with State Variables by Exploiting Structural Restrictions. In Proceedings of the 12th (US) National Conference on Artificial Intelligence (AAAI-94). 1994.
Peter Jonsson and Christer Bäckström. Complexity Results for State-Variable Planning under Mixed Syntactical and Structural Restrictions. In Proceedings of the 6th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-94). World Scientific Publishing, 1994.
A. Kågedal. A Dataflow Analysis Method for Ground Prolog. In Proceedings of the 11th International Conference on Logic Programming. The MIT Press, 1994. (Poster abstract)
J. Paakki. Multi-pass evaluation of functional logic programs. In Proc. of21th ACM Symposium on Principles of Programming Languages. The ACM, 1994.
R. Bol and L. Degerstedt. Tabulated Resolution for Well-Founded Semantics. In Proc. of the 1993 International Logic Programming Symposium. MIT Press, 1993. [postscript]
J. Boye. Avoiding Dynamic Delays in Functional Logic Programs. In Programming Language Implemantation and Logic Programming 93. LNCS 724, Springer-Verlag, 1993.
J. Boye and J. Paakki and J. Maluszynski. Synthesis of Directionality Information for Functional Logic Programs. In Proc. of the Workshop on Static Analysis, WSA'93. LNCS 724, Springer-Verlag, 1993. [postscript]
Christer Bäckström. Tractable Planning Problems: A Challenge for Deductive Planning. In Deductive Approaches to Plan Generation and Plan Recognition. 1993. (All talks invited. Only abstracts published.)
Christer Bäckström. Finding Least Constrained Plans and Optimal Parallel Executions is Harder than We thought. In Current Trends in AI Planning: EWSP'93---2nd European Workshop on Planning. IOS Press, 1993.
Christer Bäckström and Bernhard Nebel. Complexity Results for SAS$^+$ Planning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93). Morgan Kaufmann, 1993.
L. Degerstedt. Tabulated Resolution for Well-founded Semantics. Licentiate thesis no 402, 1993. [postscript]
P. Deransart and J. Maluszynski. A Grammatical View of Logic Programming. MIT Press, 1993.
W. Drabent. SLS-resolution Without Floundering. In Proc. 2nd International Workshop on Logic Programming and Non-Monotonic Reasoning. MIT Press, 1993. [postscript]
Drabent, W.. Completeness of SLDNF-Resolution for Non-floundering Queries. In Logic Programming - Proceedings of the 1993 International Symposium. MIT Press, 1993. (A poster abstract)
K. Kuchcinski and W. Drabent and J. Maluszynski. Automatic Diagnosis of VLSI Circuits Using Algorithmic Debugging. In AADEBUG'93, Proc. of the 1st Int. Workshop on Automated and Algorithmic Debugging. Springer-Verlag, 1993. (LNCS 749)
A. Kågedal. Improvements to Compile-Time Analysis for Ground Prolog. In Programming Language Implementation and Logic Programming 93. Springer-Verlag, 1993. (LNCS 724)
J. Maluszynski and S. Bonnier and J. Boye and A. Kågedal and F. Kluzniak and U. Nilsson. Logic Programs with External Procedures. In Logic Programming Languages, Constraints, Functions, and Objects. The MIT Press, 1993. [postscript]
U. Nilsson. Goal-directed Bottom-up Evaluation of Normal Logic Programs. In Proc. of the International Logic Programming Symposium, Vancouver. MIT Press, 1993. (Poster abstract)
S. Bonnier. A Formal Basis for Horn Clause Logic with External Polymorphic Functions. Linköping Studies in Science and Technology, Dissertation no. 276, 1992. [postscript]
S. Bonnier and J. Wallgren. Logic Programs with Polymorphic Types: A Condition for Static Type Checking. In Proc. 3rd International Workshop on Conditional Term Rewriting Systems. LNCS 656, Springer-Verlag, 1992.
Christer Bäckström. Equivalence and Tractability Results for SAS$^+$ Planning. In Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR-92). Morgan Kaufmann, 1992.
Christer Bäckström. Computational Complexity of Reasoning about Plans. Doctoral Dissertation, 1992.
Christer Bäckström. Uncertainty and Parallelism in Action Structures. In ECAI-92 Workshop: Beyond Sequential Planning. 1992.
Christer Bäckström and Bernhard Nebel. On the Computational Complexity of Planning and Story Understanding. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92). Wiley, 1992.
W. Drabent. What is Failure? Or: Constructive Negation by Fail Answers. In Proc. of the International Conference on Computing and Information, ICCI'92. IEEE Computer Society Press, 1992.
L. Fribourg and H. Olsen. A Unifying View of Structural Induction and Computation Induction for Logic Programs. In Proc. of Logic Program Synthesis and Transformation (LOPSTR 92). Springer-Verlag, 1992. (Workshops in Computing series)
G. Lindstrom and J. Maluszynski and T. Ogi. Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems. In Programming Language Implementation and Logic Programming 92. Springer-Verlag, 1992. (LNCS 631)
Bernhard Nebel and Christer Bäckström. On the Computational Complexity of Temporal Projection and Plan Validation. In Proceedings of the 10th (US) National Conference on Artificial Intelligence (AAAI-92). 1992.
U. Nilsson. Abstract Interpretations & Abstract Machines: Contributions to a Methodology for the Implementation of Logic Programs. Linköping Studies in Science and Technology, Dissertation no. 265, 1992. [postscript]
U. Nilsson. Towards a Methodology for the Design of Abstract Machines for Logic Programming Languages. Journal of Logic Programming, 16(1--2), 1992. [postscript]
S. Bonnier. Unification in Incompletely Specified Theories: A Case Study. In Mathematical Foundations of Computer Science 1991. LNCS 520, Springer-Verlag, 1991.
S. Bonnier and U. Nilsson and T. Näslund. A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics. Information Processing Letters, Vol 40, 1991. [postscript]
J. Boye. S-SLD-Resolution: An Operational Semantics for Logic Programs with External Procedures. In Programming Language Implementation and Logic Programming 91. LNCS 528, Springer-Verlag, 1991.
Christer Bäckström and Inger Klein. Planning in Polynomial Time: The SAS-PUBS Class. Computational Intelligence, 7(3), 1991.
Christer Bäckström and Inger Klein. Parallel Non-Binary Planning in Polynomial Time. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91). Morgan Kaufmann, 1991.
W. Drabent and M. Martelli. Strict Completion of Logic Programs. New Generation Computing, Vol 9, 1991.
Inger Klein and Christer Bäckström. On the Planning Problem in Sequential Control. In Proceedings of the 30th IEEE Conference on Decision and Control (CDC-91). 1991.
A. Kågedal and F. Kluzniak. Enriching Prolog with S-Unification. In PHOENIX Seminar and Workshop on Declarative Programming. Workshops in Computing, Springer-Verlag, 1991.
G. Lindstrom and J. Maluszynski and T. Ogi. Our LIPS are Sealed: Interfacing SML and Logic Programming. In Proc. of the Third Int. Workshop on Standard ML. 1991.
J. Maluszynski. Attribute Grammars and Logic Programs: A Comparison of Concepts. In Attribute Grammars, Applications and Systems, Prague Summer School. LNCS 545, Springer-Verlag, 1991.
U. Nilsson. Abstract Interpretation: A Kind of Magic. In Programming Language Implementation and Logic Programming 91. LNCS 528, Springer-Verlag,, 1991. (Extended version to appear in Theoretical Computer Science)
Christer Bäckström. Logical Modelling of Simplified Geometrical Objects and Mechanical Assembly Processes. In Advances in Spatial Reasoning. Ablex, 1990.
Christer Bäckström and Inger Klein. Planning in Polynomial Time. In Expert Systems in Engineering: Principles and Applications. International Workshop. Lecture Notes in Artificial Intelligence, Springer, 1990.
P. Deransart and J. Maluszynski. What Kind of Grammars are Logic Programs.. In Logic and Logic Grammars for Language Processing. Ellis Horwood, 1990.
S. Nadjm-Tehrani. Debugging Prolog Programs Declaratively. In Proc. of META'90. MIT Press, 1990. [postscript]
U. Nilsson. Systematic Semantic Approximations of Logic Programs. In Programming Language Implementation and Logic Programming 90. Springer-Verlag, 1990. (LNCS 456)
U. Nilsson and J. Maluszynski. Logic, Programming and Prolog. Wiley and Sons, 1990.
P. Deransart and J. Maluszynski. A Grammatical View of Logic Programming. In Programming Language Implementation and Logic Programming 88. LNCS 348, Springer-Verlag, 1989.
W. Drabent and S. Nadjm-Tehrani and J. Maluszynski. Algorithmic Debugging with Assertions. In Meta-programming in Logic Programming. MIT Press, 1989. [postscript]
J. Maluszynski and T. Näslund. Fail Substitutions for Negation as Failure. In Proc. of NACLP. MIT Press, 1989.
U. Nilsson. Towards a Framework for the Abstract Interpretation of Logic Programs. In Programming Language Implementation and Logic Programming 88. LNCS 348, Springer-Verlag, 1989.
Christer Bäckström. Action Structures with Implicit Coordination. In Proceedings of the 3rd International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-88). North-Holland, 1988.
Christer Bäckström. A Representation of Coordinated Actions Characterized by Interval Valued Conditions. In Proceedings of the 3rd International Symposium on Methodologies for Intelligent systems (ISMIS-88). North-Holland, 1988.
Christer Bäckström. A Representation of Coordinated Actions. In Proceedings of the 1st Scandinavian Conference on Artificial Intelligence (SCAI-88). IOS Press, 1988. (em Award winning paper)
W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science, Vol 59, 1988. [postscript]
W. Drabent and S. Nadjm-Tehrani and J. Maluszynski. The Use of Assertions in Algorithmic Debugging. In Proc. of Fifth Generation Computer Systems 88. 1988.
J. Leszczylowski and S. Bonnier and J. Maluszynski. Logic Programming with External Procedures: Introducing S-Unification. Information Processing Letters, Vol 27, 1988.
S. Bonnier, S. and J. Maluszynski. Towards a Clean Amalgamation of Logic Programs with External Procedures. In Proc. of International Conference and Symposium on Logic Programming 88. MIT Press, 1988. (Also in Proc. of PLILP '88, LNCS 348, Springer-Verlag, 1989)
Drabent, W.. Do Logic Programs Resemble Programs in Conventional Languages?. In Proceedings of 1987 Symposium on Logic Programming. 1987.
Ulf Nilsson. AID: An Alternative Implementation of DCGs. New Generation Comput., 4(4), 1986.
P. Deransart and J. Maluszynski. Relating Logic Programs and Attribute Grammars. J. of Logic Programming, 2(2), 1985.


©1996,Ulf Nilsson
This page is generated on the fly by a Prolog program run under SICStus Prolog. The program is still in a prototype state. Upcoming versions will support sorting of the entries and a search facility.