383 publications
to appear
Circuit Satisfiability and Constraint Satisfaction around Skolem Arithmetic (, , ), In Theoretical Computer Science, .
2017
Time Complexity of Constraint Satisfaction via Universal Algebra (, , ), In Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS-2017), .
Strong Partial Clones and the Time Complexity of SAT Problems (, , , ), In Journal of Computer and System Sciences, .
An Initial Study of Time Complexity in Infinite-domain Constraint Satisfaction (, ), In Artificial Intelligence, .
Logic + Control: on Program Construction and Verification (), In Theory and Practice of Logic Programming, .
Proving Completeness of Logic Programs with the Cut (), In Formal Aspects of Computing, .
Complexity of Phylogeny Constraint Satisfaction Problems (, ), In ACM Transactions on Computational Logic, .
A Model-theoretical View on Qualitative Constraint Reasoning (, ), In Journal of Artificial Intelligence Research, .
Plan Reordering and Parallel Execution - A Parameterized Complexity View (, ), In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-2017), .
2016
The Power of Primitive Positive Definitions with Polynomially Many Variables (, ), In Journal of Logic and Computation, .
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (, ), In Proc. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016), .
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems: Limitations and Applications (), PhD thesis, Linköping University, .
Finite Unary Relations and Qualitative Constraint Satisfaction (), In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI-2016), .
Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals (, ), In Journal of Computer and System Sciences, .
Circuit Satisfiability and Constraint Satisfaction Problems around Skolem Arithmetic (, , ), In Proceedings of the 12th Conference on Computability in Europe (CiE-2016), .
On definite program answers and least Herbrand models (), In Theory and Practice of Logic Programming, .
Correctness and completeness of logic programs (), In ACM Transactions on Computational Logics, .
The Complexity of Phylogeny Constraint Satisfaction (, , ), In Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS-2016), .
The Reducts of the Homogeneous Binary Branching C-relation (, , ), In Journal of Symbolic Logic, .
Upper and Lower Time and Space Bounds for Planning (, ), In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI-2016), .
Analysing Approximability and Heuristics in Planning Using the Exponential-time Hypothesis (, , , ), In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI-2016), .
Refining Complexity Analyses in Planning by Exploiting the Exponential Time Hypothesis (, , , ), In Annals of Mathematics and Artificial Intelligence, .
A Multi-parameter Complexity Analysis of Cost-optimal and Net-benefit Planning (, ), In Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS-2016), .
2015
On Some Combinatorial Optimization Problems: Algorithms and Complexity (), PhD thesis, Linköping University, .
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (), In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS-2015), .
Bounded Bases of Strong Partial Clones (, , ), In Proceedings of the 45th International Symposium on Multiple-Valued Logic (ISMVL-2015), .
Parsing to Noncrossing Dependency Graphs (, ), In Transactions of the Association for Computational Linguistics, .
Constructing NP-intermediate Problems by Blowing Holes with Parameters of Various Properties (, , ), In Theoretical Computer Science, .
Upper and Lower Bounds on the Time Complexity of Infinite-domain CSPs (, ), In Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP-2015), .
An Approximability-related Parameter on Graphs - Properties and Applications (, , , ), In Discrete Mathematics and Theoretical Computer Science, .
Some Fixed Parameter Tractability Results for Planning with Non-acyclic Domain-transition Graphs (), In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI-2015), .
A Complete Parameterized Complexity Analysis of Bounded Planning (, , , ), In Journal of Computer and System Sciences, .
Tractable Cost-optimal Planning over Restricted Polytree Causal Graphs (, , ), In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI-2015), .
Cost-optimal and Net-benefit Planning - A Parameterised Complexity View (, ), In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI-2015), .
2014
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), .
Local-To-Global Consistency Implies Tractability of Abduction (), In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-2014), .
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), .
Weak Bases of Boolean Co-clones (), In Information Processing Letters, volume 114, .
Polynomially Closed Co-clones (, ), In Proceedings of the 44th International Symposium on Multiple-Valued Logic (ISMVL-2014), .
Approximability of the Two-stage Stochastic Knapsack Problem with Discretely Distributed Weights (), In Discrete Applied Mathematics, volume 165, .
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), .
Limitations of Acyclic Causal Graphs for Planning (, , ), In Artificial Intelligence, volume 210, .
Affine Consistency and the Complexity of Semilinear Constraints (, ), In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014), .
On Completeness of Logic Programs (), In Proceedings of the 24th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR-2014), .
Automaton Plans (, , ), In Journal of Artificial Intelligence Research, .
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), .
Oversubscription Planning: Complexity and Compilability (, ), In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-2014), .
2013
Three-Element Min-Sol and Conservative Min-Cost-Hom (), In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP-2013), .
The Complexity of Abduction for Equality Constraint Languages (, ), In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL-2013), .
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), .
When Acyclicity Is Not Enough: Limitations of the Causal Graph (, , ), In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS-2013), .
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), .
Computational Complexity of Linear Constraints over the Integers (, ), In Artificial Intelligence, .
Exploiting Structure in CSP-related Problems (), PhD thesis, Linköping University, .
Paradigms for Parameterized Enumeration (, , , , ), In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-2013), .
Fast Detection of Unsolvable Planning Instances Using Local Consistency (, , ), In Proceedings of the 6th Annual Symposium on Combinatorial Search (SoCS-2013), .
Parameterized Complexity and Kernel Bounds for Hard Planning Problems (, , , ), In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC-2013), .
A Refined View of Causal Graphs and Component Sizes: SP-closed Graph Classes and Beyond (, ), In Journal of Artificial Intelligence Research, .
Bridging the Gap Between Refinement and Heuristics in Abstraction (, ), In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-2013), .
2012
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), .
Max-Sur-CSP on Two Elements (), In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP-2012), .
Schedulability Analysis for the Dynamic Segment of FlexRay: A Generalization to Slot Multiplexing (, , , , ), In Real-Time and Embedded Technology and Applications Symposium (RTAS-2012), .
Stochastic Shortest Path Problem with Uncertain Delays (, , ), In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (ICORES-2012), .
Counting Homomorphisms via Hypergraph-based Structural Restrictions (), In 2nd International Symposium on Combinatorial Optimization (ISCO-2012), .
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), .
Trichotomies in the Complexity of Minimal Inference (, , ), In Theory of Computing Systems, volume 50, .
A Simple Correctness Proof for Magic Transformation (), In Theory and Practice of Logic Programming, volume 12, .
Logic + Control: An Example (), In Proceedings of the 28th International Conference on Logic Programming (ICLP-2012), .
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction (, ), In Proceedings of the 19th International Symposium on Temporal Representation and Reasoning (TIME-2012), .
Essential Convexity and Complexity of Semi-algebraic Constraints (, , ), In Logical Methods in Computer Science, volume 8, .
Horn versus Full First-order: Complexity Dichotomies in Algebraic Constraint Satisfaction (, , ), In Journal of Logic and Computation, volume 22, .
Equivalence Constraints (, ), In Proceedings of the 21st EACSL Annual Conference on Computer Science Logic (CSL-2012), .
From Macro Plans to Automata Plans (, , ), In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI-2012), .
The Complexity of Planning Revisited — A Parameterized Analysis (, , , , ), In Proceedings of the 26th (US) National Conference on Artificial Intelligence (AAAI-2012), .
Abstracting Abstraction in Search II: Complexity Analysis (, ), In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS-2012), .
Abstracting Abstraction in Search with Applications to Planning (, ), In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR-2012), .
Algorithms and Limits for Compact Plan Representation (, ), In Journal of Artificial Intelligence Research, volume 44, .
2011
On the complexity of submodular function minimisation on diamonds (), In Discrete Optimization, volume 8, .
An Ant Colony Optimization Algorithm for the Two-Stage Knapsack Problem (), In Proceedings of the 10th Biennial International Conference on Artificial Evolution (EA-2011), .
Approximability of the Two-Stage Knapsack problem with discretely distributed weights (), In Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, .
Towards an Ant Colony Optimization algorithm for the Two-Stage Knapsack problem (), In Proceedings of the 7th ALIO/EURO Workshop on Applied Combinatorial Optimization, .
Min CSP on four elements: moving beyond submodularity (, , ), In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP-2011), .
Discrete-time temporal reasoning with Horn DLRs (, ), In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11), .
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), .
Limits for compact representations of plans (, ), In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS-2011), .
2010
Aspects of a Constraint Optimisation Problem (), PhD thesis, Linköping University, .
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, .
On the monotonization of a training set (), In Journal of Computational Mathematics and Mathematical Physics, volume 50, .
Extensions of the minimum cost homomorphism problem (), In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON-2010), Springer, volume 6196, .
A note on the hardness of Skolem-type sequences (), In Discrete Applied Mathematics, Elsevier, volume 158, .
Approximating integer programs with positive right-hand sides (, ), In Information Processing Letters, Elsevier North-Holland, Inc., volume 110, .
Approximability of clausal constraints (, ), In Theory of Computing Systems, Springer, volume 46, .
Retractions to pseudoforests (, , , , ), In SIAM Journal on Discrete Mathematics, volume 24, .
Hybrid reasoning with non-monotonic rules (), In Proceedings of the 6th international conference on Semantic technologies for software engineering, ReasoningWeb'10, Springer-Verlag, volume 6325, .
Hybrid rules with well-founded semantics (, ), In Knowl. Inf. Syst., Springer, volume 25, .
2009
Frozen Boolean partial co-clones (, ), In Proceedings of the 39th International Symposium on Multiple-Valued Logic (ISMVL-2009), .
Algorithms and Hardness Results for Some Valued CSPs (), PhD thesis, Linköping University, .
Hard constraint satisfaction problems have hard gaps at location 1 (, , ), In Theor. Comput. Sci., volume 410, .
Approximability of the maximum solution problem for certain families of algebras (, ), In Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009), .
Approximability distance in the space of H-colourability problems (, , ), In Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009), .
Properties of an approximability-related parameter on circular complete graphs (, , , ), In Proceedings of the 5th Latin-american Algorithms, Graphs, and Optimization Symposium (LAGOS-2009), .
Trichotomy in the Complexity of Minimal Inference (, , ), In Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS-2009), .
Hybrid Reasoning with Rules and Ontologies (, , , , , ), Chapter in REWERSE, .
Semantic Techniques for the Web, The REWERSE Perspective (, ), (Francois Bry, Jan Maluszynski, eds.), Springer, volume 5500, .
Integration of Rules and Ontologies (), Chapter in Encyclopedia of Database Systems, Springer, .
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, .
Semilinear program feasibility (, , ), In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP-2009), .
Integer Programming with 2-Variable Equations and 1-Variable Inequalities (, , ), In Information Processing Letters, volume 109, .
2008
Reasoning Web, 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures (, , , , , ), In Reasoning Web (Cristina Baroglio, Piero A. Bonatti, Jan Maluszynski, Massimo Marchiori, Axel Polleres, Sebastian Schaffert, eds.), Springer, .
Four-Valued Extension of Rough Sets (, , ), In Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 17-19, 2008. Proceedings, Springer, .
Perfect Skolem sets (), In Discrete Mathematics, volume 308, .
What makes propositional abduction tractable (, ), In Artificial Intelligence, volume 172, .
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, Springer, .
Submodular functions on diamonds (), In Proceedings of the 7th International Symposium on Combinatorial Optimization (CO-2008), .
Max Ones generalised to larger domains (, , ), In SIAM Journal on Computing, volume 38, .
Introduction to the Maximum Solution Problem (, ), Chapter in Complexity of Constraints: An Overview of Current Research Themes (Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer, eds.), Springer-Verlag, .
Computational complexity of auditing finite attributes in statistical databases (, ), In Journal of Computer and System Sciences, volume 74, .
A Comparative Study of Industrial Static Analysis Tools (, ), In Electronic Notes in Theoretical Computer Science, volume 217, . (Proc. Systems Software Verification 08.)
The approximability of Max CSP with fixed-value constraints (, , , ), In Journal of the ACM, ACM, volume 55, .
2007
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, .
Algorithms, Measures, and Upper Bounds for Satisfiability and Related Problems (), PhD thesis, Linköping University, .
NP-completeness of generalized multi Skolem sequences (), In Discrete Applied Mathematics, volume 16, .
Complexity Dichotomies for CSP-related Problems (), PhD thesis, Linköping University, .
A Four-Valued Logic for Rough Set-Like Approximate Reasoning (, , ), In Transactions on Rough Sets, volume 6, .
The maximum solution problem on graphs (, , ), In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS-2007), .
Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems (, , ), In Proceedings of the 2nd International Computer Science Symposium in Russia (CSR-2007), .
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights (, ), In Journal of Computer and System Sciences, volume 73, .
Bounded tree-width and CSP-related problems (, ), In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC-2007), .
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-WS.org, volume 287, .
Well-Founded Semantics for Hybrid Rules (, ), In Web Reasoning and Rule Systems, Lecture Notes in Computer Science 4524, Springer, .
Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics (, , ), In Web Reasoning and Rule Systems, Lecture Notes in Computer Science 4524, Springer, .
2006
A Prototype of a Descriptive Type System for Xcerpt (, ), In PPSWR, Springer, .
Refined Counting of Fully Packed Loop Configurations (), In Séminaire Lotharingien de Combinatoire, volume 56, .
An Approach to Post Mortem Diagnosability Analysis for Interacting Finite State Systems (, , ), In Electronic Notes in Theoretical Computer Science, volume 149, . (Proc. of MoChArt 2005)
Approximability of bounded occurrence Max Ones (), In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS-2006), .
The approximability of three-valued Max CSP (, , ), In SIAM Journal on Computing, volume 35, .
Approximability of integer programming with generalised constraints (, , ), In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP-2006), .
Generalised integer programming based on logically defined relations (, ), In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS-2006), .
Combining XML querying with ontology reasoning: Xcerpt and DIG (, ), In RuleML-06 Workshop: Ontology and Rule Integration, .
Towards More Precise Typing Rules for (), In Principles and Practice of Semantic Web Reasoning, 4th International Workshop, PPSWR 2006, Budva, Montenegro, Springer, .
Exact Algorithms for Exact Satisfiability (), PhD thesis, Linköping University, .
Combining Safe Rules and Ontologies by Interfacing of Reasoners (, , ), In PPSWR, Lecture Notes in Computer Science 4187, .
2005
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), Springer, .
An algorithm for the SAT problem for formulae of linear length (), In Proceedings of the 13th Annual European Symposium on Algorithms (ESA-2005), Springer, .
Reasoning Web 2005 (, ), (Norbert Eisinger, Jan Maluszynski, eds.), Springer, .
RoSy: A Rough Knowledge Base System (, , , ), In Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, Springer, .
The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups (), In Theoretical Computer Science, volume 345, .
A Trichotomy in the Complexity of Propositional Circumscription (), In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, .
Propositional Abduction is Almost Always Hard (, ), In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), .
An Approach to Diagnosability Analysis of Interacting Finite State Systems (), PhD thesis, Linköping University, .
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), Springer, .
Adding Clauses to Poor Man's Logic (Without Increasing the Complexity) (), In Journal of Applied Non-Classical Logics, volume 15, .
Towards Types for Web Rule Languages (), Chapter in Reasoning Web 2005, Springer, .
Supermodularity on chains and complexity of maximum constraint satisfaction problems (, , , ), In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroCOMB-2005), .
Applications of General Exact Satisfiability in Propositional Logic Modelling (), In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Springer, .
Algorithms for Max Hamming Exact Satisfiability (), In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC-2005), Springer, .
Counting Models for 2SAT and 3SAT Formulae (, , ), In Theoretical Computer Science, volume 332, .
Proving Correctness and Completeness of Normal Programs - A Declarative Approach (, ), In Theory and Practice of Logic Programming, volume 5, .
Descriptive Typing Rules for Xcerpt (, , , ), In Principles and Practice of Semantic Web Reasoning, Third International Workshop, PPSWR 2005, Springer, .
Partitioning based algorithms for some colouring problems (), In Proceedings of the Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, .
Algorithms for the Maximum Hamming Distance Problem (, ), In Recent Advances in Constraints, Springer, .
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, .
Constructing Algorithms for Constraint Satisfaction and Related Problems (), PhD thesis, Linköping University, .
2004
Proceedings of the First International Workshop on Teaching Logic Programming: TeachLP 2004, St Malo, (M. Ducass?é, U. Nilsson, D. Seipel, eds.), LiU E-press, .
Towards Rough Datalog: Embedding Rough Sets in Prolog (, ), Chapter in "Rough-Neural Computing:Techniques for Computing with Words" (Sankar Pal, Lech Polkowski, Andrzej Skowron, eds.), Springer-Verlag, volume XXV, .
Exact Algorithms for Finding Minimum Transversals in Rank-3 Hypergraphs (), In Journal of Algorithms, volume 51, .
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), .
An Algebraic Approach to the Complexity of Propositional Circumscription (, ), In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS-2004), .
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), .
Constraint satisfaction problems on intervals and lengths (, , ), In SIAM Journal on Discrete Mathematics, volume 17, .
Recognizing Frozen Variables in Constraint Satisfaction Problems (, ), In Theoretical Computer Science, volume 329, .
Complexity Classification in Qualitative Temporal Constraint Reasoning (, ), In Artificial Intelligence, volume 160, .
The Complexity of Counting Homomorphisms Seen from the Other Side (, ), In Theoretical Computer Science, volume 329, .
Algorithms for Four Variants of the Exact Satisfability Problem (, , ), In Theoretical Computer Science, volume 320, .
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, .
2003
From rough sets to rough knowledge bases (, , ), In Fundamenta Informaticae, volume 57, .
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) (G.Wang, Q.Liu, Y.Y. Yao, A. Skowron, eds.), Springer-Verlag, volume 2639, .
On integrating rules into the Semantic Web (), In Electronic Notes in Theoretical Computer Science (G. Vidal, ed.), Elsevier, volume 86, .
Principles and Practice of Semantic Web Reasoning (, , ), Springer-Verlag, volume 2901, .
On Types for XML Query Language Xcerpt (, ), In International Workshop, PPSWR 2003, Mumbai, India, December 8, 2003, Proceedings, Springer Verlag, . (ISBN: 3-540-20582-9)
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, .
Fault Isolation Using Automatic Abstraction To Avoid State Space Explosion (, , ), In Workshop on Model Checking and Artificial Intelligence, Acapulco, .
Model Checking Based Fault Isolation Using Automatic Abstraction (, , ), In Proc. of the 14th Intl Workshop of Principles of Diagnosis, Washington DC, .
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra (, , ), In Journal of the ACM, volume 5, .
Point algebras for temporal reasoning: Algorithms and complexity (, ), In Artificial Intelligence, volume 2, .
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), .
2002
Static and Dynamic Slicing of Constraint Logic Programs (, , ), In Automated Software Engineering, volume 9, .
Towards Rough Datalog: embedding Rough Sets in Prolog (, ), In Rough-Neuro Computing (L. Polkowski S. K. Pal, A. Skowron eds, eds.), Springer-Verlag, . (To appear)
Fault Isolation using Process Algebra Models (, , ), In 13th Intl Workshop on Principles of Diagnosis, DX02, .
The Complexity of Constraints on Intervals and Lengths (, , ), In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS-2002), .
Extending the Point Algebra into the Qualitative Algebra (, ), In Proceedings of the 9th International Symposium on Temporal Representation and Reasoning (TIME-2002), .
Using parametric set constraints for locating errors in CLP programs (, , ), In Theory and Practice of Logic Programming, volume 2, .
Counting Satisfying Assignments in 2-SAT and 3-SAT (, , ), In Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON-2002), .
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), .
A Logic Based Asynchronous Multi-Agent System (, , ), In Electronic Notes in Theoretical Computer Science, Elsevier, volume 70, .
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, .
Disjunctions, Independence, Refinements (, , ), In Artificial Intelligence, volume 140, .
A Method for Metric Temporal Reasoning (), In Proceedings of the 18th (US) National Conference on Artificial Intelligence (AAAI-2002), .
Finite Domain Constraint Satisfaction Using Quantum Computation (, ), In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS-2002), .
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), .
2001
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), .
Parametric Descriptive Types for (C)LP (, , ), In The 10th International French Speaking Conference for Logic and Constraint Programming (P. Codognet, ed.), Hermes Science Publications, .
Semantic Inspection of Software Artifacts: From Theory To Practice (), PhD thesis, Dept of Computer and Information Science, Linköping University, .
Semantic Inspection of UML Designs (), In Proc. of the 1st Workshop on Inspection in Software Engineering, WISE'01, .
Model-Checking Based Fault Isolation in UML (, , ), In Proc. 12th Intl Workshop on Principles of Diagnosis, DX01, .
Proving Correctness and Completeness of Normal Programs: A Declarative Approach (, ), In Proceedings of the 17th International Conf. on Logic Programming (ICLP'01), Springer-Verlag, .
Unavoidable Configurations of Parameterized Rings of Processes (, , ), In Proc. CONCUR'01, Springer-Verlag, .
The Point Algebra for Branching Time Revisited (), In Proceedings of the 17th Joint German/Austrin Conference on Artificial Intelligence (KI-2001), .
2000
Constraint Logic Programming for Local and Symbolic Model-checking (, ), In Proc. of the Int'l Conf. on Computational Logic (CL2000), Springer-Verlag, .
Towards Behavioral Model Fault Isolation for Object Oriented Control Systems (), PhD thesis, Dept of Computer and Information Science, Linköping University, .
Fault Isolation in Object Oriented Control Systems (, , , ), In IFAC SAFEPROCESS 2000, Budapest, .
Boolean Constraint Satisfaction: Complexity Results for Optimization Problems with Arbitrary Weights (), In Theoretical Computer Science, volume 244, .
Towards Efficient Universal Planning-A Randomized Approach (, , ), In Artificial Intelligence, volume 117, .
Planning with Reduced Operator Sets (, ), In Proc. of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-2000), .
Locating Type Errors in Untyped CLP Programs (, , ), In Analysis and Visualization Tools for Constraint Programming, Springer-Verlag, .
Type-based Diagnosis of CLP Programs (, , ), In Electronic Notes in Theoretical Computer Science, volume 30, .
Building Tractable Disjunctive Constraints (, , , ), In Journal of the ACM, volume 47, .
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), .
Disjunctive Temporal Reasoning in Partially Ordered Time Structures (, ), In Proceedings of the 17th (US) National Conference on Artificial Intelligence (AAAI-2000), .
Constraints, Adjunctions and (Co)algebras (), In Workshop on Coalgebraic Methods in Computer Science (CMCS-2000), Berlin, .
Some Observations on Durations, Scheduling and Allen's Algebra (, ), In Proc. of the Sixth International Conference on Principles and Practice of Constraint Programming (CP2000), .
1999
On-the-fly Model Checking of CTL Formulas using Constraint Logic Programming (, ), In Intl Workshop of Constraint Programming for Time-critical Applications, Lisbon, .
Efficient Planning for a Miniature Assembly Line (, , ), In Artificial Intelligence in Engineering, volume 13, .
Computational Complexity of Relating Time Points with Intervals (, , ), In Artificial Intelligence, volume 109, .
Strong Bounds on the Approximability of Two PSPACE-hard Problems in Propositional Planning (), In Annals of Mathematics and Artificial Intelligence, volume 26, .
Unique Kernel Diagnosis (), PhD thesis, Linköping University, .
Some Results on the Complexity of Planning with Incomplete Information (, ), In Proc. of the Fifth European Conference on Planning (ECP-99), .
It Is Declarative: On Reasoning about Logic Programs (), In Intl Conf on Logic Programming, Las Cruces, NM, .
Type Analysis for CHIP (, ), In Proc. of the Seventh International Conference on Algebraic Methotology and Software Technology (AMAST'98), Springer-Verlag, .
Type-based Diagnosis of CLP Programs (, , ), In Proc. of 10th Workshop on Logic Programming Environments, Las Cruces, NM, .
Diagnosis of CHIP programs using type information (, , ), In APPIA-GULP-PRODE'99 - 1999 Joint Conference on Declarative Programming, L'Aquila Italy, .
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), Springer-Verlag, .
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), Springer-Verlag, .
1998
Static Incorrectness Diagnosis of CLP(FD) (), PhD thesis, Linköping University, .
The Reviewer's Workbench: An Internet Tool for Program Committees (), In PAPPACT 98: Practical Applications of Prolog and Constraint Technology, .
Detailed Design of Avionics Control Software (, , ), In Proc of 19th IEEE Real-Time Systems Symposium, .
CTL Model Checking using Tabled Logic Programs (, ), In Intl Workshop of Constraint Programming for Time-critical Applications, Nice, .
Near-optimal Nonapproximability Results for Some NPO PB-complete Problems (), In Information Processing Letters, volume 68, .
Tractable plan existence does not imply tractable plan generation (, ), In Annals of Mathematics and Artificial Intelligence, volume 22, .
State-variable Planning Under Structural Restrictions: Algorithms and Complexity (, ), In Artificial Intelligence, volume 100, .
A Unifying Approach to Temporal Constraint Reasoning (, ), In Artificial Intelligence, volume 102, .
A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in $P\omega$ (), In Theoretical Comptuer Science, volume 193, .
Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic (, ), In Journal of Logic and Computation, volume 8, .
A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations (, ), In Artificial Intelligence, volume 106, .
Computational Aspects of Reordering Plans (), In Journal of Artificial Intelligence Research, volume 9, .
Tabulated Resolution for Well-founded Semantics (, ), In J. of Logic Programming, volume 34, .
1997
Directional Types and the Annotation Method (, ), In J. Logic Programming, volume 33, . (The postscript gives an early version..)
Reasoning About Action in Polynomial Time (, ), In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Morgan Kaufmann, .
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, .
Declarative Diagnosis of Constraint Programs: an Assertion Based Approach (, , ), In Proceedings of AADEBUG'97 (Third International Workshop on Automated Debugging), . (Linköping, Sweden)
A Floyd-Hoare Method for Prolog (), In Linköping Electronic Articles in Computer and Information Science, volume 2, . (A former version was presented at a post-conference workshop "Verification and Analysis of Logic Programs" at JICSLP '96.)
Type Inference for CLP(FD) (), In Proc of Intl Logic Programming Symposium 97, MIT Press, . (Poster. Extended version in the Workshop on Tools and Environments for (Constraint) Logic Programming, 1997)
Automatic Verification of Petri Nets in a CLP Framework (), PhD thesis, Linköping University, .
A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters (, ), In Journal of Constraints, volume 2, .
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic (, ), In CONCUR'97, .
The Program Committee Virtual Workbench (), In 2nd International Workshop on Logic Programming Tools for Internet Applications, . (Invited talk)
A Nonapproximability Result for Finite Function Generation (), In Information Processing Letters, volume 63, .
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time (, ), In Journal of Artificial Intelligence Research, volume 7, .
A Complete Classification of Tractability in RCC-5 (, ), In Journal of Artificial Intelligence Research, volume 6, .
Declarative Error Diagnosis of GAPLog Programs (), PhD thesis, Linköping University, .
Algorithms and Complexity for Temporal and Spatial Formalisms (), PhD thesis, Linköping University, .
Twenty-one Large Tractable Subclasses of Allen's Algebra (, ), In Artificial Intelligence, volume 93, .
It is declarative: On Proving Partial Correctness of Logic Programs (), In Workshop on Verification, Model Checking and Abstract Interpretation, .
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), .
1996
Automatic Synthesis of Control Programs in Polynomial Time for an Assembly Line (, , ), In Proceedings of the IEEE Conference on Decision and Control (CDC-96), .
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) (J. Doyle, L. Aiello, eds.), Morgan Kaufmann, .
Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report (, ), In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96), .
On the Size of Reactive Plans (, ), In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96), .
A Linear-Programming Approach to Temporal Reasoning (, ), In Proceedings of the 13th (US) National Conference on Artificial Intelligence (AAAI-96), .
Planning with Abstraction Hierarchies can be Exponentially Less Efficient (, ), In 4th International Symposium of AI and Mathematics, . (Invited talk. Only abstract published.)
Tractable plan existence does not imply tractable plan generation (, ), In 4th International Symposium of AI and Mathematics, .
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic (, ), Technical report, LIENS-96-24 Ecole Normale Superieure, .
A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters (, ), Technical report, LIENS-96-12 Ecole Normale Superieure, .
Reductions of Petri nets and Unfolding of Propositional Logic Programs (, ), In LOPSTR'96, .
Studies in Action Planning: Algorithms and Complexity (), PhD thesis, Linköping University, .
Uniqueness of Scott's Reflexive Domain in $P\omega$ (), In Theoretical Comptuer Science, volume 155, .
Completeness of SLDNF-Resolution for Nonfloundering Queries (), In J. of Logic Programming, volume 27, .
Tabulation-based Logic Programming: A Multi-level View of Query Answering (), PhD thesis, Linköping University, .
On Negation as Instantiation (, ), In 5th International Conf. Algebraic and Logic Programming (M. Hanus, M. Rodriguez-Artalejo, eds.), Springer-Verlag, .
Directional Types in Logic Programming (), PhD thesis, Linköping University, .
1995
Tractable Planning for an Assembly Line (, , ), In New Directions in AI Planning: EWSP'95—3rd European Workshop on Planning (Malik Ghallab, Alfredo Milani, eds.), IOS Press, .
Incremental Planning (, ), In New Directions in AI Planning: EWSP'95—3rd European Workshop on Planning (Malik Ghallab, Alfredo Milani, eds.), IOS Press, .
Five Years of Tractable Planning (), In New Directions in AI Planning: EWSP'95—3rd European Workshop on Planning (Malik Ghallab, Alfredo Milani, eds.), IOS Press, .
Planning with Abstraction Hierarchies can be Exponentially Less Efficient (, ), In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95) (Chris Mellish, ed.), Morgan Kaufmann, .
Planning with Abstraction Hierarchies can be Exponentially Less Efficient (, ), In Proceedings of the Symposium on Abstraction, Reformulation and Approximation, SARA-95 (Alon Levy, Pandurang Nayak, eds.), . (Same paper as IJCAI'95)
Abstract Interpretation: A Kind of Magic (), In Theoretical Comp. Sci., volume 142, .
What is failure? An Approach to Constructive Negation (), In Acta Informatica, volume 32, .
Datalog Programs with Arithmetical Constraints: Hierarchic, Periodic and Spiralling Least Fixpoints (, ), Technical report, LIENS-95-26 Ecole Normale Superieure, .
Logic, Programming and Prolog (, ), John Wiley, .
Exploiting Groundness in Logic Programs (), PhD thesis, Linköping University, .
Complexity of State-variable Planning Under Structural Restrictions (), PhD thesis, Linköping University, .
Magic Computation for Well-founded Semantics (, ), In Non-monotonic Extensions of Logic Programming, Springer-Verlag, .
Expressive Equivalence of Planning Formalisms (), In Artificial Intelligence, volume 76, . (ARTINT 1234.)
Complexity Results for SAS$^+$ Planning (, ), In Computational Intelligence, volume 11, .
Two Aspects of Directional Types (, ), In Proc. of Int'l Conf on Logic Programming 95, MIT Press, .
Directional Types and the Assertion Method (, ), Technical report, INRIA Rocquencourt, . (RR2471)
1994
Optimization of GAPLog programs (, ), In Proceedings of the Tenth Logic Programming Workshop (N. E. Fuchs, G. Gottlob, eds.), . (Report no. 94.10)
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) (Philippe Jorrand, ed.), World Scientific Publishing, .
Reasoning about Run-Time Properties of Logic Programs (), Invited lecture at BENELOG 1994, Sixth Benelux Workshop on Logic Programming, .
Executing Parallel Plans Faster by Adding Actions (), In Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-94) (Anthony G. Cohn, ed.), Wiley, .
Tractable Planning with State Variables by Exploiting Structural Restrictions (, ), In Proceedings of the 12th (US) National Conference on Artificial Intelligence (AAAI-94), .
An Implementation of Gaplog with Data-flow Declarations (), Master's thesis, Linköping University, . (Report no: LiTH-IDA-Ex-9424)
Multi-pass evaluation of functional logic programs (), Chapter in Proc. 21th ACM Symposium on Principles of Programming Languages, The ACM, .
Collage Induction: Proving Properties of Logic Programs by Program Synthesis (), Technical report 464, Department of Computer and Information Science, .
A Dataflow Analysis Method for Ground Prolog (), Chapter in Proceedings of the 11th International Conference on Logic Programming (Pascal Van Hentenryck, ed.), The MIT Press, . (Poster abstract)
Felsökning i GAPLog: En modell för exekvering av logikprogram med fördröjda funktionsanrop (), Master's thesis, Linköping University, . (Report-no: LiTH-IDA-Ex-9441. The report is in Swedish)
Direct, Dual and Contrapositive Proofs by Induction (, ), Chapter in Proc. of International Workshop on Logic Program Synthesis and Transformation, LOPSTR'94, Preprints, Pisa University, .
Synthesis of Directionality Information for GAPLog Programs (), Master's thesis, Linköping University, .
Planning using Transformation between Equivalent Formalisms: A Case Study of Efficiency (), In Comparative Analysis of AI Planning Systems (David Wilkins, ed.), . (Held in conjunction with AAAI-94 shortciteaaai94)
1993
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 (Christer Bäckström, Erik Sandewall, eds.), IOS Press, .
Tractable Planning Problems: A Challenge for Deductive Planning (), In Deductive Approaches to Plan Generation and Plan Recognition (Susanne Biundo, Richard Waldinger, eds.), . (All talks invited. Only abstracts published.)
Completeness of SLDNF-Resolution for Non-floundering Queries (), In Logic Programming - Proceedings of the 1993 International Symposium (D. Miller, ed.), MIT Press, . (A poster abstract)
Complexity Results for SAS$^+$ Planning (, ), In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93) (Ruzena Bajcsy, ed.), Morgan Kaufmann, .
Goal-directed Bottom-up Evaluation of Normal Logic Programs (), In Proc. of the International Logic Programming Symposium, \rm Vancouver, MIT Press, . (Poster abstract)
Logic Programs with External Procedures (, , , , , ), 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, .
Improvements to Compile-Time Analysis for Ground Prolog (), Chapter in Programming Language Implementation and Logic Programming 93 (M. Bruynooghe, J. Penjam, eds.), Springer-Verlag, . (LNCS 724)
Automatic Diagnosis of VLSI Circuits Using Algorithmic Debugging (, , ), Chapter in AADEBUG'93, Proc. of the 1st Int. Workshop on Automated and Algorithmic Debugging (Peter Fritzson, ed.), Springer-Verlag, . (LNCS 749)
SLS-resolution Without Floundering (), In Proc. 2nd International Workshop on Logic Programming and Non-Monotonic Reasoning (L. M. Pereira, A. Nerode, eds.), MIT Press, .
Tabulated Resolution for Well-founded Semantics (), PhD thesis, Linköping University, .
A Grammatical View of Logic Programming (, ), MIT Press, .
Dependency-based Groundness Analysis of Functional Logic Programs (), Technical report 398, Department of Computer and Information Science, .
Avoiding Dynamic Delays in Functional Logic Programs (), In Programming Language Implemantation and Logic Programming 93 (M. Bruynooghe, J. Penjam, eds.), Springer-Verlag, .
Dependency-based Groundness Analysis of Functional Logic Programs (, , ), Technical report IDA-R-93-20, Dept of Computer and Information Science, .
Synthesis of Directionality Information for Functional Logic Programs (, , ), Chapter in Proc. of the Workshop on Static Analysis, WSA'93 (P. Cousot, M. Falaschi, G. Filé, A. Rauzy, eds.), Springer-Verlag, .
Tabulated Resolution for Well-Founded Semantics (, ), Chapter in Proc. of the 1993 International Logic Programming Symposium (D. Miller, ed.), MIT Press, .
1992
Equivalence and Tractability Results for SAS$^+$ Planning (), In Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR-92) (Bill Swartout, Bernhard Nebel, eds.), Morgan Kaufmann, .
Uncertainty and Parallelism in Action Structures (), In ECAI-92 Workshop: Beyond Sequential Planning (Gerd Grosse, ed.), .
On the Computational Complexity of Planning and Story Understanding (, ), In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92) (Bernd Neumann, ed.), Wiley, .
On the Computational Complexity of Temporal Projection and Plan Validation (, ), In Proceedings of the 10th (US) National Conference on Artificial Intelligence (AAAI-92), .
Computational Complexity of Reasoning about Plans (), PhD thesis, Linköping University, .
A Formal Basis for Horn Clause Logic with External Polymorphic Functions (), PhD thesis, Linköping University, .
Towards a Methodology for the Design of Abstract Machines for Logic Programming Languages (), In Journal of Logic Programming, volume 16, .
Abstract Interpretations & Abstract Machines: Contributions to a Methodology for the Implementation of Logic Programs (), PhD thesis, Department of Computer and Information Science, .
Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems (, , ), Chapter in Programming Language Implementation and Logic Programming 92 (M. Bruynooghe, M. Wirsing, eds.), Springer-Verlag, . (LNCS 631)
Logic Programming with External Procedures: An Implementation (), Technical report 326, Department of Computer and Information Science, .
A Unifying View of Structural Induction and Computation Induction for Logic Programs (, ), Chapter in Proc. of Logic Program Synthesis and Transformation (LOPSTR 92), Springer-Verlag, . (Workshops in Computing series)
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, .
Logic Programs with Polymorphic Types: A Condition for Static Type Checking (, ), In Proc. 3rd International Workshop on Conditional Term Rewriting Systems (M. Rusinowitsch, J.L. Rémy, eds.), Springer-Verlag, .
1991
On the Planning Problem in Sequential Control (, ), In Proceedings of the 30th IEEE Conference on Decision and Control (CDC-91), .
Parallel Non-Binary Planning in Polynomial Time (, ), In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91) (Ray Reiter, John Mylopoulos, eds.), Morgan Kaufmann, .
Planning in Polynomial Time: The SAS-PUBS Class (, ), In Computational Intelligence, volume 7, .
Enriching Prolog with S-Unification (, ), In PHOENIX Seminar and Workshop on Declarative Programming (J. Darlington, R. Dietrich, eds.), Springer-Verlag, .
Our LIPS are Sealed: Interfacing SML and Logic Programming (, , ), In Proc. of the Third Int. Workshop on Standard ML (R. Harper, ed.), .
Semantics of Disjunctive Logic Programs and Deductive Databases (), Technical report LiTH-IDA-R-91-32, Department of Computer and Information Science, . (accepted to The Second Int. Conference on Deductive and Object-Oriented Databases, Munich December 1991)
Stable Semantics for Disjunctive Logic Programs (), Technical report LiTH-IDA-R-91-22, Department of Computer and Information Science, . (to appear in Journal of New Generation Computing)
Induction using Extended Prolog Execution and Proof-Extraction (), Master's thesis, Linköping University, .
Abstract Interpretation: A Kind of Magic (), Chapter in Programming Language Implementation and Logic Programming 91 (J. Maluszynski, M. Wirsing, eds.), Springer-Verlag,, . (Extended version to appear in Theoretical Computer Science)
Attribute Grammars and Logic Programs: A Comparison of Concepts (), Chapter in Attribute Grammars, Applications and Systems, Prague Summer School (H. Alblas, B. Melichar, eds.), Springer-Verlag, .
SPILL: A Specification Language Based on Logic Programming (), Technical report LiTH-IDA-R-91-28, Department of Computer and Information Science, .
PageBreak: An Exercise in Specification and Derivation (), Technical report LiTH-IDA-R-91-27, Department of Computer and Information Science, .
Towards Practical Executable Specifications in Logic (), Technical report LiTH-IDA-R-91-26, Department of Computer and Information Science, .
A Decision Procedure for a Subtheory of Linear Arithmetic with Lists (), Technical report LiTH-IDA-R-91-33, Department of Computer and Information Science, .
Constructive Negation by Fail Answers (), Technical report LiTH-IDA-R-91-23, Department of Computer and Information Science, .
Strict Completion of Logic Programs (, ), In New Generation Computing, volume 9, .
Operational Completeness of Logic Programs with External Procedures (), Master's thesis, Linköping University, . (Report no: LiTH-IDA-Ex-9104)
S-SLD-Resolution: An Operational Semantics for Logic Programs with External Procedures (), Chapter in Programming Language Implementation and Logic Programming 91 (J. Maluszynski, M. Wirsing, eds.), Springer-Verlag, .
Unification in Incompletely Specified Theories: A Case Study (), Chapter in Mathematical Foundations of Computer Science 1991 (A. Tarlecki, ed.), Springer-Verlag, .
A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics (, , ), In Information Processing Letters, volume 40, .
1990
Planning in Polynomial Time (, ), In Expert Systems in Engineering: Principles and Applications. International Workshop (G Gottlob, W Nejdl, eds.), Springer, volume 462, .
Debugging Prolog Programs Declaratively (), Chapter in Proc. of META'90 (M. Bruynooghe, ed.), MIT Press, .
Systematic Semantic Approximations of Logic Programs (), Chapter in Programming Language Implementation and Logic Programming 90 (P. Deransart, J. Małuszynski, eds.), Springer-Verlag, . (LNCS 456)
SLDFA-Resolution - Computing Answers for Negative Queries (), Technical report 253, Department of Computer and Information Science, .
Logic, Programming and Prolog (, ), Wiley and Sons, .
What Kind of Grammars are Logic Programs. (, ), Chapter in Logic and Logic Grammars for Language Processing (P. Saint-Dizier, S. Szpakowicz, eds.), Ellis Horwood, .
Logical Modelling of Simplified Geometrical Objects and Mechanical Assembly Processes (), In Advances in Spatial Reasoning (Su-Shing Chen, ed.), Ablex, volume 1, .
1989
A Systematic Approach to Abstract Interpretation of Logic Programs (), Technical report 196, Department of Computer and Information Science, .
Towards a Framework for the Abstract Interpretation of Logic Programs (), In Programming Language Implementation and Logic Programming 88, Springer-Verlag, .
Contributions to the Declarative Approach to Debugging Prolog Programs (), Technical report 187, Department of Computer and Information Science, .
Fail Substitutions for Negation as Failure (, ), Chapter in Proc. of NACLP (E.L. Lusk, R.A. Overbeek, eds.), MIT Press, .
Algorithmic Debugging with Assertions (, , ), In Meta-programming in Logic Programming (H. Abramson, M.H. Rogers, eds.), MIT Press, .
A Grammatical View of Logic Programming (, ), In Programming Language Implementation and Logic Programming 88, Springer-Verlag, .
Horn Clause Logic with External Procedures: Towards a Theoretical Framework. (), Technical report 197, Department of Computer and Information Science, .
1988
A Representation of Coordinated Actions Characterized by Interval Valued Conditions (), In Proceedings of the 3rd International Symposium on Methodologies for Intelligent systems (ISMIS-88) (Zbigniew W Ras, Lorenza Saitta, eds.), North-Holland, .
Action Structures with Implicit Coordination (), In Proceedings of the 3rd International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-88) (Tim O'Shea, Vasil Sgurev, eds.), North-Holland, .
A Representation of Coordinated Actions (), In Proceedings of the 1st Scandinavian Conference on Artificial Intelligence (SCAI-88) (Thore Danielsen, ed.), IOS Press, . (em Award winning paper)
Logic Programming with External Procedures: Introducing S-Unification (, , ), In Information Processing Letters, volume 27, .
The Use of Assertions in Algorithmic Debugging (, , ), In Proc. of Fifth Generation Computer Systems 88, .
Inductive Assertion Method for Logic Programs (, ), In Theoretical Computer Science, volume 59, .
Towards a Clean Amalgamation of Logic Programs with External Procedures (, ), In Proc. of International Conference and Symposium on Logic Programming 88, MIT Press, . (Also in \em Proc. of PLILP '88, LNCS 348, Springer-Verlag, 1989)
1987
Do Logic Programs Resemble Programs in Conventional Languages? (), In Proceedings of 1987 Symposium on Logic Programming, .
1986
AID: An Alternative Implementation of DCGs (), In New Generation Comput., volume 4, .
1985
Relating Logic Programs and Attribute Grammars (, ), In J.\ of Logic Programming, volume 2, .
1984
Modelling Data Dependencies in Logic Programs by Attribute Grammars (, ), Technical report RR 323, INRIA, .