krr.bib

@string{aaai = {Proceedings of the {AAAI} Conference on Artificial Intelligence}}

@string{aaaimit = {{AAAI/MIT} Press}}

@string{acm = {{ACM} Press}}

@string{acmcs = {{ACM} Computing Surveys}}

@string{acta = {Acta Informatica}}

@string{addison = {Addison-Wesley}}

@string{aei = {Advanced Engineering Informatics}}

@string{ai = {Artificial Intelligence}}

@string{aiai = {Artificial Intelligence Applications Institute}}

@string{aicom = {{AI} Communications}}

@string{aiedam = {Artificial Intelligence for Engineering Design, Analysis and Manufacturing}}

@string{aim = {{AI} Magazine}}

@string{aimsa = {AIMSA}}

@string{aisb = {AISB}}

@string{amai = {Annals of Mathematics and Artificial Intelligence}}

@string{bi = {B.I. Wissenschaftsverlag}}

@string{caap = {Proceedings of the Colloquium on Trees in Algebra and Programming}}

@string{cacm = {Communications of the {ACM}}}

@string{cade = {Proceedings of the Conference on Automated Deduction}}

@string{ci = {Computational Intelligence}}

@string{cls = {Collaborative Systems Laboratory, University of Massachusetts Amherst}}

@string{cs = {Cognitive Science}}

@string{cup = {Cambridge University Press}}

@string{dai = {Department of Artificial Intelligence}}

@string{dai-adr = {5 Forrest Hill, Edinburgh~EH1~2QL Scottland UK}}

@string{ecai = {Proceedings of the European Conference on Artificial Intelligence}}

@string{eccai = {European Coordinating Commitee for Artificial Intelligence (ECCAI)}}

@string{ecrc = {European Computer-Industrie Research Center, Munich}}

@string{elsevier = {Elsevier Science}}

@string{etai = {Electronic Transactions on Artificial Intelligence}}

@string{faw = {Forschungsinstitut für anwendungsorientierte Wissensverarbeitung}}

@string{fgcs = {Proceedings of the International Conference on Fifth Generation Computer Systems}}

@string{gi = {Gesellschaft für Informatik e.V.}}

@string{gmd = {Gesellschaft für Mathematik und Datenverarbeitung mbH}}

@string{gmd-adr = {Schlo{\ss} Birlinghoven, Postfach 1240, D-5205 St. Augustin 1}}

@string{gwai = {Proceedings of the German Workshop on Artificial Intelligence}}

@string{icalp = {Proceedings of the International Conference on Automata, Languages, and Programming}}

@string{iclp = {Proceedings of the International Conference on Logic Programming}}

@string{iclp-slp = {Proceedings of the International Conference and Symposium on Logic Programming}}

@string{icsi = {International Computer Science Institute}}

@string{ieee = {{IEEE} Computer Society Press}}

@string{ieeese = {{IEEE} Transactions on Software Engineering}}

@string{ieeetc = {{IEEE} Transactions on Computers}}

@string{ifb = {Informatik Fachberichte, Springer}}

@string{ifip = {Proceedings of the World Computer Congress of the IFIP}}

@string{ijcai = {Proceedings of the International Joint Conference on Artificial Intelligence}}

@string{ijpr = {International Journal of Production Research}}

@string{iki = {FG Intellektik, FB Informatik, TH Darmstadt}}

@string{iki:adr = {Alexanderstra{\ss}e 10, D-64283 Darmstadt, Germany}}

@string{iki:long = {Fachgebiet Intellektik, Fachbereich Informatik, Technische Hochschule Darmstadt}}

@string{inria = {INRIA}}

@string{ios = {{IOS} Press}}

@string{ipl = {Information Processing Letters}}

@string{irisa:adr = {Campus de Beaulieu, F-35042 Rennes Cedex, France}}

@string{is = {Informatik-Spektrum}}

@string{isa = {{IEEE} Intelligent Systems and their Applications}}

@string{jacm = {Journal of the ACM}}

@string{jair = {Journal of Artificial Intelligence Research}}

@string{jancl = {Journal of Applied Non-Classical Logics}}

@string{jar = {Journal of Automated Reasoning}}

@string{jcss = {Journal of Computer and System Sciences}}

@string{jds = {Journal of Data Semantics}}

@string{jim = {Journal of Intelligent Manufacturing}}

@string{jlc = {Journal of Logic and Computation}}

@string{jlp = {Journal of Logic Programming}}

@string{jsat = {Journal on Satisfiability, Boolean Modeling and Computation}}

@string{jsc = {Journal of Symbolic Computation}}

@string{jsl = {Journal of Symbolic Logic}}

@string{jsttt = {International Journal on Software Tools for Technology Transfer}}

@string{jucs = {Journal of Universal Computer Science}}

@string{kgc = {Proceedings of the Kurt Gödel Colloquium}}

@string{kluwer = {Kluwer Academic Publishers}}

@string{lnai = {Lecture Notes in Artificial Intelligence}}

@string{lnbi = {Lecture Notes in Bioinformatics}}

@string{lncs = {Lecture Notes in Computer Science}}

@string{m-k = {Morgan Kaufmann Publishers}}

@string{mcc = {Microelectronics and Computer Technology Corporation, Austin}}

@string{n-h = {North-Holland Publishing Company}}

@string{ncai = {National Conference on Artificial Intelligence}}

@string{ngc = {New Generation Computing}}

@string{ogai = {Österreichische AI Tagung}}

@string{pitman = {Pitman / Morgan Kaufmann}}

@string{popl = {Proceedings of the ACM Symposium on Principles of Programming Languages}}

@string{rta = {Proceedings of the Conference on Rewriting Techniques and Applications}}

@string{sbm = {Systemtechnik Berner \& Mattner}}

@string{scp = {Science of Computer Programming}}

@string{sicomp = {SIAM Journal on Computing}}

@string{slp = {Proceedings of the Symposium on Logic Programming, Computer Society, Press of the IEEE, Washington}}

@string{spinw = {International SPIN Workshop on Model Checking of Software}}

@string{springer = {Springer-Verlag}}

@string{sri = {Stanford Research Institute (SRI)}}

@string{sri-adr = {333 Ravenswood Ave., Menlo Parc, CA 94025}}

@string{ta = {Triumph Adler AG}}

@string{tarc = {Proceedings of Theoretical Aspects of Reasoning about Knowledge}}

@string{tcs = {Theoretical Computer Science}}

@string{teubner = {Teubner Verlag, Stuttgart}}

@string{thd = {Technische Hochschule Darmstadt, Fachbereich Informatik}}

@string{tkde = {IEEE Transactions on Knowledge and Data Engineering}}

@string{tocl = {ACM Transactions on Computational Logic}}

@string{tocs = {ACM Transactions on Computer Systems}}

@string{tods = {ACM Transactions on Database Systems}}

@string{tog = {ACM Transactions on Graphics}}

@string{toms = {ACM Transactions on Mathematical Software}}

@string{toplas = {ACM Transactions on Programming Languages and Systems}}

@string{tplp = {Theory and Practice of Logic Programming}}

@string{tum = {Technische Universität München, Institut für Informatik}}

@string{tum-adr = {Postfach 202420, 8000 München 2 (Germany)}}

@string{ubc = {Department of Computer Science, University of British Columbia}}

@string{unibwm = {Universität der Bundeswehr München}}

@string{unif = {Proceedings of the International Workshop on Unification}}

@string{uofp = {University of Potsdam}}

@string{wiley = {John Wiley \& sons}}

@string{yale = {Department of Computer Science, Yale University}}

@article{aapesc09a,
  title = {Declarative workflows: Balancing between flexibility and support},
  author = {W. van der Aalst and M. Pesic and H. Schonenberg},
  journal = {Computer Science - Research and Development},
  number = {2},
  pages = {99-113},
  volume = {23},
  year = {2009}
}

@article{abaman89a,
  title = {Temporal Logic Programming},
  author = {M. Abadi and Z. Manna},
  doi = {10.1016/S0747-7171(89)80070-7},
  journal = jsc,
  pages = {277-295},
  volume = {8},
  year = {1989}
}

@inproceedings{abblchduhewo14a,
  title = {The {D-FLAT} System for Dynamic Programming on Tree Decompositions},
  author = {M. Abseher and B. Bliem and G. Charwat and F. Dusberger and M. Hecher and S. Woltran},
  crossref = {jelia14},
  pages = {558-572}
}

@article{abcacechcolesttazd03a,
  title = {Aurora: a new model and architecture for data stream management},
  author = {D. Abadi and D. Carney and U. {\c{C}}etintemel and M. Cherniack and C. Convey and S. Lee and M. Stonebraker and N. Tatbul and S. Zdonik},
  journal = {Journal on Very Large Data Bases},
  number = {2},
  pages = {120-139},
  volume = {12},
  year = {2003}
}

@article{abditrza12a,
  title = {Dependency Solving: A Separate Concern in Component Evolution Management},
  author = {P. Abate and R. {D}i Cosmo and R. Treinen and S. Zacchiroli},
  doi = {10.1016/J.JSS.2012.02.018},
  journal = {Journal of Systems and Software},
  number = {10},
  pages = {2228-2240},
  volume = {85},
  year = {2012}
}

@inproceedings{abdsch99a,
  title = {Nurse Scheduling using Constraint Logic Programming},
  author = {S. Abdennadher and H. Schlenker},
  crossref = {aaai99},
  pages = {838-843},
  url = {http://www.aaai.org/Library/IAAI/1999/iaai99-118.php}
}

@article{abgehaug23a,
  title = {Coordination of Multiple Robots along given Paths with Bounded Junction Complexity},
  author = {M. Abrahamsen and T. Geft and D. Halperin and B. Ugav},
  doi = {10.48550/arXiv.2303.00745},
  journal = {CoRR},
  url = {https://doi.org/10.48550/arXiv.2303.00745},
  volume = {abs/2303.00745},
  year = {2023}
}

@inproceedings{abgemuscwo15a,
  title = {Shift Design with Answer Set Programming},
  author = {M. Abseher and M. Gebser and N. Musliu and T. Schaub and S. Woltran},
  crossref = {lpnmr15},
  pages = {32-39}
}

@inproceedings{abgemuscwo15b,
  title = {Shift Design with Answer Set Programming},
  author = {M. Abseher and M. Gebser and N. Musliu and T. Schaub and S. Woltran},
  crossref = {aspocp15}
}

@article{abgemuscwo15c,
  title = {Shift Design with Answer Set Programming},
  author = {M. Abseher and M. Gebser and N. Musliu and T. Schaub and S. Woltran},
  journal = {Fundamenta Informaticae},
  number = {1},
  pages = {1-25},
  volume = {147},
  year = {2016}
}

@book{abhuvi95a,
  title = {Foundations of Databases},
  author = {S. Abiteboul and R. Hull and V. Vianu},
  publisher = addison,
  year = {1995}
}

@incollection{abjago05a,
  title = {Quad-trees: A Data Structure for Storing Pareto Sets in Multiobjective Evolutionary Algorithms with Elitism},
  author = {S. Mostaghim and J. Teich},
  editor = {A. Abraham and L. Jain and R. Goldberg},
  booktitle = {Evolutionary Multiobjective Optimization: Theoretical Advances and Applications},
  pages = {81-104},
  publisher = springer,
  year = {2005}
}

@inproceedings{abjoossctowa19a,
  title = {Train scheduling with hybrid {ASP}},
  author = {D. Abels and J. Jordi and M. Ostrowski and T. Schaub and A. Toletti and P. Wanko},
  crossref = {lpnmr19},
  pages = {3-17}
}

@article{abjoossctowa21a,
  title = {Train scheduling with hybrid {ASP}},
  author = {D. Abels and J. Jordi and M. Ostrowski and T. Schaub and A. Toletti and P. Wanko},
  doi = {10.1017/S1471068420000046},
  journal = tplp,
  number = {3},
  pages = {317-347},
  volume = {21},
  year = {2021}
}

@article{abniolroma12a,
  title = {A New Look at {BDD}s for Pseudo-{B}oolean Constraints},
  author = {I. Ab{\'\i}o and R. Nieuwenhuis and A. Oliveras and E. Rodr{\'\i}guez-Carbonell and V. Mayer-Eichberger},
  journal = jair,
  pages = {443-480},
  volume = {45},
  year = {2012}
}

@article{abscbefrhe09a,
  title = {Parallel {SAT} Solving in Bounded Model Checking},
  author = {E. {\'A}brah{\'a}m and T. Schubert and B. Becker and M. Fr{\"a}nzle and C. Herde},
  journal = jlc,
  url = {http://logcom.oxfordjournals.org/content/early/2009/02/09/logcom.exp002},
  year = {2009}
}

@article{acneolro10a,
  title = {Practical algorithms for unsatisfiability proof and core generation in {SAT} solvers},
  author = {R. Ach{\'a} and R. Nieuwenhuis and A. Oliveras and E. Rodr{\'\i}guez-Carbonell},
  journal = aicom,
  pages = {145-157},
  volume = {23},
  year = {2010}
}

@book{adams75a,
  title = {The Logic of Conditionals},
  author = {E. Adams},
  address = {Dordrecht},
  publisher = {Reidel},
  year = {1975}
}

@article{agascapevi17a,
  title = {Verification for {ASP} denotational semantics: {A} case study using the {PVS} theorem prover},
  author = {F. Aguado and P. Ascariz and P. Cabalar and G. P{\'e}rez and C. Vidal},
  journal = {Logic Journal of the {IGPL}},
  number = {2},
  pages = {195-213},
  volume = {25},
  year = {2017}
}

@article{agcadipescscvi20a,
  title = {Linear-Time Temporal Answer Set Programming},
  author = {F. Aguado and P. Cabalar and M. Di{\'e}guez and G. P{\'e}rez and T. Schaub and A. Schuhmann and C. Vidal},
  doi = {10.1017/S1471068421000557},
  journal = tplp,
  number = {1},
  pages = {2-56},
  volume = {23},
  year = {2023}
}

@article{agcadipevi13a,
  title = {Temporal equilibrium logic: a survey},
  author = {F. Aguado and P. Cabalar and M. Di{\'e}guez and G. P{\'e}rez and C. Vidal},
  doi = {10.1080/11663081.2013.798985},
  journal = jancl,
  number = {1-2},
  pages = {2-24},
  volume = {23},
  year = {2013}
}

@article{agcadipevi17a,
  title = {Temporal Equilibrium Logic with Past Operators},
  author = {F. Aguado and P. Cabalar and M. Di{\'e}guez and G. P{\'e}rez and C. Vidal},
  journal = jancl,
  number = {3-4},
  pages = {161-177},
  volume = {27},
  year = {2017}
}

@article{agcafapepevi19a,
  title = {Forgetting auxiliary atoms in forks},
  author = {F. Aguado and P. Cabalar and J. Fandinno and D. Pearce and G. P{\'e}rez and C. Vidal},
  journal = ai,
  pages = {575-601},
  volume = {275},
  year = {2019}
}

@article{agcafapepevi19b,
  title = {Revisiting Explicit Negation in Answer Set Programming},
  author = {F. Aguado and P. Cabalar and J. Fandinno and D. Pearce and G. P{\'e}rez and C. Vidal},
  journal = tplp,
  number = {5-6},
  pages = {908-924},
  volume = {19},
  year = {2019}
}

@article{agcafapepevi22a,
  title = {A polynomial reduction of forks into logic programs},
  author = {F. Aguado and P. Cabalar and J. Fandinno and D. Pearce and G. P{\'e}rez and C. Vidal},
  journal = ai,
  pages = {103712},
  volume = {308},
  year = {2022}
}

@inproceedings{agcafapepevi22b,
  title = {Syntactic {ASP} Forgetting with Forks},
  author = {F. Aguado and P. Cabalar and J. Fandinno and D. Pearce and G. P{\'e}rez and C. Vidal},
  crossref = {lpnmr22},
  pages = {3-15}
}

@article{agcafapepevi24a,
  title = {Syntactic {ASP} forgetting with forks},
  author = {F. Aguado and P. Cabalar and J. Fandinno and D. Pearce and G. P{\'e}rez and C. Vidal},
  journal = ai,
  pages = {104033},
  volume = {326},
  year = {2024}
}

@inproceedings{agcafapevi20a,
  title = {Explicit Negation in Linear-Dynamic Equilibrium Logic},
  author = {F. Aguado and P. Cabalar and J. Fandinno and G. P{\'e}rez and C. Vidal},
  crossref = {ecai20},
  pages = {569-576}
}

@article{agcapepevi15a,
  title = {A denotational semantics for equilibrium logic},
  author = {F. Aguado and P. Cabalar and D. Pearce and G. P{\'e}rez and C. Vidal},
  journal = tplp,
  number = {4-5},
  pages = {620-634},
  volume = {15},
  year = {2015}
}

@inproceedings{agcapevi08a,
  title = {Strongly Equivalent Temporal Logic Programs},
  author = {F. Aguado and P. Cabalar and G. P{\'e}rez and C. Vidal},
  crossref = {jelia08},
  pages = {8-20}
}

@inproceedings{agcapevi11a,
  title = {Loop Formulas for Splitable Temporal Logic Programs},
  author = {F. Aguado and P. Cabalar and G. P{\'e}rez and C. Vidal},
  crossref = {lpnmr11},
  pages = {80-92}
}

@article{agcapevidi17a,
  title = {Temporal logic programs with variables},
  author = {F. Aguado and P. Cabalar and G. P{\'e}rez and C. Vidal and M. Di{\'e}guez},
  journal = tplp,
  number = {2},
  pages = {226-243},
  volume = {17},
  year = {2017}
}

@article{agomon94a,
  title = {The Taming of the Cut. Classical Refutations with Analytic Cut.},
  author = {M. {D}'\relax Agostino and M. Mondadori},
  journal = jlc,
  number = {3},
  pages = {285-319},
  volume = {4},
  year = {1994}
}

@inproceedings{agpevi13a,
  title = {Integrating Temporal Extensions of Answer Set Programming},
  author = {F. Aguado and G. P{\'e}rez and C. Vidal},
  crossref = {lpnmr13},
  doi = {10.1007/978-3-642-40564-8_3},
  pages = {23-35}
}

@article{agvahabe17a,
  title = {Stream Reasoning: a Survey and Outlook: A summary of ten years of research and a vision for the next decade},
  author = {D. Dell'Aglio and E. {Della Valle} and F. van Harmelen and A. Bernstein},
  journal = {Data Science Journal},
  volume = {1},
  year = {2017}
}

@article{ahgaul72a,
  title = {The Transitive Reduction of a Directed Graph},
  author = {A. Aho and M. Garey and J. Ullman},
  doi = {10.1137/0201008},
  journal = sicomp,
  number = {2},
  pages = {131-137},
  volume = {1},
  year = {1972}
}

@inproceedings{aibikinipr13a,
  title = {Analysis of Portfolio-Style Parallel {SAT} Solving on Current Multi-Core Architectures},
  author = {M. Aigner and A. Biere and C. Kirsch and A. Niemetz and M. Preiner},
  crossref = {pos13epic},
  pages = {28-40}
}

@article{aiemas01a,
  title = {Verifying security protocols as planning in logic programming},
  author = {L. Aiello and F. Massacci},
  journal = tocl,
  number = {4},
  pages = {542-580},
  volume = {2},
  year = {2001}
}

@book{aitkaci91a,
  title = {Warren's Abstract Machine: A Tutorial Reconstruction},
  author = {H. A{\"\i}t-Kaci},
  publisher = {MIT Press},
  year = {1991}
}

@inproceedings{akererpa11a,
  title = {Causal Reasoning for Planning and Coordination of Multiple Housekeeping Robots},
  author = {E. Aker and A. Erdogan and E. Erdem and V. Patoglu},
  crossref = {lpnmr11},
  pages = {311-316}
}

@inproceedings{alamdolemari19a,
  title = {Evaluation of Disjunctive Programs in {WASP}},
  author = {M. Alviano and G. Amendola and C. Dodaro and N. Leone and M. Maratea and F. Ricca},
  crossref = {lpnmr19},
  pages = {241-255}
}

@inproceedings{albrlepe02a,
  title = {Evolving Logic Programs},
  author = {J. Alferes and A. Brogi and J. Leite and L. Pereira},
  crossref = {jelia02},
  pages = {50-61}
}

@inproceedings{alcadofuleperiveza17a,
  title = {The {ASP} System {DLV}2},
  author = {M. Alviano and F. Calimeri and C. Dodaro and D. Fusc{\`a} and N. Leone and S. Perri and F. Ricca and P. Veltri and J. Zangari},
  crossref = {lpnmr17},
  pages = {215-221}
}

@article{alcafalepe11a,
  title = {Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates},
  author = {M. Alviano and F. Calimeri and W. Faber and N. Leone and S. Perri},
  journal = jair,
  pages = {487-527},
  volume = {42},
  year = {2011}
}

@article{alcmak82a,
  title = {On the Logic of Theory Change: Contraction Functions and Their Associated Revision Functions},
  author = {C. Alchourr{\'o}n and D. Makinson},
  journal = {Theoria},
  pages = {14-37},
  volume = {48},
  year = {1982}
}

@inproceedings{aldofaleri13a,
  title = {{WASP}: A Native {ASP} Solver Based on Constraint Learning},
  author = {M. Alviano and C. Dodaro and W. Faber and N. Leone and F. Ricca},
  crossref = {lpnmr13},
  pages = {54-66}
}

@article{aldofiprri23a,
  title = {{ASP} and subset minimality: Enumeration, cautious reasoning and {MUS}es},
  author = {M. Alviano and C. Dodaro and S. Fiorentino and A. Previti and F. Ricca},
  doi = {10.1016/J.ARTINT.2023.103931},
  journal = ai,
  pages = {103931},
  volume = {320},
  year = {2023}
}

@inproceedings{aldoleri15a,
  title = {Advances in {WASP}},
  author = {M. Alviano and C. Dodaro and N. Leone and F. Ricca},
  crossref = {lpnmr15},
  pages = {40-54}
}

@inproceedings{aldoma17a,
  title = {An Advanced Answer Set Programming Encoding for Nurse Scheduling},
  author = {M. Alviano and C. Dodaro and M. Maratea},
  editor = {F. Esposito and R. Basili and S. Ferilli and F. Lisi},
  booktitle = {Proceedings of the Sixteenth International Conference of the Italian Association for Artificial Intelligence},
  pages = {468-482},
  publisher = springer,
  series = lncs,
  volume = {10640},
  year = {2017}
}

@article{aldoma18a,
  title = {Shared Aggregate Sets in Answer Set Programming},
  author = {M. Alviano and C. Dodaro and M. Maratea},
  journal = tplp,
  number = {3-4},
  pages = {301-318},
  url = {http://arxiv.org/abs/1804.08488},
  volume = {18},
  year = {2018}
}

@article{aldoma18b,
  title = {Nurse (re)scheduling via answer set programming},
  author = {M. Alviano and C. Dodaro and M. Maratea},
  doi = {10.3233/IA-170030},
  journal = {Intelligenza Artificiale},
  number = {2},
  pages = {109-124},
  publisher = ios,
  volume = {12},
  year = {2018}
}

@inproceedings{aldomari14a,
  title = {On the Implementation of Weak Constraints in {WASP}},
  author = {M. Alviano and C. Dodaro and J. Marques-Silva and F. Ricca},
  crossref = {aspocp14}
}

@article{aldomari20a,
  title = {Optimum Stable Model Search: Algorithms and Implementation},
  author = {M. Alviano and C. Dodaro and J. Marques-Silva and F. Ricca},
  journal = jlc,
  number = {4},
  pages = {863-897},
  volume = {30},
  year = {2020}
}

@inproceedings{aldori14a,
  title = {Preliminary Report on {WASP} 2.0},
  author = {M. Alviano and C. Dodaro and F. Ricca},
  crossref = {nmr14}
}

@inproceedings{aldori15a,
  title = {Reduct-based Stability Check Using Literal Assumptions},
  author = {M. Alviano and C. Dodaro and F. Ricca},
  crossref = {aspocp15}
}

@inproceedings{aldori15b,
  title = {{JWASP}: A New {J}ava-Based {ASP} Solver},
  author = {M. Alviano and C. Dodaro and F. Ricca},
  crossref = {rcra15},
  pages = {16-23}
}

@inproceedings{alelge23a,
  title = {Flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid Answer Set Programming (Application Paper)},
  author = {R. Ali and M. El-Kholany and M. Gebser},
  crossref = {padl23},
  pages = {85-95}
}

@article{alfage15a,
  title = {Rewriting Recursive Aggregates in Answer Set Programming: Back to Monotonicity},
  author = {M. Alviano and W. Faber and M. Gebser},
  journal = tplp,
  number = {4-5},
  pages = {559-573},
  url = {http://arxiv.org/abs/1507.03923},
  volume = {15},
  year = {2015}
}

@inproceedings{alfage16a,
  title = {From Non-Convex Aggregates to Monotone Aggregates in {ASP}},
  author = {M. Alviano and W. Faber and M. Gebser},
  crossref = {ijcai16},
  pages = {4100-4104}
}

@article{alfage22a,
  title = {Aggregate Semantics for Propositional Answer Set Programs},
  author = {M. Alviano and W. Faber and M. Gebser},
  journal = tplp,
  number = {1},
  pages = {157-194},
  url = {https://arxiv.org/abs/2109.08662},
  volume = {23},
  year = {2023}
}

@article{alfagrle12a,
  title = {Magic Sets for Disjunctive {D}atalog Programs},
  author = {M. Alviano and W. Faber and G. Greco and N. Leone},
  journal = ai,
  pages = {156-192},
  volume = {187-188},
  year = {2012}
}

@incollection{alfanipepfte11a,
  title = {The Disjunctive {D}atalog System {DLV}},
  author = {M. Alviano and W. Faber and N. Leone and S. Perri and G. Pfeifer and G. Terracina},
  editor = {O. de Moor and G. Gottlob and T. Furche and A. Sellers},
  booktitle = {Datalog Reloaded},
  pages = {282-301},
  publisher = springer,
  series = lncs,
  volume = {6702},
  year = {2011}
}

@article{algama85a,
  title = {On the Logic of Theory Change: Partial Meet Contraction and Revision Functions},
  author = {C. Alchourr{\'o}n and P. G{\"a}rdenfors and D. Makinson},
  journal = jsl,
  pages = {510-530},
  volume = {50},
  year = {1985}
}

@inproceedings{aliapaza24a,
  title = {Rethinking Answer Set Programming Templates},
  author = {M. Alviano and G. Ianni and F. Pacenza and J. Zangari},
  crossref = {padl24},
  pages = {82-99}
}

@article{allen83a,
  title = {Maintaining knowledge about temporal intervals},
  author = {J. Allen},
  journal = cacm,
  number = {11},
  pages = {832-843},
  volume = {26},
  year = {1983}
}

@article{allepeprpr00a,
  title = {Dynamic updates of non-monotonic knowledge bases},
  author = {J. Alferes and J. Leite and L. Pereira and H. Przymusinska and T. Przymusinski},
  journal = jlp,
  number = {1-3},
  pages = {43-70},
  volume = {45},
  year = {2000}
}

@inproceedings{allepeprpr98a,
  title = {Dynamic Logic Programming},
  author = {J. Alferes and J. Leite and L. Pereira and H. Przymusinska and T. Przymusinski},
  crossref = {kr98},
  pages = {98-109}
}

@inproceedings{allzil09a,
  title = {Complexity of Decentralized Control: Special Cases},
  author = {M. Allen and S. Zilberstein},
  editor = {Y. Bengio and D. Schuurmans and J. Lafferty and C. Williams and A. Culotta},
  booktitle = {Proceedings of the Twenty-third Annual Conference on Neural Information Processing Systems (NIPS'09)},
  pages = {19-27},
  publisher = {Curran Associates, Inc.},
  year = {2009}
}

@incollection{almara18a,
  title = {A Hybrid Reasoning Approach for Activity Recognition Based on Answer Set Programming and Dempster-Shafer Theory},
  author = {F. {A}l Machot and H. Mayr and S. Ranasinghe},
  editor = {K. Kyamakya and W. Mathis and R. Stoop and J. Chedjou and Z. Li},
  booktitle = {Recent Advances in Nonlinear Dynamics and Synchronization},
  pages = {303-318},
  publisher = springer,
  series = {Studies in Systems, Decision and Control},
  volume = {109},
  year = {2018}
}

@inproceedings{alpage09a,
  title = {A Translation-Based Approach to Contingent Planning},
  author = {A. Albore and H. Palacios and H. Geffner},
  crossref = {ijcai09},
  pages = {1623-1628}
}

@article{alpeprpr02a,
  title = {{LUPS}: A language for updating logic programs},
  author = {J. Alferes and L. Pereira and H. Przymusinska and T. Przymusinski},
  journal = ai,
  number = {1-2},
  pages = {87-116},
  volume = {138},
  year = {2002}
}

@inproceedings{alpeprpr99a,
  title = {{LUPS}: A Language for Updating Logic Programs},
  author = {J. Alferes and L. Pereira and H. Przymusinska and T. Przymusinski},
  crossref = {lpnmr99},
  pages = {162-176}
}

@inproceedings{alqaelefgelefr24a,
  title = {A Greedy Search Based Ant Colony Optimization Algorithm for Large-Scale Semiconductor Production},
  author = {R. Ali and S. Qaiser and M. El-Kholany and P. Eftekhari and M. Gebser and S. Leitner and G. Friedrich},
  crossref = {simultech24},
  pages = {138-149}
}

@inproceedings{alrage11a,
  title = {Effective Heuristics and Belief Tracking for Planning with Incomplete Information},
  author = {A. Albore and M. Ram{\'\i}rez and H. Geffner},
  crossref = {icaps11},
  pages = {2-8}
}

@inproceedings{alramasa02a,
  title = {Generic {ILP} versus Specialized 0-1 {ILP}: An Update},
  author = {F. Aloul and A. Ramani and I. Markov and K. Sakallah},
  crossref = {iccad02},
  pages = {450-457}
}

@inproceedings{alrosc18a,
  title = {Preference Relations by Approximation},
  author = {M. Alviano and J. Romero and T. Schaub},
  crossref = {kr18},
  pages = {2-11}
}

@inproceedings{alrosc19a,
  title = {On the Integration of {CP}-nets in {ASPRIN}},
  author = {M. Alviano and J. Romero and T. Schaub},
  crossref = {ijcai19},
  doi = {10.24963/ijcai.2019/207},
  pages = {1495-1501},
  year = {2019}
}

@article{alucoudil97a,
  title = {Model-Checking in Dense Real-Time},
  author = {R. Alur and C. Courcoubetis and D. Dill},
  journal = {Information and Computation},
  pages = {2-34},
  volume = {104},
  year = {1997}
}

@inproceedings{aluhen92a,
  title = {Logics and models of real time: A survey},
  author = {R. Alur and T. Henzinger},
  booktitle = {Real-Time: Theory in Practice},
  pages = {74-106},
  publisher = springer,
  year = {1992}
}

@article{alvdod16a,
  title = {Anytime answer set optimization via unsatisfiable core shrinking},
  author = {M. Alviano and C. Dodaro},
  crossref = {iclp-tc16},
  doi = {10.1017/S147106841600020X},
  pages = {533-551}
}

@inproceedings{alvdod17a,
  title = {Unsatisfiable Core Shrinking for Anytime Answer Set Optimization},
  author = {M. Alviano and C. Dodaro},
  crossref = {ijcai17},
  doi = {10.24963/ijcai.2017/666},
  pages = {4781-4785}
}

@inproceedings{alvfab13a,
  title = {The Complexity Boundary of Answer Set Programming with Generalized Atoms under the {FLP} Semantics},
  author = {M. Alviano and W. Faber},
  crossref = {lpnmr13},
  pages = {67-72}
}

@inproceedings{alvfab19,
  title = {Chain Answer Sets for Logic Programs with Generalized Atoms},
  author = {M. Alviano and W. Faber},
  crossref = {jelia19},
  pages = {462-478}
}

@article{alvleo15a,
  title = {Complexity and compilation of {GZ}-aggregates in answer set programming},
  author = {M. Alviano and N. Leone},
  journal = tplp,
  number = {4-5},
  pages = {574-587},
  volume = {15},
  year = {2015}
}

@article{amaigapi96a,
  title = {A proof theoretical approach to default reasoning {I}. Tableaux for Default logic},
  author = {G. Amati and L. Aiello and D. Gabbay and F. Pirri},
  journal = jlc,
  number = {2},
  pages = {205-231},
  volume = {6},
  year = {1996}
}

@inproceedings{amanbheskisepave06a,
  title = {{SPC}: a distributed, scalable platform for data mining},
  author = {L. Amini and H. Andrade and R. Bhagwan and F. Eskesen and R. King and P. Philippe and Y. Park and C. Venkatramani},
  booktitle = {Proceedings of the Fourth International Workshop on Data mining standards, Services and Platforms (DMSSP'06)},
  pages = {27-37},
  publisher = acm,
  year = {2006}
}

@inproceedings{amcuritr22a,
  title = {Solving Problems in the Polynomial Hierarchy with {ASP}({Q})},
  author = {G. Amendola and B. Cuteri and F. Ricca and M. Truszczy{\'n}ski},
  crossref = {lpnmr22},
  pages = {373-386}
}

@inproceedings{amdukukumc05a,
  title = {An Analysis of {SAT}-Based Model Checking Techniques in an Industrial Environment},
  author = {N. Amla and X. Du and A. Kuehlmann and R. Kurshan and K. McMillan},
  crossref = {charme05},
  pages = {254-268}
}

@article{ameifilemo16a,
  title = {Semi-equilibrium models for paracoherent answer set programs},
  author = {G. Amendola and T. Eiter and M. Fink and N. Leone and J. Moura},
  journal = ai,
  pages = {219-271},
  volume = {234},
  year = {2016}
}

@article{americ19a,
  title = {Paracoherent Answer Set Semantics meets Argumentation Frameworks},
  author = {G. Amendola and F. Ricca},
  journal = tplp,
  number = {5-6},
  pages = {688-704},
  volume = {19},
  year = {2019}
}

@article{amfama02a,
  title = {Consistency restoration and explanations in dynamic CSPs --- application to configuration},
  author = {J. Amilhastre and H. Fargier and P. Marquis},
  doi = {10.1016/S0004-3702(01)00162-X},
  journal = ai,
  number = {1-2},
  pages = {199-234},
  publisher = elsevier,
  volume = {135},
  year = {2002}
}

@inproceedings{amgilomuru20a,
  title = {Synthesizing strategies under expected and exceptional environment behaviors},
  author = {B. Aminof and G. {D}e Giacomo and A. Lomuscio and A. Murano and S. Rubin},
  crossref = {ijcai20},
  pages = {1674-1680}
}

@inproceedings{amjasesive06a,
  title = {Adaptive Control of Extreme-scale Stream Processing Systems},
  author = {L. Amini and N. Jain and A. Sehgal and J. Silber and O. Verscheure},
  crossref = {icdcs06},
  pages = {71},
  year = {2006}
}

@article{amritr19a,
  title = {Beyond {NP:} Quantifying over Answer Sets},
  author = {G. Amendola and F. Ricca and M. Truszczynski},
  journal = tplp,
  number = {5-6},
  pages = {705-721},
  volume = {19},
  year = {2019}
}

@inproceedings{anbirohasc15a,
  title = {Improving Coordinated {SMT}-based System Synthesis by Utilizing Domain-specific Heuristics},
  author = {B. Andres and A. Biewer and J. Romero and C. Haubelt and T. Schaub},
  crossref = {lpnmr15},
  pages = {55-68}
}

@inproceedings{anbogale13a,
  title = {Improving {WPM}2 for (Weighted) Partial {M}ax{SAT}},
  author = {C. Ans{\'o}tegui and M. Bonet and J. Gab{\`a}s and J. Levy},
  crossref = {cp13},
  pages = {117-132}
}

@article{anbole13a,
  title = {{SAT}-based {MaxSAT} algorithms},
  author = {C. Ans{\'o}tegui and M. Bonet and J. Levy},
  journal = ai,
  pages = {77-105},
  publisher = elsevier,
  volume = {196},
  year = {2013}
}

@book{andbel75a,
  title = {Entailment: The Logic of Relevance and Necessity},
  author = {A. Anderson and N. Belnap},
  publisher = {Princeton University Press},
  volume = {1},
  year = {1975}
}

@inproceedings{anforuststst10a,
  title = {A Rule-Based Language for Complex Event Processing and Reasoning},
  author = {D. Anicic and P. Fodor and S. Rudolph and R. St{\"u}hmer and N. Stojanovic and R. Studer},
  crossref = {rr10},
  pages = {42-57}
}

@inproceedings{angeglharesc13a,
  title = {Symbolic System Synthesis Using Answer Set Programming},
  author = {B. Andres and M. Gebser and M. Gla{\ss} and C. Haubelt and F. Reimann and T. Schaub},
  crossref = {lpnmr13},
  pages = {79-91}
}

@inproceedings{angejasc06a,
  title = {What's a head without a body},
  author = {C. Anger and M. Gebser and T. Janhunen and T. Schaub},
  crossref = {ecai06},
  pages = {769-770}
}

@inproceedings{angelinesc05a,
  title = {The \texttt{nomore++} System},
  author = {C. Anger and M. Gebser and T. Linke and A. Neumann and T. Schaub},
  crossref = {lpnmr05},
  pages = {422-426}
}

@inproceedings{angelinesc05b,
  title = {The \texttt{nomore++} approach to answer set solving},
  author = {C. Anger and M. Gebser and T. Linke and A. Neumann and T. Schaub},
  crossref = {asp05},
  pages = {163-177}
}

@inproceedings{angelinesc05c,
  title = {The \texttt{nomore++} approach to answer set solving},
  author = {C. Anger and M. Gebser and T. Linke and A. Neumann and T. Schaub},
  crossref = {lpar05},
  pages = {95-109}
}

@inproceedings{angesc06a,
  title = {Approaching the Core of Unfounded Sets},
  author = {C. Anger and M. Gebser and T. Schaub},
  crossref = {nmr06},
  pages = {58-66}
}

@inproceedings{angescharegl13a,
  title = {A Combined Mapping and Routing Algorithm for 3{D} {N}o{C}s Based on {ASP}},
  author = {B. Andres and M. Gebser and M. Gla{\ss} and C. Haubelt and F. Reimann and T. Schaub},
  crossref = {mbmv13},
  pages = {35-46}
}

@inproceedings{ankamasc12a,
  title = {Unsatisfiability-based optimization in clasp},
  author = {B. Andres and B. Kaufmann and O. Matheis and T. Schaub},
  crossref = {iclp-lipics12},
  doi = {10.4230/LIPIcs.ICLP.2012.211},
  pages = {212-221}
}

@inproceedings{ankoli01a,
  title = {\texttt{noMoRe}: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics},
  author = {C. Anger and K. Konczak and T. Linke},
  editor = {R. Gor{\'e} and A. Leitsch and T. Nipkow},
  booktitle = {Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR'01)},
  pages = {325-330},
  publisher = springer,
  series = lncs,
  volume = {2083},
  year = {2001}
}

@inproceedings{ankoli01b,
  title = {\texttt{noMoRe}: A System for Non-Monotonic Reasoning under Answer Set Semantics},
  author = {C. Anger and K. Konczak and T. Linke},
  crossref = {lpnmr01},
  pages = {406-410}
}

@inproceedings{ankoli02a,
  title = {\texttt{noMoRe}: Non-monotonic reasoning with logic programs},
  author = {C. Anger and K. Konczak and T. Linke},
  crossref = {jelia02},
  pages = {521-524}
}

@article{ankolisc05a,
  title = {A Glimpse of Answer Set Programming},
  author = {C. Anger and K. Konczak and T. Linke and T. Schaub},
  journal = {K{\"u}nstliche Intelligenz},
  number = {1},
  pages = {12-17},
  volume = {19},
  year = {2005}
}

@inproceedings{anobsascra13a,
  title = {{ROS}o{C}lingo: {A} {ROS} package for {ASP}-based robot control},
  author = {B. Andres and P. Obermeier and O. Sabuncu and T. Schaub and D. Rajaratnam},
  crossref = {rss-cp13},
  url = {http://arxiv.org/abs/1307.7398}
}

@article{anobsascra13b,
  title = {{ROS}o{C}lingo: {A} {ROS} package for {ASP}-based robot control},
  author = {B. Andres and P. Obermeier and D. Rajaratnam and O. Sabuncu and T. Schaub},
  journal = {CoRR},
  url = {http://arxiv.org/abs/1307.7398},
  volume = {abs/1307.7398},
  year = {2013}
}

@inproceedings{anrasasc15a,
  title = {Integrating {ASP} into {ROS} for Reasoning in Robots},
  author = {B. Andres and D. Rajaratnam and O. Sabuncu and T. Schaub},
  crossref = {lpnmr15},
  pages = {69-82}
}

@inproceedings{ansagescbesc12a,
  title = {Accurate Computation of Longest Sensitizable Paths using Answer Set Programming},
  author = {B. Andres and M. Sauer and M. Gebser and T. Schubert and B. Becker and T. Schaub},
  crossref = {zue12}
}

@inproceedings{ansagescbesc13a,
  title = {Accurate Computation of Sensitizable Paths using Answer Set Programming},
  author = {B. Andres and M. Sauer and M. Gebser and T. Schubert and B. Becker and T. Schaub},
  crossref = {lpnmr13},
  pages = {92-101}
}

@inproceedings{anseti09a,
  title = {A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms},
  author = {C. Ans{\'o}tegui and M. Sellmann and K. Tierney},
  crossref = {cp09},
  pages = {142-157}
}

@inproceedings{antoniou97b,
  title = {A Comparison of Two Approaches to Splitting Default Theories},
  author = {G. Antoniou},
  booktitle = aaai,
  pages = {424-429},
  publisher = aaaimit,
  year = {1997}
}

@book{antoniou98a,
  title = {Non-monotonic Reasoning},
  author = {G. Antoniou},
  publisher = {MIT Press},
  year = {1998}
}

@inproceedings{anyaatst19a,
  title = {Multi-Agent Pathfinding with Continuous Time},
  author = {A. Andreychuk and K. Yakovlev and D. Atzmon and R. Stern},
  crossref = {ijcai19},
  pages = {39-45}
}

@book{apbichco07a,
  title = {The Traveling Salesman Problem: A Computational Study},
  author = {D. Applegate and R. Bixby and V. Chv{\'a}tal and W. Cook},
  publisher = {Princeton University Press},
  year = {2007}
}

@incollection{apblwa87a,
  title = {Towards a Theory of Declarative Knowledge},
  author = {K. Apt and H. Blair and A. Walker},
  editor = {J. Minker},
  booktitle = {Foundations of Deductive Databases and Logic Programming},
  chapter = {2},
  pages = {89-148},
  publisher = m-k,
  year = {1987}
}

@article{aptbol94a,
  title = {Logic Programming and Negation: A Survey},
  author = {K. Apt and R. Bol},
  journal = jlp,
  pages = {9-71},
  volume = {19-20},
  year = {1994}
}

@inproceedings{arbech99a,
  title = {Consistent Query Answers in Inconsistent Databases},
  author = {M. Arenas and L. Bertossi and J. Chomicki},
  booktitle = {Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'99)},
  pages = {68-79},
  publisher = acm,
  year = {1999}
}

@inproceedings{arbelymara10a,
  title = {Solving {L}inux Upgradeability Problems Using {B}oolean Optimization},
  author = {J. Argelich and D. {L}e Berre and I. Lynce and J. Marques-Silva and P. Rapicault},
  crossref = {lococo10},
  pages = {11-22}
}

@inproceedings{arcagu22a,
  title = {Towards Dynamic Consistency Checking in Goal-Directed Predicate Answer Set Programming},
  author = {J. Arias and M. Carro and G. Gupta},
  crossref = {padl22},
  pages = {117-134}
}

@article{arcasamagu18a,
  title = {Constraint Answer Set Programming without Grounding},
  author = {J. Arias and M. Carro and E. Salatar and K. Marple and G. Gupta},
  journal = tplp,
  number = {3-4},
  pages = {337-354},
  volume = {18},
  year = {2018}
}

@inproceedings{arcoli04a,
  title = {Automatic Compilation of Protocol Insecurity Problems into Logic Programming},
  author = {A. Armando and L. Compagna and Y. Lierler},
  crossref = {jelia04},
  pages = {617-627}
}

@inproceedings{ardenubr04a,
  title = {Database Repair by Signed Formulae},
  author = {O. Arieli and M. Denecker and B. {V}an Nuffele and M. Bruynooghe},
  booktitle = {Proceeedings of the third Conference on Foundations of Information and Knowledge Systems (FoIKS'04)},
  pages = {14-30},
  publisher = springer,
  series = lncs,
  volume = {2942},
  year = {2004}
}

@article{ariarv98a,
  title = {The value of four values},
  author = {O. Arieli and A. Avron},
  journal = ai,
  number = {1},
  pages = {97-141},
  volume = {102},
  year = {1998}
}

@inproceedings{ariavr94a,
  title = {Logical bilattices and inconsistent data},
  author = {O. Arieli and A. Avron},
  crossref = {lics94},
  pages = {468-476}
}

@inproceedings{ariavr96a,
  title = {Automatic Diagnoses for Properly Stratified Knowledge-Bases},
  author = {O. Arieli and A. Avron},
  booktitle = {Proceedings of the Eight IEEE International Conference on Tools with Artificial Intelligence (ICTAI'96)},
  pages = {392-399},
  publisher = ieee,
  year = {1996}
}

@inproceedings{arieli04a,
  title = {Paraconsistent preferential reasoning by signed quantified {B}oolean formulae},
  author = {O. Arieli},
  booktitle = ecai,
  year = {2004}
}

@article{arlimapl08a,
  title = {The First and Second {M}ax-{SAT} Evaluations},
  author = {J. Argelich and C. Li and F. Many{\`a} and J. Planes},
  journal = jsat,
  number = {2-4},
  pages = {251-278},
  volume = {4},
  year = {2008}
}

@inproceedings{arlyma09a,
  title = {On Solving {B}oolean Multilevel Optimization Problems},
  author = {J. Argelich and I. Lynce and J. Marques-Silva},
  crossref = {ijcai09},
  pages = {393-398}
}

@inproceedings{arma07a,
  title = {Partial Max-{SAT} Solvers with Clause Learning},
  author = {J. Argelich and F. Many{\`a}},
  crossref = {sat07},
  pages = {28-40}
}

@article{armapl09a,
  title = {Bounded Model Checking of Software Using {SMT} Solvers Instead of {SAT} Solvers},
  author = {A. Armando and J. Mantovani and L. Platania},
  journal = jsttt,
  number = {1},
  pages = {69-83},
  volume = {11},
  year = {2009}
}

@article{armcom08a,
  title = {{SAT}-based Model-Checking for Security Protocols Analysis},
  author = {A. Armando and L. Compagna},
  journal = {International Journal of Information Security},
  number = {1},
  pages = {3-32},
  volume = {7},
  year = {2008}
}

@article{artfra00a,
  title = {A survey of temporal extensions of description logics},
  author = {A. Artale and E. Franconi},
  journal = amai,
  number = {1-4},
  pages = {171-210},
  volume = {30},
  year = {2000}
}

@incollection{artfra05a,
  title = {Temporal description logics},
  author = {A. Artale and E. Franconi},
  crossref = {TIMEHandbook},
  doi = {10.1016/S1574-6526(05)80014-8},
  pages = {375-388}
}

@article{aschzhzh15a,
  title = {Ordered completion for logic programs with aggregates},
  author = {V. Asuncion and Y. Chen and Y. Zhang and Y. Zhou},
  journal = ai,
  pages = {72-102},
  volume = {224},
  year = {2015}
}

@inproceedings{asdrfrgojeryth11a,
  title = {Optimization Methods for the Partner Units Problem},
  author = {M. Aschinger and C. Drescher and G. Friedrich and G. Gottlob and P. Jeavons and A. Ryabokon and E. Thorstensen},
  crossref = {cpaior11},
  pages = {4-19}
}

@article{asdrgovo14a,
  title = {{LoCo} - {A} Logic for Configuration Problems},
  author = {M. Aschinger and C. Drescher and G. Gottlob and H. Vollmer},
  doi = {10.1145/2629454},
  journal = tocl,
  number = {3},
  pages = {20:1-20:25},
  volume = {15},
  year = {2014}
}

@inproceedings{ashmor90a,
  title = {A Dynamic Modal Semantics for Default Reasoning and Generics},
  author = {N. Asher and M. Morreau},
  crossref = {nmr90},
  pages = {1-15}
}

@article{aslizhzh12a,
  title = {Ordered completion for first-order logic programs on finite structures},
  author = {V. Asuncion and F. Lin and Y. Zhang and Y. Zhou},
  journal = ai,
  number = {1-2},
  pages = {1-24},
  volume = {177-179},
  year = {2012}
}

@inproceedings{aslohaba21a,
  title = {A New Boolean Encoding for {MAPF} and its Performance with {ASP} and MaxSAT Solvers},
  author = {R. {As{\'i}n Ach{\'a}} and R. L{\'o}pez and S. Hagedorn and J. Baier},
  crossref = {socs21},
  pages = {11-19}
}

@misc{asparagus,
  title = {Asparagus},
  key = {asparagus},
  url = {http://asparagus.cs.uni-potsdam.de}
}

@misc{aspcore2,
  title = {{ASP-Core-2}: Input language format},
  author = {F. Calimeri and W. Faber and M. Gebser and G. Ianni and R. Kaminski and T. Krennwallner and N. Leone and F. Ricca and T. Schaub},
  url = {https://www.mat.unical.it/aspcomp2013/ASPStandardization},
  year = {2012}
}

@inproceedings{aststi92a,
  title = {Caching and Lemmaizing in Model Elimination Theorem Provers},
  author = {O. Astrachan and M. Stickel},
  editor = {D. Kapur},
  booktitle = cade,
  pages = {224-238},
  publisher = springer,
  series = lnai,
  volume = {607},
  year = {1992}
}

@inproceedings{atpaer20a,
  title = {Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming},
  author = {B. Atiq and V. Patoglu and E. Erdem},
  crossref = {iclp-tc20},
  pages = {223-229}
}

@inproceedings{atstfestko20a,
  title = {Probabilistic Robust Multi-Agent Path Finding},
  author = {D. Atzmon and R. Stern and A. Felner and N. Sturtevant and S. Koenig},
  crossref = {icaps20},
  pages = {29-37}
}

@article{atstfewabazh20a,
  title = {Robust Multi-Agent Path Finding and Executing},
  author = {D. Atzmon and R. Stern and A. Felner and G. Wagner and R. Bart{\'a}k and N. Zhou},
  journal = jair,
  pages = {549-579},
  volume = {67},
  year = {2020}
}

@inproceedings{aubohajasa08a,
  title = {A Generalized Framework for Conflict Analysis},
  author = {G. Audemard and L. Bordeaux and Y. Hamadi and S. Jabbour and L. Sais},
  crossref = {sat08},
  pages = {21-27}
}

@inproceedings{aucbol13a,
  title = {Undecidability in Epistemic Planning},
  author = {G. Aucher and T. Bolander},
  crossref = {ijcai13},
  pages = {27-33}
}

@article{aucher10a,
  title = {An Internal Version of Epistemic Logic},
  author = {G. Aucher},
  journal = {Studia Logica},
  number = {1},
  pages = {1-22},
  volume = {94},
  year = {2010}
}

@inproceedings{audsim08a,
  title = {Experimenting a Conflict-Driven Clause Learning Algorithm},
  author = {G. Audemard and L. Simon},
  crossref = {cp08},
  pages = {630-634}
}

@inproceedings{audsim09a,
  title = {Predicting Learnt Clauses Quality in Modern {SAT} Solvers},
  author = {G. Audemard and L. Simon},
  crossref = {ijcai09},
  pages = {399-404}
}

@inproceedings{audsim09b,
  title = {{GLUCOSE}: A Solver That Predicts Learnt Clauses Quality},
  author = {G. Audemard and L. Simon},
  crossref = {satbooklet09},
  pages = {7-8}
}

@inproceedings{aukasi10a,
  title = {A Restriction of Extended Resolution for Clause Learning {SAT} Solvers},
  author = {G. Audemard and G. Katsirelos and L. Simon},
  crossref = {aaai10},
  pages = {10-15}
}

@inproceedings{aulamasa11a,
  title = {On Freezing and Reactivating Learnt Clauses},
  author = {G. Audemard and J. Lagniez and B. Mazure and L. Sais},
  crossref = {sat11},
  pages = {188-200}
}

@article{aurora04a,
  title = {Retrospective on Aurora},
  author = {H. Balakrishnan and M. Balazinska and D. Carney and U. {\c{C}}etintemel and M. Cherniack and C. Convey and E. Galvez and J. Salz and M. Stonebraker and N. Tatbul and R. Tibbetts and S. Zdonik},
  journal = {Journal on Very Large Data Bases},
  number = {4},
  pages = {370-383},
  volume = {13},
  year = {2004}
}

@article{avron91a,
  title = {Simple consequence relations},
  author = {A. Avron},
  journal = {Information and Computation},
  pages = {105-139},
  volume = {92},
  year = {1991}
}

@article{azchst13a,
  title = {Stable model semantics for founded bounds},
  author = {R. Aziz and G. Chu and P. Stuckey},
  journal = tplp,
  number = {4-5},
  pages = {517-532},
  volume = {13},
  year = {2013}
}

@phdthesis{aziz15a,
  title = {{A}nswer {S}et {P}rogramming: {F}ounded {B}ounds and {M}odel {C}ounting},
  author = {R. Aziz},
  school = {University of Melbourne},
  year = {2015}
}

@inproceedings{baahol92a,
  title = {Embedding Defaults into Terminological Knowledge Representation Formalisms},
  author = {F. Baader and B. Hollunder},
  crossref = {kr92},
  pages = {306-317}
}

@techreport{baahol92b,
  title = {How to Prefer More Specific Defaults in Terminological Default Logic},
  author = {F. Baader and B. Hollunder},
  institution = {DFKI},
  number = {RR-92-58},
  year = {1993}
}

@inproceedings{baahol93a,
  title = {How to Prefer More Specific Defaults in Terminological Default Logic},
  author = {F. Baader and B. Hollunder},
  editor = {R. Bajcsy},
  booktitle = ijcai,
  pages = {669-674},
  publisher = m-k,
  year = {1993}
}

@inproceedings{babadamowi02a,
  title = {Models and Issues in Data Stream Systems},
  author = {B. Babcock and S. Babu and M. Datar and R. Motwani and J. Widom},
  crossref = {pods02},
  pages = {1-16}
}

@inproceedings{babero13a,
  title = {System Architecture and Implementation of a Prototyping Tool for {SAT}-based Constraint Programming Systems},
  author = {M. Banbara and D. {L}e Berre and S. Roussel and T. Soh and N. Tamura},
  crossref = {pos13}
}

@article{babhkrtr19a,
  title = {Almost event-rate independent monitoring},
  author = {D. Basin and B. Bhatt and S. Krstic and D. Traytel},
  doi = {10.1007/s10703-018-00328-3},
  journal = {Formal Methods in System Design},
  number = {3},
  pages = {449-478},
  volume = {54},
  year = {2019}
}

@inproceedings{babhtr17a,
  title = {Almost Event-Rate Independent Monitoring of Metric Temporal Logic},
  author = {D. Basin and B. Bhatt and D. Traytel},
  crossref = {tacas17},
  doi = {10.1007/978-3-662-54580-5\_6},
  pages = {94-112}
}

@inproceedings{bablee13a,
  title = {{Cplus2ASP}: Computing Action Language {C+} in Answer Set Programming},
  author = {J. Babb and J. Lee},
  crossref = {lpnmr13},
  pages = {122-134}
}

@inproceedings{bablee15a,
  title = {Action Language {BC+}: Preliminary Report},
  author = {J. Babb and J. Lee},
  crossref = {aaai15},
  pages = {1424-1430}
}

@misc{bablif03a,
  title = {Computing Answer Sets Using Program Completion},
  author = {Y. Babovich and V. Lifschitz},
  howpublished = {Unpublished draft},
  url = {http://www.cs.utexas.edu/users/tag/cmodels.html},
  year = {2003}
}

@inproceedings{babocr07a,
  title = {On Finitely Recursive Programs},
  author = {S. Baselice and P. Bonatti and G. Criscuolo},
  crossref = {iclp07},
  pages = {89-103}
}

@article{babodife19a,
  title = {Intuitionistic Linear Temporal Logics},
  author = {P. Balbiani and J. Boudou and M. Di{\'e}guez and D. Fern{\'a}ndez-Duque},
  journal = tocl,
  number = {2},
  pages = {14:1-14:32},
  volume = {21},
  year = {2020}
}

@article{babodife20a,
  title = {Intuitionistic Linear Temporal Logics},
  author = {P. Balbiani and J. Boudou and M. Di{\'e}guez and D. Fern{\'a}ndez-Duque},
  journal = tocl,
  number = {2},
  pages = {14:1-14:32},
  volume = {21},
  year = {2020}
}

@inproceedings{baboge05a,
  title = {Towards an Integration of Answer Set and Constraint Solving},
  author = {S. Baselice and P. Bonatti and M. Gelfond},
  crossref = {iclp05},
  pages = {52-66}
}

@inproceedings{baboro09a,
  title = {New Encodings of Pseudo-{B}oolean Constraints into {CNF}},
  author = {O. Bailleux and Y. Boufkhad and O. Roussel},
  crossref = {sat09},
  pages = {181-194}
}

@article{babrcedegr10a,
  title = {Deductive and Inductive Stream Reasoning for Semantic Social Media Analytics},
  author = {D. Barbieri and D. Braga and S. Ceri and E. {Della Valle} and Y. Huang and V. Tresp and A. Rettinger and H. Wermser},
  journal = {IEEE Intelligent Systems},
  number = {6},
  pages = {32-41},
  volume = {25},
  year = {2010}
}

@inproceedings{babrcevagr09a,
  title = {{C-SPARQL}: {SPARQL} for continuous querying},
  author = {D. Barbieri and D. Braga and S. Ceri and E. {Della Valle} and M. Grossniklaus},
  crossref = {www09},
  pages = {1061-1062}
}

@inproceedings{babrcevagr10a,
  title = {Incremental Reasoning on Streams and Rich Background Knowledge},
  author = {D. Barbieri and D. Braga and S. Ceri and E. {Della Valle} and M. Grossniklaus},
  crossref = {eswc10},
  pages = {1-15}
}

@inproceedings{babrstthza10a,
  title = {State Defaults and Ramifications in the Unifying Action Calculus},
  author = {R. Baumann and G. Brewka and H. Strass and M. Thielscher and V. Zaslawski},
  crossref = {kr10}
}

@article{bacchus01a,
  title = {The {AIPS'00} Planning Competition},
  author = {F. Bacchus},
  journal = aim,
  number = {3},
  pages = {47-56},
  volume = {22},
  year = {2001}
}

@inproceedings{bacchus02a,
  title = {Enhancing {D}avis {P}utnam with Extended Binary Clause Reasoning},
  author = {F. Bacchus},
  crossref = {aaai02},
  pages = {613-619},
  year = {2002}
}

@techreport{bacchus88a,
  title = {Representing and Reasoning with Uncertainty},
  author = {F. Bacchus},
  institution = {University of Waterloo},
  number = {CS-88-31},
  type = {Research Report},
  year = {1988}
}

@inproceedings{bacchus89a,
  title = {A Modest, but Semantically Well Founded, Inheritance Reasoner},
  author = {F. Bacchus},
  booktitle = ijcai,
  pages = {1104-1109},
  year = {1989}
}

@inproceedings{bacchus90a,
  title = {Default Inferences From Statistical Knowledge},
  author = {F. Bacchus},
  crossref = {nmr90},
  pages = {16-31}
}

@inproceedings{bachtrtrjobe04a,
  title = {A knowledge based approach for representing and reasoning about signaling networks},
  author = {C. Baral and K. Chancellor and N. Tran and N. Tran and A. Joy and M. Berens},
  crossref = {ismb04},
  pages = {15-22}
}

@incollection{bachwo93a,
  title = {Temporal Deductive Databases},
  author = {M. Baudinet and J. Chomicki and P. Wolper},
  editor = {A. Tansel and J. Clifford and S. Gadia and A Segev and R. Snodgrass},
  booktitle = {Temporal Databases: Theory, Design, and Implementation},
  pages = {294-320},
  publisher = {Benjamin/Cummings},
  year = {1993}
}

@article{backab00a,
  title = {Using temporal logics to express search control knowledge for planning},
  author = {F. Bacchus and F. Kabanza},
  journal = ai,
  number = {1-2},
  pages = {123-191},
  volume = {116},
  year = {2000}
}

@article{bacneb95a,
  title = {Complexity Results for {SAS+} Planning},
  author = {C. B{\"a}ckstr{\"o}m and B. Nebel},
  journal = ci,
  pages = {625-656},
  volume = {11},
  year = {1995}
}

@inproceedings{badaeifikr10a,
  title = {Decomposition of Distributed Nonmonotonic Multi-Context Systems},
  author = {S. Bairakdar and M. Dao-Tran and T. Eiter and M. Fink and T. Krennwallner},
  crossref = {jelia10},
  pages = {24-37}
}

@incollection{badamo07a,
  title = {Load Shedding in Data Stream Systems},
  author = {B. Babcock and M. Datar and R. Motwani},
  crossref = {aggarwal07a},
  pages = {127-147}
}

@inproceedings{badapi03a,
  title = {Algorithms and Complexity Results for \#{SAT} and {B}ayesian Inference},
  author = {F. Bacchus and S. Dalmao and T. Pitassi},
  crossref = {focs03},
  pages = {340-351}
}

@article{badapi09a,
  title = {Solving \#{SAT} and {B}ayesian Inference with Backtracking Search},
  author = {F. Bacchus and S. Dalmao and T. Pitassi},
  journal = jair,
  pages = {391-442},
  volume = {34},
  year = {2009}
}

@incollection{baegle01a,
  title = {Normal Form Transformations},
  author = {M. Baaz and U. Egly and A. Leitsch},
  chapter = {5},
  crossref = {ARHandbook},
  pages = {273-333},
  volume = {I}
}

@inproceedings{baerli00a,
  title = {Fages' Theorem and Answer Set Programming},
  author = {Y. Babovich and E. Erdem and V. Lifschitz},
  crossref = {nmr00}
}

@inproceedings{bafrbimc08a,
  title = {Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners},
  author = {J. Baier and C. Fritz and M. Bienvenu and S. McIlraith},
  crossref = {aaai08},
  pages = {1509-1512}
}

@inproceedings{bafrfune97a,
  title = {Semantically guided Theorem Proving for Diagnosis Application},
  author = {P. Baumgartner and P. Fr{\"o}hlich and U. Furbach and W. Nejdl},
  booktitle = ijcai,
  publisher = m-k,
  year = {1997}
}

@inproceedings{bafrmc07a,
  title = {Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners},
  author = {J. Baier and C. Fritz and S. McIlraith},
  crossref = {icaps07},
  pages = {26-33}
}

@article{bafudeti09a,
  title = {Computing finite models by reduction to function-free clause logic},
  author = {P. Baumgartner and A. Fuchs and H. de Nivelle and C. Tinelli},
  journal = {Journal of Applied Logic},
  number = {1},
  pages = {58-74},
  volume = {7},
  year = {2009}
}

@inproceedings{bafudeti96a,
  title = {Computing Finite Models by Reduction to Function-Free Clause Logic},
  author = {P. Baumgartner and A. Fuchs and H. de Nivelle and C. Tinelli},
  booktitle = {Proceedings of the Third Workshop on Disproving: Non-Theorems, Non-Validity, Non-Provability},
  year = {2006}
}

@inproceedings{bageinospescsotawe15a,
  title = {aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming},
  author = {M. Banbara and M. Gebser and K. Inoue and M. Ostrowski and A. Peano and T. Schaub and T. Soh and N. Tamura and M. Weise},
  crossref = {lpnmr15},
  pages = {112-126}
}

@inproceedings{bageinscsotawe13a,
  title = {{A}spartame: Solving Constraint Satisfaction Problems with Answer Set Programming},
  author = {M. Banbara and M. Gebser and K. Inoue and T. Schaub and T. Soh and N. Tamura and M. Weise},
  crossref = {aspocp13}
}

@article{bageno06a,
  title = {Answer set based design of knowledge systems},
  author = {M. Balduccini and M. Gelfond and M. Nogueira},
  journal = amai,
  number = {1-2},
  pages = {183-219},
  volume = {47},
  year = {2006}
}

@article{bagepr97a,
  title = {Representing Actions: Laws, Observations and Hypotheses},
  author = {C. Baral and M. Gelfond and A. Provetti},
  journal = jlp,
  number = {1-3},
  pages = {201-243},
  volume = {31},
  year = {1997}
}

@inproceedings{bagezh13a,
  title = {Towards Answer Set Programming with Sorts},
  author = {E. Balai and M. Gelfond and Y. Zhang},
  crossref = {lpnmr13},
  pages = {135-147}
}

@inproceedings{baghlu08a,
  title = {{LTL} over Description Logic Axioms},
  author = {F. Baader and S. Ghilardi and C. Lutz},
  crossref = {kr08},
  pages = {684-694}
}

@inproceedings{bagimapa96a,
  title = {An Abductive Proof Procedure for Reasoning About Actions in Modal Logic Programming},
  author = {M. Baldoni and L. Giordano and A. Martelli and V. Patti},
  crossref = {nmelp96},
  pages = {132-150}
}

@inproceedings{baheosreruscwa24a,
  title = {Towards Industrial-scale Product Configuration},
  author = {J. Baumeister and K. Herud and M. Ostrowski and J. Reutelshoefer and N. R{\"u}hling and T. Schaub and P. Wanko},
  crossref = {lpnmr24},
  note = {To appear},
  optdoi = {},
  optpages = {}
}

@inproceedings{bahosa05a,
  title = {Description Logics as Ontology Languages for the Semantic Web},
  author = {F. Baader and I. Horrocks and U. Sattler},
  booktitle = {Mechanizing Mathematical Reasoning},
  crossref = {siekmann60},
  pages = {228-248},
  year = {2005}
}

@inproceedings{baimci06a,
  title = {Planning with First-Order Temporally Extended Goals using Heuristic Search},
  author = {J. Baier and S. McIlraith},
  crossref = {aaai06},
  pages = {788-795}
}

@inproceedings{baimci07a,
  title = {On Domain-Independent Heuristics for Planning with Qualitative Preferences},
  author = {J. Baier and S. McIlraith},
  crossref = {cs07},
  pages = {7-12}
}

@article{baimci08a,
  title = {Planning with Preferences},
  author = {J. Baier and S. McIlraith},
  journal = aim,
  number = {4},
  pages = {25-36},
  volume = {29},
  year = {2008}
}

@inproceedings{bainkaokscsota17a,
  title = {catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming},
  author = {M. Banbara and K. Inoue and H. Kaneyuki and T. Okimoto and T. Schaub and T. Soh and N. Tamura},
  crossref = {lpnmr17},
  pages = {265-278}
}

@article{bainkaokscsotawa18a,
  title = {teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming},
  author = {M. Banbara and K. Inoue and B. Kaufmann and T. Okimoto and T. Schaub and T. Soh and N. Tamura and P. Wanko},
  doi = {10.1007/s10479-018-2757-7},
  journal = {Annals of Operations Research},
  number = {1},
  pages = {3-37},
  volume = {275},
  year = {2019}
}

@inproceedings{baiokascsotawa16a,
  title = {teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming},
  author = {M. Banbara and K. Inoue and B. Kaufmann and T. Schaub and T. Soh and N. Tamura and P. Wanko},
  crossref = {patat16},
  pages = {13-32}
}

@article{bakaossc16a,
  title = {Clingcon: The Next Generation},
  author = {M. Banbara and B. Kaufmann and M. Ostrowski and T. Schaub},
  doi = {10.1017/S1471068417000138},
  journal = tplp,
  number = {4},
  pages = {408-461},
  volume = {17},
  year = {2017}
}

@inproceedings{baker89a,
  title = {A Simple Solution to the {Y}ale Shooting Problem},
  author = {A. Baker},
  crossref = {kr89},
  pages = {11-20}
}

@inproceedings{bakgin89a,
  title = {A Theorem Prover for Prioritized Circumscription},
  author = {A. Baker and M. Ginsberg},
  booktitle = ijcai,
  pages = {463-467},
  year = {1989}
}

@inproceedings{baklmu10a,
  title = {Policy Monitoring in First-Order Temporal Logic},
  author = {D. Basin and F. Klaedtke and S. M{\"u}ller},
  crossref = {cav10},
  pages = {1-18}
}

@inproceedings{baklmupf08a,
  title = {Runtime Monitoring of Metric First-order Temporal Properties},
  author = {D. Basin and F. Klaedtke and S. M{\"u}ller and B. Pfitzmann},
  crossref = {fsttcs08},
  pages = {49-60}
}

@article{bakrtr00a,
  title = {Computational complexity of planning and approximate planning in the presence of incompleteness},
  author = {C. Baral and V. Kreinovich and R. Trejo},
  journal = ai,
  number = {1-2},
  pages = {241-267},
  volume = {122},
  year = {2000}
}

@inproceedings{bakrtr01a,
  title = {Computational Complexity of Planning with Temporal Goals},
  author = {C. Baral and V. Kreinovich and R. Trejo},
  crossref = {ijcai01},
  pages = {509-514}
}

@inproceedings{bakrtr17a,
  title = {Almost Event-Rate Independent Monitoring of Metric Dynamic Logic},
  author = {D. Basin and S. Krstic and D. Traytel},
  editor = {S. Lahiri and G. Reger},
  booktitle = {Proceedings if the Seventeenth International Conference on Runtime Verification (RV'17)},
  doi = {10.1007/978-3-319-67531-2\_6},
  pages = {85-102},
  publisher = springer,
  series = lncs,
  volume = {10548},
  year = {2017}
}

@incollection{balapanu06a,
  title = {Constraint-Based Scheduling and Planning},
  author = {P. Baptiste and P. Laborie and C. {L}e Pape and W. Nuijten},
  crossref = {CPHandbook},
  doi = {10.1016/S1574-6526(06)80026-X},
  pages = {761-799}
}

@article{balapoza99a,
  title = {Diagnosis of Large Active Systems},
  author = {P. Baroni and G. Lamperti and P. Pogliano and M. Zanella},
  journal = ai,
  number = {1},
  pages = {135-183},
  volume = {110},
  year = {1999}
}

@inproceedings{baldie16,
  title = {Temporal Here and There},
  author = {P. Balbiani and M. Di{\'e}guez},
  crossref = {jelia16},
  pages = {81-96}
}

@inproceedings{balduccini09a,
  title = {Representing Constraint Satisfaction Problems in Answer Set Programming},
  author = {M. Balduccini},
  crossref = {aspocp09},
  pages = {16-30}
}

@inproceedings{balduccini10a,
  title = {Learning Domain-Specific Heuristics for Answer Set Solvers},
  author = {M. Balduccini},
  crossref = {iclp-lipics10},
  pages = {14-23}
}

@inproceedings{balduccini11a,
  title = {Industrial-Size Scheduling with {ASP}+{CP}},
  author = {M. Balduccini},
  crossref = {lpnmr11},
  pages = {284-296}
}

@article{balduccini11b,
  title = {Learning and using domain-specific heuristics in {ASP} solvers},
  author = {M. Balduccini},
  journal = aicom,
  number = {2},
  pages = {147-164},
  volume = {24},
  year = {2011}
}

@incollection{balduccini12a,
  title = {A ``conservative'' approach to extending answer set programming with nonherbrand functions},
  author = {M. Balduccini},
  crossref = {vl65},
  pages = {24-39}
}

@article{balduccini13a,
  title = {{ASP} with non-herbrand partial functions: A language and system for practical use},
  author = {M. Balduccini},
  journal = tplp,
  number = {4-5},
  pages = {547-561},
  volume = {13},
  year = {2013}
}

@inproceedings{baleme11a,
  title = {First-Order Semantics of Aggregates in Answer Set Programming Via Modified Circumscription},
  author = {M. Bartholomew and J. Lee and Y. Meng},
  editor = {E. Davis and P. Doherty and E. Erdem},
  booktitle = {Proceedings of the AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning},
  pages = {16-22},
  publisher = {{AAAI} Press},
  year = {2011}
}

@inproceedings{baleme11b,
  title = {First-Order Extension of the {FLP} Stable Model Semantics via Modified Circumscription.},
  author = {M. Bartholomew and J. Lee and Y. Meng},
  crossref = {ijcai11},
  pages = {724-730}
}

@inproceedings{balgel03a,
  title = {Logic Programs with Consistency-Restoring Rules},
  author = {M. Balduccini and M. Gelfond},
  editor = {P. Doherty and J. McCarthy and M. Williams},
  booktitle = {Proceedings of the International Symposium on Logical Formalization of Commonsense Reasoning (COMMONSENSE'03)},
  pages = {9-18},
  year = {2003}
}

@article{balgel03b,
  title = {Diagnostic reasoning with {A-Prolog}},
  author = {M. Balduccini and M. Gelfond},
  journal = tplp,
  number = {4-5},
  pages = {425-461},
  volume = {3},
  year = {2003}
}

@inproceedings{balgel05a,
  title = {Model-Based Reasoning for Complex Flight Systems},
  author = {M. Balduccini and M. Gelfond},
  booktitle = {Proceedings of the Fifth AIAA Conference on Aviation, Technology, Integration, and Operations (ATIO'05)},
  year = {2005}
}

@inproceedings{balgel08a,
  title = {The Autonomous Agent Architecture: An Overview},
  author = {M. Balduccini and M. Gelfond},
  booktitle = {Working Notes of the AAAI Spring Symposium on Architectures for Intelligent Theory-Based Agents (AITA'08)},
  pages = {1-6},
  publisher = aaaimit,
  year = {2008}
}

@article{balgel10a,
  title = {The Autonomous Agent Architecture},
  author = {M. Balduccini and M. Gelfond},
  journal = {Newsletter of the Association of Logic Programming},
  volume = {23},
  year = {2010}
}

@article{balgel13a,
  title = {Language {ASP\{f\}} with Arithmetic Expressions and Consistency-Restoring Rules},
  author = {M. Balduccini and M. Gelfond},
  journal = {CoRR},
  volume = {abs/1301.1387},
  year = {2013}
}

@article{balinski65a,
  title = {Integer Programming: Methods, Uses, Computation},
  author = {M. Balinski},
  journal = {Management Science},
  number = {3},
  pages = {253-313},
  volume = {12},
  year = {1965}
}

@inproceedings{balitava20a,
  title = {Hybrid compositional reasoning for reactive synthesis from finite-horizon specifications},
  author = {S. Bansal and Y. Li and L. Tabajara and M. Vardi},
  crossref = {aaai20},
  pages = {9766-9774}
}

@inproceedings{ballie13a,
  title = {Integration Schemas for Constraint Answer Set Programming: a Case Study},
  author = {M. Balduccini and Y. Lierler},
  crossref = {iclp-tc13},
  year = {2013}
}

@article{ballie17a,
  title = {Constraint answer set solver {EZCSP} and why integration schemas matter},
  author = {M. Balduccini and Y. Lierler},
  journal = tplp,
  number = {4},
  pages = {462-515},
  volume = {17},
  year = {2017}
}

@article{bama06a,
  title = {Some Computational Aspects of Distance-{SAT}},
  author = {O. Bailleux and P. Marquis},
  journal = jar,
  number = {4},
  pages = {231-260},
  volume = {37},
  year = {2006}
}

@inproceedings{bamama16b,
  title = {{PDDL}+ Planning via Constraint Answer Set Programming},
  author = {M. Balduccini and D. Magazzeni and M. Maratea},
  crossref = {aspocp16},
  pages = {1-12}
}

@article{bamamale17a,
  title = {{CASP} solutions for planning in hybrid domains},
  author = {M. Balduccini and D. Magazzeni and M. Maratea and E. Leblanc},
  journal = tplp,
  number = {4},
  pages = {591-633},
  volume = {17},
  year = {2017}
}

@inproceedings{bamasaul86a,
  title = {Magic Sets and Other Strange Ways to Implement Logic Programs},
  author = {F. Bancilhon and D. Maier and Y. Sagiv and J. Ullman},
  crossref = {pods86},
  pages = {1-15}
}

@inproceedings{bamcso00a,
  title = {Formulating diagnostic problem solving using an action language with narratives and sensing},
  author = {C. Baral and S. McIlraith and T. Son},
  crossref = {kr00},
  pages = {311-322},
  year = {2000}
}

@inproceedings{bamuru04a,
  title = {A New Approach to Modeling and Solving Minimal Perturbation Problems},
  author = {R. Bart{\'a}k and T. M{\"u}ller and H. Rudov{\'a}},
  editor = {K. Apt and F. Fages and F. Rossi and P. Szeredi and J. V{\'a}ncza},
  booktitle = {Recent Advances in Constraints},
  doi = {10.1007/978-3-540-24662-6_13},
  pages = {233-249},
  publisher = springer,
  year = {2004}
}

@inproceedings{banatu02a,
  title = {Reasoning about Actions in a Probabilistic Setting},
  author = {C. Baral and T. Nam and L. Tuan},
  crossref = {aaai02},
  pages = {507-512}
}

@book{bapanu12a,
  title = {Constraint-based scheduling: applying constraint programming to scheduling problems},
  author = {P. Baptiste and C. {L}e Pape and W. Nuijten},
  publisher = {Springer Science+Business Media},
  volume = {39},
  year = {2012}
}

@article{bapapa07a,
  title = {Support Vector Regression},
  author = {D. Basak and S. Pal and D. Patranabis},
  journal = {Neural Information Processing --- Letters and Reviews},
  number = {10},
  pages = {203-224},
  volume = {11},
  year = {2007}
}

@inproceedings{bapmar00a,
  title = {Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability},
  author = {L. Baptista and J. Marques-Silva},
  editor = {R. Dechter},
  booktitle = {Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming (CP'00)},
  pages = {489-494},
  publisher = springer,
  series = lncs,
  volume = {1894},
  year = {2000}
}

@article{bapoelle05a,
  title = {Issues in Parallel Execution of Non-monotonic Reasoning Systems.},
  author = {M. Balduccini and E. Pontelli and O. El-Khatib and H. Le},
  journal = {Parallel Computing},
  number = {6},
  pages = {608-647},
  volume = {31},
  year = {2005}
}

@book{baral02a,
  title = {Knowledge Representation, Reasoning and Declarative Problem Solving},
  author = {C. Baral},
  publisher = cup,
  year = {2003}
}

@inproceedings{baraltt02,
  title = {Reasoning about Actions in a Probabilistic Setting},
  author = {C. Baral and N. Tran and L. Tuan},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {AAAI/IAAI},
  pages = {507-512},
  year = {2002}
}

@incollection{bargel00a,
  title = {Reasoning agents in dynamic domains},
  author = {C. Baral and M. Gelfond},
  crossref = {lbai},
  pages = {257-279}
}

@article{bargel94a,
  title = {Logic Programming and Knowledge Representation},
  author = {C. Baral and M. Gelfond},
  journal = jlp,
  pages = {73-148},
  volume = {19/20},
  year = {1994}
}

@inproceedings{barlee12a,
  title = {Stable Models of Formulas with Intensional Functions},
  author = {M. Bartholomew and J. Lee},
  crossref = {kr12},
  url = {http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4559}
}

@inproceedings{barlee13a,
  title = {Functional Stable Model Semantics and Answer Set Programming Modulo Theories},
  author = {M. Bartholomew and J. Lee},
  crossref = {ijcai13},
  pages = {718-724}
}

@article{barlee13b,
  title = {On the stable model semantics for intensional functions},
  author = {M. Bartholomew and J. Lee},
  journal = tplp,
  number = {4-5},
  pages = {863-876},
  volume = {13},
  year = {2013}
}

@inproceedings{barlee13c,
  title = {A Functional View of Strong Negation in Answer Set Programming},
  author = {M. Bartholomew and J. Lee},
  crossref = {aspocp13}
}

@inproceedings{barlee14a,
  title = {Stable Models of Multi-Valued Formulas: Partial vs. Total Functions},
  author = {M. Bartholomew and J. Lee},
  crossref = {kr14},
  pages = {583-586}
}

@inproceedings{barlee14b,
  title = {System aspmt2smt: Computing {ASPMT} Theories by {SMT} Solvers},
  author = {M. Bartholomew and J. Lee},
  crossref = {jelia14},
  pages = {529-542}
}

@article{barlee19a,
  title = {First-order stable model semantics with intensional functions},
  author = {M. Bartholomew and J. Lee},
  journal = ai,
  pages = {56-93},
  volume = {273},
  year = {2019}
}

@inproceedings{barsub90a,
  title = {Stable and Extension Class Theory for Logic Programs and Default Logics},
  author = {C. Baral and V. Subrahmanian},
  crossref = {nmr90},
  pages = {32-43}
}

@inproceedings{barsub91a,
  title = {Duality between Alternative Semantics of logic Programs and Nonmonotonic Formalisms},
  author = {C. Baral and V. Subrahmanian},
  booktitle = {First International Workshop on Logic Programming and Nonmonotonic Reasoning},
  pages = {69-86},
  publisher = {MIT Press},
  year = {1991}
}

@inproceedings{barsva19a,
  title = {On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective},
  author = {R. Bart{\'a}k and J. Svancara},
  crossref = {socs19},
  pages = {10-17}
}

@article{barzol04a,
  title = {Network biology: understanding the cell's functional organization},
  author = {A. Barab{\'a}si and Z. Oltvai},
  journal = {Nature reviews Genetics},
  number = {2},
  pages = {101-113},
  volume = {5},
  year = {2004}
}

@incollection{baseseti09a,
  title = {Satisfiability Modulo Theories},
  author = {C. Barrett and R. Sebastiani and S. Seshia and C. Tinelli},
  chapter = {26},
  crossref = {SATHandbook},
  doi = {10.3233/978-1-58603-929-5-825},
  pages = {825-885}
}

@inproceedings{basota13a,
  title = {Compiling Pseudo-{B}oolean Constraints to {SAT} with Order Encoding},
  author = {N. Tamura and M. Banbara and T. Soh},
  crossref = {ictai13},
  pages = {1020-1027},
  year = {2013}
}

@article{basotainsc13a,
  title = {Answer Set Programming as a Modeling Language for Course Timetabling},
  author = {M. Banbara and T. Soh and N. Tamura and K. Inoue and T. Schaub},
  journal = tplp,
  number = {4-5},
  pages = {783-798},
  volume = {13},
  year = {2013}
}

@article{basvsknokr19a,
  title = {Multi-agent path finding on real robots},
  author = {R Bart{\'a}k and J. Svancara and V. Skopkov{\'a} and D. Nohejl and I. Krasicenko},
  journal = aicom,
  number = {3},
  pages = {175-189},
  volume = {32},
  year = {2019}
}

@inproceedings{basvvl18a,
  title = {A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs},
  author = {R. Bart{\'a}k and J. Svancara and M. Vlk},
  crossref = {aamas18},
  pages = {748-756}
}

@inproceedings{bathwaluza06a,
  title = {A data stream language and system designed for power and extensibility},
  author = {Y. Bai and H. Thakkar and H. Wang and C. Luo and C. Zaniolo},
  crossref = {cikm06},
  pages = {337-346}
}

@inproceedings{baubre10a,
  title = {Expanding Argumentation Frameworks: Enforcing and Monotonicity Results},
  author = {R. Baumann and G. Brewka},
  crossref = {comma10},
  pages = {75-86}
}

@inproceedings{baudinet92a,
  title = {A Simple Proof of the Completeness of Temporal Logic Programming},
  author = {M. Baudinet},
  crossref = {ilfp92},
  doi = {10.1142/S0129054104002509},
  pages = {51-83}
}

@inproceedings{baufur94a,
  title = {Model elimination without contrapositives and its application to {PTTP}},
  author = {P. Baumgartner and U. Furbach},
  booktitle = {Prs Tableaux'94},
  year = {1994}
}

@inproceedings{baufur94b,
  title = {{PROTEIN}: A {PRO}ver with a {T}heory {E}xtension {IN}terface},
  author = {P. Baumgartner and U. Furbach},
  editor = {A. Bundy},
  booktitle = cade,
  note = {System description},
  pages = {769-773},
  publisher = springer,
  series = lnai,
  volume = {814},
  year = {1994}
}

@inproceedings{baufur94c,
  title = {Model ehmination without contrapositives},
  author = {P. Baumgartner and U. Furbach},
  editor = {A. Bundy},
  booktitle = cade,
  pages = {87-101},
  publisher = springer,
  series = lnai,
  volume = {814},
  year = {1994}
}

@inproceedings{baumeister18a,
  title = {Evaluation of Configuration Knowledge in Industrial Manufacturing},
  author = {J. Baumeister},
  crossref = {lwda18},
  pages = {38-48},
  url = {https://ceur-ws.org/Vol-2191/paper5.pdf}
}

@techreport{baumer89a,
  title = {Conditioned Circumscription: Translating Defaults to Circumscription},
  author = {M. Bauer and G. Merziger},
  institution = {FB Informatik, KI-Labor (SC-Projekt)},
  number = {34},
  type = {Memo},
  year = {1989}
}

@article{bautho10a,
  title = {Instance Based Methods --- A Brief Overview},
  author = {P. Baumgartner and E. Thorstensen},
  journal = {K{\"u}nstliche Intelligenz},
  number = {1},
  pages = {35-42},
  volume = {24},
  year = {2010}
}

@article{bautin08a,
  title = {The Model Evolution Calculus as a First-Order {DPLL} Method},
  author = {P. Baumgartner and C. Tinelli},
  journal = ai,
  number = {4-5},
  pages = {591-632},
  volume = {172},
  year = {2008}
}

@inproceedings{bawi03a,
  title = {Effective Preprocessing with Hyper-Resolution and Equality Reduction},
  author = {F. Bacchus and J. Winter},
  crossref = {sat03},
  pages = {341-355}
}

@inproceedings{baypeh00a,
  title = {Counting Models Using Connected Components},
  author = {R. Bayardo and J. Pehoushek},
  crossref = {aaai00},
  pages = {157-162}
}

@inproceedings{baysch96a,
  title = {Using {CSP} Look-Back Techniques to Solve Exceptionally Hard {SAT} Instances},
  author = {R. Bayardo and R. Schrag},
  booktitle = {Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP'96)},
  pages = {46-60},
  publisher = springer,
  series = lncs,
  volume = {1118},
  year = {1996}
}

@inproceedings{baysch97a,
  title = {Using {CSP} Look-Back Techniques to Solve Real-World {SAT} Instances},
  author = {R. Bayardo and R. Schrag},
  crossref = {aaai97},
  pages = {203-208},
  year = {1997}
}

@inproceedings{bcdlp93a,
  title = {Inconsistency management and prioritized syntax-based entailment},
  author = {S. Benferhat and C. Cayrol and D. Dubois and J. Lang and H. Prade},
  editor = {R. Bajcsy},
  booktitle = ijcai,
  pages = {640-647},
  publisher = m-k,
  year = {1993}
}

@article{beapit98a,
  title = {Propositional Proof Complexity: Past, Present, and Future},
  author = {P. Beame and T. Pitassi},
  journal = {Bulletin of the European Association for Theoretical Computer Science},
  pages = {66-89},
  volume = {65},
  year = {1998}
}

@inproceedings{beblnisa22a,
  title = {The Temporal Vadalog System},
  author = {L. Bellomarini and L. Blasi and M. Nissl and E. Sallinger},
  crossref = {ruleml22},
  doi = {10.1007/978-3-031-21541-4\_9},
  pages = {130-145},
  url = {https://doi.org/10.1007/978-3-031-21541-4\_9}
}

@article{becadifascsc24a,
  title = {Metric dynamic equilibrium logic},
  author = {A. Becker and P. Cabalar and M. Di{\'e}guez and L. {Fari{\~n}as del Cerro} and T. Schaub and A. Schuhmann},
  doi = {10.1080/11663081.2023.2244365},
  journal = jancl,
  number = {3-4},
  pages = {495-519},
  volume = {33},
  year = {2023}
}

@inproceedings{becadiharosc24a,
  title = {Compiling Metric Temporal Answer Set Programming},
  author = {A. Becker and P. Cabalar and M. Di{\'e}guez and S. Hahn and J. Romero and T. Schaub},
  crossref = {lpnmr24},
  note = {To appear},
  optdoi = {},
  optpages = {}
}

@article{becadiscsc24a,
  title = {Metric Temporal Answer Set Programming over Timed Traces},
  author = {A. Becker and P. Cabalar and M. Di{\'e}guez and T. Schaub and A. Schuhmann},
  doi = {10.1017/S1471068424000139},
  journal = tplp,
  note = {To appear},
  optannote = {},
  optkey = {},
  optmonth = {},
  optnumber = {},
  optpages = {},
  optvolume = {},
  year = {2024}
}

@inproceedings{becirotr01a,
  title = {Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking},
  author = {P. Bertoli and A. Cimatti and M. Roveri and P. Traverso},
  crossref = {ijcai01},
  pages = {473-478}
}

@inproceedings{bedaei16a,
  title = {Equivalent Stream Reasoning Programs},
  author = {H. Beck and M. Dao-Tran and T. Eiter},
  crossref = {ijcai16},
  pages = {929-935}
}

@article{bedaei18a,
  title = {{LARS:} {A} Logic-based framework for Analytic Reasoning over Streams},
  author = {H. Beck and M. Dao-Tran and T. Eiter},
  doi = {10.1016/j.artint.2018.04.003},
  journal = ai,
  pages = {16-70},
  volume = {261},
  year = {2018}
}

@inproceedings{bedaeifi15a,
  title = {{LARS:} {A} Logic-Based Framework for Analyzing Reasoning over Streams},
  author = {H. Beck and M. Dao-Tran and T. Eiter and M. Fink},
  crossref = {aaai15},
  pages = {1431-1438}
}

@inproceedings{bedogamapori22a,
  title = {Explaining {ASP}-based Operating Room Schedules},
  author = {R. Bertolucci and C. Dodaro and G. Galat{\`a} and M. Maratea and I. Porro and F. Ricca},
  crossref = {ips-rcra21},
  pages = {7:1-7:9}
}

@inproceedings{beduke05a,
  title = {Using Answer Set Programming for a Decision Support System},
  author = {C. Beierle and O. Dusso and G. Kern-Isberner},
  crossref = {lpnmr05},
  pages = {374-378}
}

@article{bedupake20a,
  title = {A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph},
  author = {A. Berndt and N. van Duijkeren and L. Palmieri and T. Keviczky},
  doi = {10.48550/arXiv.2010.05254},
  journal = {CoRR},
  url = {https://arxiv.org/abs/2010.05254},
  volume = {abs/2010.05254},
  year = {2020}
}

@inproceedings{bedupr93a,
  title = {Argumentative inference in uncertain and inconsistent knowledge bases},
  author = {S. Benferhat and D. Dubois and H. Prade},
  booktitle = {Proceedings of Ninth International Conference on Uncertainty in Artificial Intelligence},
  pages = {411-419},
  year = {1993}
}

@article{beeifo17a,
  title = {Ticker: {A} system for incremental {ASP}-based stream reasoning},
  author = {H. Beck and T. Eiter and C. Folie},
  journal = tplp,
  number = {5-6},
  pages = {744-763},
  volume = {17},
  year = {2017}
}

@incollection{beek06a,
  title = {Backtracking Search Algorithms},
  author = {P. van Beek},
  chapter = {4},
  crossref = {CPHandbook},
  pages = {85-134}
}

@article{befasc02a,
  title = {Optimality Theory as a Family of Cumulative Logics},
  author = {P. Besnard and G. Fanselow and T. Schaub},
  journal = {Journal of Logic, Language and Information},
  number = {2},
  pages = {153-182},
  volume = {12},
  year = {2003}
}

@unpublished{begasc92a,
  title = {Intuitionistic bases for default logics},
  author = {P. Besnard and D. Gabbay and T. Schaub},
  note = {Unpublished.},
  year = {1992}
}

@unpublished{begasc93a,
  title = {Algebraic metalevel bases for default logics},
  author = {P. Besnard and D. Gabbay and T. Schaub},
  note = {Unpublished.},
  year = {1993}
}

@inproceedings{begescbo16a,
  title = {Answer Set Programming for Logical Analysis of Data},
  author = {K. Becker and M. Gebser and T. Schaub and A. Bockmayr},
  crossref = {wcb16},
  pages = {15-26}
}

@article{begiimzi02a,
  title = {The Complexity of Decentralized Control of Markov Decision Processes},
  author = {D. Bernstein and R. Givan and N. Immerman and S. Zilberstein},
  journal = {Mathematics of Operations Research},
  number = {4},
  pages = {819-840},
  volume = {27},
  year = {2002}
}

@article{begoknle19a,
  title = {A Syntactic Operator for Forgetting that Satisfies Strong Persistence},
  author = {M. Berthold and R. Gon{\c{c}}alves and M. Knorr and J. Leite},
  journal = tplp,
  number = {5-6},
  pages = {1038-1055},
  volume = {19},
  year = {2019}
}

@article{behapn82a,
  title = {Deterministic propositional dynamic logic: Finite models, complexity, and completeness},
  author = {M. Ben-Ari and J. Halpern and A. Pnueli},
  journal = jcss,
  number = {3},
  pages = {402-417},
  publisher = elsevier,
  volume = {25},
  year = {1982}
}

@inproceedings{behasc24a,
  title = {{ASP}-driven User-interaction with Clinguin},
  author = {A. Beiser and S. Hahn and T. Schaub},
  crossref = {iclp-tc24},
  optdoi = {10.4204/EPTCS.325.19},
  optpages = {-}
}

@article{behidi11a,
  title = {Towards an environment interface standard for agent platforms},
  author = {T. Behrens and K. Hindriks and J. Dix},
  journal = amai,
  number = {4},
  pages = {261-295},
  publisher = springer,
  volume = {61},
  year = {2011}
}

@inproceedings{behusc05a,
  title = {Introduction to Inconsistency Tolerance.},
  author = {L. Bertossi and A. Hunter and T. Schaub},
  crossref = {incotol05},
  pages = {1-14}
}

@article{bekalaplry02a,
  title = {On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts},
  author = {P. Berman and M. Karpinski and L. Larmore and W. Plandowski and W. Rytter},
  journal = jcss,
  number = {2},
  pages = {332-350},
  volume = {65},
  year = {2002}
}

@inproceedings{bekasa03a,
  title = {Understanding the Power of Clause Learning},
  author = {P. Beame and H. Kautz and A. Sabharwal},
  crossref = {ijcai03},
  pages = {1194-1201}
}

@article{bekasa04a,
  title = {Towards Understanding and Harnessing the Potential of Clause Learning},
  author = {P. Beame and H. Kautz and A. Sabharwal},
  journal = jair,
  pages = {319-351},
  volume = {22},
  year = {2004}
}

@inproceedings{bekascsosvwa23a,
  title = {Routing and Scheduling in different ways: Abridged Preliminary Report},
  author = {J. Behrens and R. Kaminski and T. Schaub and T. Son and J. Svancara and P. Wanko},
  booktitle = {{ICLP} Workshops},
  publisher = {CEUR-WS.org},
  series = {{CEUR} Workshop Proceedings},
  volume = {3437},
  year = {2023}
}

@article{bekascsosvwa24a,
  title = {Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report},
  author = {J. Behrens and R. Kaminski and T. Schaub and T. Son and J. Svancara and P. Wanko},
  journal = {CoRR},
  url = {https://arxiv.org/abs/2403.12153},
  volume = {abs/2403.12153},
  year = {2024}
}

@inproceedings{bekiblwi00a,
  title = {Hoard: A Scalable Memory Allocator for Multithreaded Applications},
  author = {E. Berger and K. McKinley and R. Blumofe and P. Wilson},
  crossref = {asplos00},
  pages = {117-128}
}

@inproceedings{belegast16a,
  title = {Justifications and Blocking Sets in a Rule-Based Answer Set Computation},
  author = {C. B{\'e}atrix and C. Lef{\`e}vre and L. Garcia and I. St{\'e}phan},
  crossref = {iclp-lipics16},
  pages = {6:1-6:15}
}

@article{bell90b,
  title = {The Logic of Nonmonotonicity},
  author = {J. Bell},
  journal = ai,
  pages = {365-374},
  volume = {41},
  year = {1990}
}

@article{bell90c,
  title = {Nonmonotonic Reasoning, nonmonotonic logics and reasoning about change},
  author = {J. Bell},
  journal = {Artificial Intelligence Review},
  pages = {79-108},
  volume = {4},
  year = {1990}
}

@article{bellman57a,
  title = {A Markovian Decision Process},
  author = {R. Bellman},
  journal = {Journal of Mathematics and Mechanics},
  number = {5},
  pages = {679-684},
  volume = {6},
  year = {1957}
}

@article{bellman58a,
  title = {On a Routing Problem},
  author = {R. Bellman},
  journal = {Quarterly of Applied Mathematics},
  pages = {87-90},
  volume = {16},
  year = {1958}
}

@book{belmac77a,
  title = {A course in mathematical logic},
  author = {J. Bell and M. Machover},
  publisher = n-h,
  year = {1977}
}

@inproceedings{belnap77a,
  title = {A Useful Four-Valued Logic},
  author = {N. Belnap},
  editor = {J. Dunn and G. Epstein},
  booktitle = {Modern Uses of Multiple-Valued Logic},
  page = {9-35},
  publisher = {Reidel},
  year = {1977}
}

@inproceedings{belsim11a,
  title = {A Constraint Seeker: Finding and Ranking Global Constraints from Examples},
  author = {N. Beldiceanu and H. Simonis},
  crossref = {cp11},
  pages = {12-26}
}

@inproceedings{bemesc01a,
  title = {Optimality Theory via Default Logic},
  author = {P. Besnard and R. Mercer and T. Schaub},
  editor = {S. Benferhat and E. Giunchiglia},
  booktitle = {Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning},
  pages = {77-83},
  year = {2002}
}

@inproceedings{bemesc03a,
  title = {Optimality Theory through Default Logic},
  author = {P. Besnard and R. Mercer and T. Schaub},
  editor = {A. G{\"u}nther and R. Kruse and B. Neumann},
  booktitle = {Proceedings of the Twenty-sixth Annual German Conference on Artificial Intelligence (KI'03)},
  pages = {93-104},
  publisher = springer,
  series = lnai,
  volume = {2821},
  year = {2003}
}

@inproceedings{bemipr05a,
  title = {Declarative Policies for Web Service Selection},
  author = {E. Bertino and A. Mileo and A. Provetti},
  crossref = {policy05},
  pages = {239-242}
}

@inproceedings{bendec91a,
  title = {Default Logic, propositional logic and constraints},
  author = {R. Ben-Eliyahu and R. Dechter},
  booktitle = aaai,
  pages = {370-385},
  publisher = {MIT Press},
  year = {1991}
}

@inproceedings{bendec92a,
  title = {Propositional Semantics for Default Logic},
  author = {R. Ben-Eliyahu and R. Dechter},
  crossref = {nmr92},
  pages = {13-27}
}

@article{bendec94a,
  title = {Propositional Semantics for Disjunctive Logic Programs},
  author = {R. Ben-Eliyahu and R. Dechter},
  journal = amai,
  number = {1-2},
  pages = {53-87},
  volume = {12},
  year = {1994}
}

@inproceedings{benisc98b,
  title = {Extension Calculus and Query Answering in Prioritized Default Logic},
  author = {F. Benhammadi and P. Nicolas and T. Schaub},
  editor = {F. Giunchiglia},
  booktitle = aimsa,
  pages = {76-87},
  publisher = springer,
  series = lnai,
  volume = {1480},
  year = {1998}
}

@inproceedings{benisc99a,
  title = {Query-answering in prioritized default logic},
  author = {F. Benhammadi and P. Nicolas and T. Schaub},
  editor = {A. Hunter and S. Parsons},
  booktitle = {Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty},
  pages = {32-42},
  publisher = springer,
  series = lnai,
  volume = {1638},
  year = {1999}
}

@book{benmic06a,
  title = {Networks on chips --- technology and tools},
  author = {L. Benini and G. {D}e Micheli},
  publisher = {Elsevier Morgan Kaufmann},
  series = {The Morgan Kaufmann series in systems on silicon},
  year = {2006}
}

@book{benwil10a,
  title = {Lists, Decisions and Graphs},
  author = {E. Bender and S. Williamson},
  publisher = {University of California, San Diego},
  year = {2010}
}

@inproceedings{beququ83a,
  title = {A Theorem-Prover for a Decidable Subset of Default Logic},
  author = {P. Besnard and R. Quiniou and P. Quinton},
  booktitle = aaai,
  pages = {27-30},
  year = {1983}
}

@inproceedings{berhol93a,
  title = {On the Adequateness of the Connection Method},
  author = {A. Beringer and S. H{\"o}lldobler},
  booktitle = aaai,
  year = {1993}
}

@article{berpar10a,
  title = {The {S}at4j library, release 2.2},
  author = {D. {L}e Berre and A. Parrain},
  journal = jsat,
  pages = {59-64},
  volume = {7},
  year = {2010}
}

@inproceedings{bersch93a,
  title = {Minimal belief and negation as failure: A feasible approach},
  author = {A. Beringer and T. Schaub},
  booktitle = aaai,
  pages = {400-405},
  publisher = aaaimit,
  year = {1993}
}

@inproceedings{bersim04a,
  title = {Fifty-Five Solvers in {V}ancouver: The {SAT} 2004 Competition},
  author = {D. {L}e Berre and L. Simon},
  crossref = {sat04},
  pages = {321-344}
}

@inproceedings{bescfr95a,
  title = {Computing the Well-Founded Semantics Faster},
  author = {K. Berman and J. Schlipf and J. Franco},
  crossref = {lpnmr95},
  pages = {113-126}
}

@inproceedings{besctowo02a,
  title = {Paraconsistent reasoning via quantified {B}oolean formulas},
  author = {P. Besnard and T. Schaub and H. Tompits and S. Woltran},
  editor = {H. Decker and T. Waragai},
  booktitle = {Proceedings of the Workshop on Paraconsistent Computational Logic},
  year = {2002}
}

@inproceedings{besctowo02b,
  title = {Paraconsistent reasoning via quantified {B}oolean formulas},
  author = {P. Besnard and T. Schaub and H. Tompits and S. Woltran},
  crossref = {jelia02},
  pages = {320-331}
}

@inproceedings{besctowo03a,
  title = {Paraconsistent Reasoning via Quantified {B}oolean Formulas, Part II: Circumscribing Inconsistent Theories},
  author = {P. Besnard and T. Schaub and H. Tompits and S. Woltran},
  editor = {T. Nielsen and N. Zhang},
  booktitle = {Proceedings of the Seventh European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty},
  pages = {528-539},
  publisher = springer,
  series = lnai,
  volume = {2711},
  year = {2003}
}

@inproceedings{besctowo05a,
  title = {Representing Paraconsistent Reasoning via Quantified Propositional Logic.},
  author = {P. Besnard and T. Schaub and H. Tompits and S. Woltran},
  crossref = {incotol05},
  pages = {84-118}
}

@inproceedings{besgui97a,
  title = {The Characterization of Non-Monotonic Inference Relations},
  author = {P. Besnard and J. Guinnebault},
  editor = {G. Brewka and C. Witteveen and E. Weydert},
  booktitle = {Proceedings of the Third Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications},
  pages = {120-129},
  year = {1997}
}

@book{beshun08a,
  title = {Elements of Argumentation},
  author = {P. Besnard and A. Hunter},
  publisher = {MIT Press},
  year = {2008}
}

@article{beslae94,
  title = {Logics for Paraconsistent Reasoning: A Knowledge Representation Perspective},
  author = {P. Besnard and E. Laenens},
  journal = {Journal of Intelligent Systems},
  volume = {9},
  year = {1994}
}

@inproceedings{besnard88b,
  title = {Axiomatizations in the Metatheory of Nonmonotonic Inference Systems},
  author = {P. Besnard},
  editor = {R. Goebel},
  booktitle = {Proceedings of Canadian Society for Computational Studies of Intelligence Conference},
  pages = {117-124},
  year = {1988}
}

@book{besnard89,
  title = {An Introduction to Default Logic},
  author = {P. Besnard},
  publisher = springer,
  series = {Symbolic Computation --- Artifical Intelligence},
  year = {1989}
}

@techreport{besnard90,
  title = {Annotaded bibliography on symbolic logics for defeasible reasoning},
  author = {P. Besnard},
  institution = {IRISA},
  year = {1990}
}

@inproceedings{besnard91,
  title = {Paraconsistent logic approach to knowledge representation},
  author = {P. Besnard},
  editor = {M. de Glas and D. Gabbay},
  booktitle = {Proceedings of the First World Conference on Fundamentals of Artificial Intelligence},
  year = {1991}
}

@inproceedings{bessch00a,
  title = {Significant Inferences},
  author = {P. Besnard and T. Schaub},
  crossref = {kr00},
  pages = {401-410}
}

@misc{bessch01a,
  title = {Accounts of absurdity in paraconsistent logics},
  author = {P. Besnard and T. Schaub},
  howpublished = {Accepted for publication in the US CONGRESS ON PARACONSISTENCY (USA-P2001)},
  note = {Withdrawn due to missing travel funds.},
  year = {2001}
}

@techreport{bessch92,
  title = {Possible Worlds Semantics for Default Logics},
  author = {P. Besnard and T. Schaub},
  address = iki:adr,
  institution = iki,
  number = {AIDA-92-1},
  year = {1992}
}

@inproceedings{bessch92a,
  title = {Possible Worlds Semantics for Default Logics},
  author = {P. Besnard and T. Schaub},
  editor = {J. Glasgow and B. Hadley},
  booktitle = {Proceedings of the Canadian Artificial Intelligence Conference},
  note = {Also in: D. Etherington and H. Kautz, editors. Proceedings of the Fourth International Workshop on Nonmonotonic Reasoning, AAAI.},
  pages = {148-155},
  publisher = m-k,
  year = {1992}
}

@inproceedings{bessch92b,
  title = {Possible Worlds Semantics for Default Logics},
  author = {P. Besnard and T. Schaub},
  editor = {D. Etherington and H. Kautz},
  booktitle = {Proceedings of the Fourth International Workshop on Nonmonotonic Reasoning},
  note = {Also in: J. Glasgow and B. Hadley, editors. Proceedings of the Canadian Artificial Intelligence Conference},
  organization = {AAAI},
  pages = {34-40},
  year = {1992}
}

@article{bessch92c,
  title = {Possible Worlds Semantics for Default Logics},
  author = {P. Besnard and T. Schaub},
  journal = {Fundamenta Informaticae},
  number = {1-2},
  pages = {39-66},
  volume = {21},
  year = {1994}
}

@inproceedings{bessch93a,
  title = {A context-based framework for default logics},
  author = {P. Besnard and T. Schaub},
  booktitle = aaai,
  pages = {406-411},
  publisher = aaaimit,
  year = {1993}
}

@article{bessch93b,
  title = {An approach to context-based default reasoning},
  author = {P. Besnard and T. Schaub},
  journal = {Fundamenta Informaticae},
  number = {2-4},
  pages = {175-223},
  volume = {23},
  year = {1995}
}

@unpublished{bessch94a,
  title = {A simple signed system for paraconsistent reasoning},
  author = {P. Besnard and T. Schaub},
  note = {Unpublished manuscript},
  year = {1994}
}

@inproceedings{bessch96a,
  title = {A simple signed system for paraconsistent reasoning},
  author = {P. Besnard and T. Schaub},
  editor = {J. Alferes and L. Pereira and E. Orlowska},
  booktitle = {Fifth European Workshop on Logics in Artificial Intelligence (JELIA'96)},
  pages = {404-416},
  publisher = springer,
  series = lnai,
  volume = {1126},
  year = {1996}
}

@inproceedings{bessch97a,
  title = {Circumscribing inconsistency},
  author = {P. Besnard and T. Schaub},
  booktitle = ijcai,
  pages = {150-155},
  publisher = m-k,
  year = {1997}
}

@article{bessch98a,
  title = {Signed systems for paraconsistent reasoning},
  author = {P. Besnard and T. Schaub},
  journal = jar,
  number = {1-2},
  pages = {191-213},
  volume = {20},
  year = {1998}
}

@article{bessch99a,
  title = {What is a (non-constructive) non-monotone logical system?},
  author = {P. Besnard and T. Schaub},
  journal = tcs,
  number = {1-2},
  pages = {489-494},
  volume = {238},
  year = {2000}
}

@inproceedings{besshw81,
  title = {The Markgraf Karl Refutation Procedure},
  author = {K. Bl{\"a}sius and N. Eisinger and J. Siekmann and G. Smolka and A. Herold and C. Walther},
  booktitle = ijcai,
  pages = {511-518},
  year = {1981}
}

@inproceedings{bessie88a,
  title = {Supposition-based Logic for Automated Nonmonotonic Reasoning},
  author = {P. Besnard and P. Siegel},
  booktitle = cade,
  pages = {592-601},
  publisher = springer,
  year = {1988}
}

@incollection{bessie88b,
  title = {The Preferential-Models Approach to Non-Monotonic Logics},
  author = {P. Besnard and P. Siegel},
  editor = {P. Smets and E. Mamdani and D. Dubois and H. Prade},
  booktitle = {Non-Standard Logics for Automated Reasoning},
  pages = {137-161},
  publisher = {Academic Press},
  year = {1988}
}

@article{bflnrp00a,
  title = {Enhancing Disjunctive Datalog by Constraints},
  author = {F. Buccafurri and N. Leone and P. Rullo},
  journal = tkde,
  number = {5},
  pages = {845-860},
  volume = {12},
  year = {2000}
}

@inproceedings{bianglscha15a,
  title = {A symbolic system synthesis approach for hard real-time systems based on coordinated {SMT}-solving},
  author = {A. Biewer and B. Andres and J. Gladigau and T. Schaub and C. Haubelt},
  crossref = {date15},
  pages = {357-362}
}

@incollection{bibel:a27,
  title = {Intellectics},
  author = {W. Bibel},
  editor = {S. Shapiro},
  address = {New York},
  booktitle = {Encyclopedia of Artificial Intelligence},
  pages = {705-706},
  publisher = wiley,
  year = {1992}
}

@book{bibel:b10,
  title = {Deduktion --- Automatisierung der Logik},
  author = {W. Bibel},
  address = {M{\"u}nchen},
  publisher = {Oldenbourg},
  series = {Handbuch der Informatik},
  year = {1992}
}

@book{bibel:b12,
  title = {Wissensrepr{\"a}sentation und Inferenz},
  author = {W. Bibel and S. H{\"o}lldobler and T. Schaub},
  address = {Braunschweig},
  publisher = {Vieweg Verlag},
  year = {1993}
}

@book{bibel:b13,
  title = {Deduction: Automated Logic},
  author = {W. Bibel},
  address = {London},
  publisher = {Academic Press},
  year = {1993}
}

@book{bibel:b8,
  title = {Automated Theorem Proving},
  author = {W. Bibel},
  address = {Braunschweig},
  edition = {2},
  publisher = {Vieweg Verlag},
  year = {1987}
}

@inproceedings{bibel:c10,
  title = {First-order reasoning about knowledge and belief},
  author = {W. Bibel},
  editor = {I. Plander},
  address = {Amsterdam},
  booktitle = {3rd International Conference on Artificial Intelligence and Information-Control Systems of Robots},
  organization = {North-Holland},
  pages = {9-16},
  year = {1984}
}

@inproceedings{bibel:c11,
  title = {Inferenzmethoden},
  author = {W. Bibel},
  editor = {C. Habel},
  address = {Berlin},
  booktitle = {Fr{\"u}hjahrsschule K{\"u}nstliche Intelligenz},
  organization = springer,
  pages = {1-47},
  year = {1985}
}

@incollection{bibel:c18,
  title = {Methods of Automated Reasoning},
  author = {W. Bibel},
  editor = {W. Bibel and P. Jorrand},
  address = {Berlin},
  booktitle = {Fundamentals of Artificial Intelligence --- An Advanced Course},
  pages = {173-222},
  publisher = springer,
  year = {1986}
}

@inproceedings{bibel:c9,
  title = {Knowledge Representation from a Deductive Point of View},
  author = {W. Bibel},
  editor = {V. Ponomaryov},
  address = {Leningrad, USSR},
  booktitle = {Proceedings of the I IFAC Symposium on Artificial Intelligence},
  organization = {Pergamon Press},
  pages = {37-48},
  year = {1984}
}

@inproceedings{bibregra94a,
  title = {{KoMeT}},
  author = {W. Bibel and S. Br{\"u}ning and U. Egly and T. Rath},
  editor = {A. Bundy},
  booktitle = cade,
  note = {System description},
  number = {814},
  pages = {783-787},
  publisher = springer,
  series = lnai,
  year = {1994}
}

@incollection{bibrotrasc98,
  title = {Compressions and extensions},
  author = {W. Bibel and S. Br{\"u}ning and J. Otten and T. Rath and T. Schaub},
  editor = {W. Bibel and P. Schmitt},
  booktitle = {Automated Deduction --- A Basis for Applications},
  chapter = {5},
  pages = {133-179},
  publisher = kluwer,
  volume = {1},
  year = {1998}
}

@inproceedings{bicafr83a,
  title = {Towards an advanced implementation of the connection method},
  author = {W. Bibel and R. Caferra and E. Eder and B. Fronh{\"o}fer},
  booktitle = ijcai,
  keywords = {Theorem Proving},
  pages = {920-922},
  publisher = m-k,
  year = {1983}
}

@inproceedings{bicefrhe89a,
  title = {Plan Generation by linear proofs: on semantics},
  author = {W. Bibel and L. {Fari{\~n}as del Cerro} and B. Fronh{\"o}fer and A. Herzig},
  editor = {D. Metzing},
  booktitle = {Proceedings GWAI-89},
  number = {216},
  pages = {49-62},
  publisher = springer,
  series = ifb,
  year = {1989}
}

@article{biciclstzh03a,
  title = {Bounded Model Checking},
  author = {A. Biere and A. Cimatti and E. Clarke and O. Strichman and Y. Zhu},
  journal = {Advances in Computers},
  pages = {118-149},
  volume = {58},
  year = {2003}
}

@inproceedings{biciclzh99a,
  title = {Symbolic Model Checking without {BDD}s},
  author = {A. Biere and A. Cimatti and E. Clarke and Y. Zhu},
  crossref = {tacas99},
  pages = {193-207}
}

@inproceedings{bidfro87a,
  title = {Minimalism subsumes default logic and circumscription in stratified logic programming},
  author = {N. Bidoit and C. Froidevaux},
  crossref = {lics87},
  pages = {89-97}
}

@article{bidfro91a,
  title = {General Logical Databases and Programs: Default Logic Semantics and Stratification},
  author = {N. Bidoit and C. Froidevaux},
  journal = {Information and Computation},
  number = {1},
  pages = {15-54},
  volume = {91},
  year = {1991}
}

@article{bidfro91b,
  title = {Negation by default and unstratifiable logic programs},
  author = {N. Bidoit and C. Froidevaux},
  journal = tcs,
  number = {1},
  pages = {85-112},
  volume = {78},
  year = {1991}
}

@article{biedep00a,
  title = {On an intuitionistic modal logic},
  author = {G. Bierman and V. de Paiva},
  journal = {Studia Logica},
  number = {3},
  pages = {383-416},
  publisher = springer,
  volume = {65},
  year = {2000}
}

@inproceedings{biefro15a,
  title = {Evaluating {CDCL} Variable Scoring Schemes},
  author = {A. Biere and A. Fr{\"o}hlich},
  crossref = {sat15},
  pages = {405-422}
}

@article{biere08a,
  title = {Pico{SAT} Essentials},
  author = {A. Biere},
  journal = jsat,
  pages = {75-97},
  volume = {4},
  year = {2008}
}

@inproceedings{biere08b,
  title = {Adaptive Restart Strategies for Conflict Driven {SAT} Solvers},
  author = {A. Biere},
  crossref = {sat08},
  pages = {28-33}
}

@incollection{biere09a,
  title = {Bounded Model Checking},
  author = {A. Biere},
  chapter = {14},
  crossref = {SATHandbook},
  pages = {457-481}
}

@techreport{biere10a,
  title = {{Lingeling}, {Plingeling}, {PicoSAT} and {PrecoSAT} at {SAT} Race 2010},
  author = {A. Biere},
  institution = {Institute for Formal Models and Verification. Johannes Kepler University},
  number = {10/1},
  year = {2010}
}

@techreport{biere11a,
  title = {Lingeling and Friends at the {SAT} Competition 2011},
  author = {A. Biere},
  institution = {Institute for Formal Models and Verification, Johannes Kepler University},
  number = {FMV 11/1},
  type = {Technical Report},
  year = {2011}
}

@inproceedings{bifahe88a,
  title = {{MOLOG:} a Modal {PROLOG}},
  author = {P. Bieber and L. {Fari{\~n}as del Cerro} and A. Herzig},
  crossref = {cade88},
  pages = {762-763}
}

@article{bifrmc11a,
  title = {Specifying and computing preferred plans},
  author = {M. Bienvenu and C. Fritz and S. {McIlraith}},
  journal = ai,
  number = {7-8},
  pages = {1308-1345},
  volume = {175},
  year = {2011}
}

@inproceedings{bigejomemiobsasc11a,
  title = {Knowledge-intense Stream Reasoning},
  author = {R. Bisiani and M. Gebser and H. Jost and D. Merico and A. Mileo and P. Obermeier and O. Sabuncu and T. Schaub},
  editor = {M. Fink and A. Mileo},
  booktitle = {Proceedings of the Second Workshop on Logic-based Interpretation of Context: Modelling and Applications (LogIC'11)},
  pages = {7-8},
  publisher = {CEUR Workshop Proceedings (CEUR-WS.org)},
  url = {http://ceur-ws.org/Vol-738},
  volume = {738},
  year = {2011}
}

@article{bihejulasc06a,
  title = {Linear Encodings of Bounded {LTL} Model Checking},
  author = {A. Biere and K. Heljanko and T. Junttila and T. Latvala and V. Schuppan},
  journal = {Logical Methods in Computer Science},
  number = {5},
  volume = {2},
  year = {2006}
}

@article{bikekolimafrhohuletiva16a,
  title = {{AS}lib: A Benchmark Library for Algorithm Selection},
  author = {B. Bischl and P. Kerschke and L. Kotthoff and M. Lindauer and Y. Malitsky and A. Fr{\'e}chette and H. Hoos and F. Hutter and K. Leyton-Brown and K. Tierney and J. Vanschoren},
  journal = ai,
  pages = {41-58},
  volume = {237},
  year = {2016}
}

@inproceedings{bilawi10a,
  title = {From Preference Logics to Preference Languages, and Back},
  author = {M. Bienvenu and J. Lang and N. Wilson},
  crossref = {kr10}
}

@inproceedings{bilose11a,
  title = {Blocked Clause Elimination for {QBF}},
  author = {A. Biere and F. Lonsing and M. Seidl},
  crossref = {cade11},
  pages = {101-115}
}

@article{bimowo20a,
  title = {selp: {A} Single-Shot Epistemic Logic Program Solver},
  author = {M. Bichler and M. Morak and S. Woltran},
  journal = tplp,
  number = {4},
  pages = {435-455},
  volume = {20},
  year = {2020}
}

@article{bipibe19a,
  title = {Planning with preferences using Multi-Attribute Utility Theory along with a Choquet Integral},
  author = {L. Bidoux and J. Pignon and F. B{\'e}naben},
  journal = {Engineering Applications of Artificial Intelligence},
  pages = {808-817},
  volume = {85},
  year = {2019}
}

@book{birkhoff48,
  title = {Lattice Theory},
  author = {G. Birkhoff},
  publisher = {AMS Colloquium Publications},
  year = {1948}
}

@article{birloz99a,
  title = {The Good Old {D}avis-{P}utnam Procedure Helps Counting Models},
  author = {E. Birnbaum and E. Lozinskii},
  journal = jair,
  pages = {457-477},
  volume = {10},
  year = {1999}
}

@inproceedings{biscstta18a,
  title = {Integrating Semantic Web Technologies and {ASP} for Product Configuration},
  author = {S. Bischof and G. Schenner and S. Steyskal and R. Taupe},
  crossref = {conf18},
  pages = {53-60}
}

@book{bishop07a,
  title = {Pattern Recognition and Machine Learning (Information Science and Statistics)},
  author = {C. Bishop},
  edition = {2},
  publisher = springer,
  year = {2007}
}

@inproceedings{bistpava02a,
  title = {A Racing Algorithm for Configuring Metaheuristics},
  author = {M. Birattari and T. St{\"u}tzle and L. Paquete and K. Varrentrapp},
  crossref = {gecco02},
  pages = {11-18}
}

@book{blabue87,
  title = {Deduktionssysteme},
  editor = {K. Bl{\"a}sius and H. B{\"u}rckert},
  publisher = {Oldenbourg},
  year = {1987}
}

@phdthesis{blake37a,
  title = {Canonical expressions in {B}oolean algebra},
  author = {A. Blake},
  school = {University of Chicago},
  year = {1937}
}

@article{blasub88a,
  title = {Paraconsistent Foundations of Logic Programming},
  author = {H. Blair and V. Subrahmanian},
  journal = {Journal of Non-Classical Logics},
  number = {2},
  pages = {45-73},
  volume = {5},
  year = {1988}
}

@article{blasub89a,
  title = {Paraconsistent Logic Programming},
  author = {H. Blair and V. Subrahmanian},
  journal = tcs,
  number = {2},
  pages = {135-154},
  volume = {68},
  year = {1989}
}

@book{blecpescwe14a,
  title = {Handbook on Scheduling: From Theory to Applications},
  author = {J. Blazewicz and K. Ecker and E. Pesch and G. Schmidt and J. Weglarz},
  booktitle = {Handbook on Scheduling: From Theory to Applications},
  publisher = springer,
  year = {2014}
}

@inproceedings{blgeba14a,
  title = {Towards a Theory of Intentional Agents},
  author = {J. Blount and M. Gelfond and M. Balduccini},
  booktitle = {AAAI Stanford Spring Symposium on Knowledge Representation and Reasoning in Robotics},
  year = {2014}
}

@inproceedings{blkascwo16a,
  title = {{ASP} for Anytime Dynamic Programming on Tree Decompositions},
  author = {B. Bliem and B. Kaufmann and T. Schaub and S. Woltran},
  crossref = {ijcai16},
  pages = {979-986}
}

@incollection{blogel12a,
  title = {Reasoning about the Intentions of Agents},
  author = {J. Blount and M. Gelfond},
  editor = {A. Artikis and R. Craven and N. Kesim and B. Sadighi and K. Stathis},
  booktitle = {Logic Programs, Norms and Action},
  pages = {147-171},
  publisher = springer,
  series = lncs,
  volume = {7360},
  year = {2012}
}

@book{blrive01a,
  title = {Modal Logic},
  author = {P. Blackburn and M. de Rijke and Y. Venema},
  publisher = cup,
  series = {Cambridge Tracts in Theoretical Computer Science},
  volume = {53},
  year = {2001}
}

@article{blsiku03a,
  title = {Parallel propositional satisfiability checking with distributed dynamic learning},
  author = {W. Blochinger and C. Sinz and W. K{\"u}chlin},
  journal = {Parallel Computing},
  number = {7},
  pages = {969-994},
  volume = {29},
  year = {2003}
}

@inproceedings{blsiku03b,
  title = {A Universal Parallel {SAT} Checking Kernel},
  author = {W. Blochinger and C. Sinz and W. K{\"u}chlin},
  editor = {H. Arabnia and Y. Mun},
  booktitle = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'03)},
  pages = {1720-1725},
  publisher = {CSREA Press},
  year = {2003}
}

@incollection{blteth98a,
  title = {System-Level Synthesis Using Evolutionary Algorithms},
  author = {T. Blickle and J. Teich and L. Thiele},
  booktitle = {Design Automation for Embedded Systems},
  pages = {23-62},
  publisher = springer,
  series = {3},
  year = {1998}
}

@inproceedings{blufur95a,
  title = {Fast Planning Through Planning Graph Analysis},
  author = {A. Blum and M. Furst},
  crossref = {ijcai95},
  pages = {1636-1642}
}

@article{blufur97a,
  title = {Fast Planning Through Planning Graph Analysis},
  author = {A. Blum and M. Furst},
  journal = ai,
  number = {1-2},
  pages = {281-300},
  volume = {90},
  year = {1997}
}

@inproceedings{boansctr04a,
  title = {Towards Systematic Benchmarking in Answer Set Programming: The {D}agstuhl Initiative},
  author = {P. Borchert and C. Anger and T. Schaub and M. Truszczy{\'n}ski},
  crossref = {lpnmr04},
  pages = {3-7}
}

@article{bobrcijurarose06a,
  title = {Efficient Theory Combination via {B}oolean Search},
  author = {M. Bozzano and R. Bruttomesso and A. Cimatti and T. Junttila and S. Ranise and P. van Rossum and R. Sebastiani},
  journal = {Information and Computation},
  number = {10},
  pages = {1493-1525},
  volume = {204},
  year = {2006}
}

@book{bobrow80,
  title = {Special issue on nonmonotonic logic},
  editor = {D. Bobrow},
  noneednumber = {1-2},
  publisher = ai,
  volume = {13},
  year = {1980}
}

@inproceedings{bobrvofi08a,
  title = {Automatic Composition of Melodic and Harmonic Music by Answer Set Programming},
  author = {G. Boenn and M. Brain and M. {D}e Vos and J. Fitch},
  crossref = {iclp08},
  pages = {160-174}
}

@inproceedings{bobrvofi09a,
  title = {{ANTON}: Composing Logic and Logic Composing},
  author = {G. Boenn and M. Brain and M. {D}e Vos and J. Fitch},
  crossref = {lpnmr09},
  pages = {542-547}
}

@techreport{bobste83,
  title = {The Loops Manual},
  author = {D. Bobrow and M. Stefik},
  institution = {Xerox Corporation},
  year = {1983}
}

@inproceedings{bocadisc18a,
  title = {Introducing Temporal Stable Models for Linear Dynamic Logic},
  author = {A. Bosser and P. Cabalar and M. Di{\'e}guez and T. Schaub},
  crossref = {kr18},
  pages = {12-21}
}

@article{bocegasc12a,
  title = {Benchmarking Curriculum-based Course Timetabling: Formulations, Data Formats, Instances, Validation, Visualization, and Results},
  author = {A. Bonutti and F. {D}e Cesco and L. {D}i Gaspero and A. Schaerf},
  journal = {Annals of Operations Research},
  number = {1},
  pages = {59-70},
  url = {http://dx.doi.org/10.1007/s10479-010-0707-0},
  volume = {194},
  year = {2012}
}

@incollection{bochoo05a,
  title = {Constraint Programming},
  author = {A. Bockmayr and J. Hooker},
  editor = {K. Aardal and G. Nemhauser and R. Weismantel},
  booktitle = {Discrete Optimization},
  pages = {559-600},
  publisher = elsevier,
  series = {Handbooks in Operations Research and Management Science},
  volume = {12},
  year = {2005}
}

@article{bodukoto97a,
  title = {An abstract, argumentation-theoretic approach to default reasoning},
  author = {A. Bondarenko and P. Dung and R. Kowalski and F. Toni},
  journal = ai,
  number = {1-2},
  pages = {63-101},
  volume = {93},
  year = {1997}
}

@inproceedings{boeifisc10a,
  title = {The mcs-ie System for Explaining Inconsistency in Multi-Context Systems},
  author = {M. B{\"o}gl and T. Eiter and M. Fink and P. Sch{\"u}ller},
  crossref = {jelia10},
  pages = {356-359}
}

@article{boespe96a,
  title = {A Fast Parallel {SAT}-Solver --- Efficient Workload Balancing},
  author = {M. B{\"o}hm and E. Speckenmeyer},
  journal = amai,
  number = {3-4},
  pages = {381-400},
  volume = {17},
  year = {1996}
}

@inproceedings{bofestshtobesh15a,
  title = {{ICBS}: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding},
  author = {E. Boyarski and A. Felner and R. Stern and G. Sharon and D. Tolpin and O. Betzalel and S. Shimony},
  crossref = {ijcai15},
  pages = {740-746}
}

@article{bofu98a,
  title = {A Two-Phase Exact Algorithm for {MAX-SAT} and Weighted {MAX-SAT} Problems},
  author = {B. Borchers and J. Furman},
  journal = {Journal of Combinatorial Optimization},
  number = {4},
  pages = {299-306},
  volume = {2},
  year = {1998}
}

@inproceedings{bogeja14a,
  title = {Improving the Normalization of Weight Rules in Answer Set Programs},
  author = {J. Bomanson and M. Gebser and T. Janhunen},
  crossref = {jelia14},
  doi = {10.1007/978-3-319-11558-0_12},
  pages = {166-180}
}

@inproceedings{bogeja16a,
  title = {Rewriting Optimization Statements in Answer-Set Programs},
  author = {J. Bomanson and M. Gebser and T. Janhunen},
  crossref = {iclp-lipics16},
  doi = {10.4230/OASIcs.ICLP.2016.5},
  pages = {5:1-5:15}
}

@inproceedings{bogejakasc15a,
  title = {Answer Set Programming Modulo Acyclicity},
  author = {J. Bomanson and M. Gebser and T. Janhunen and B. Kaufmann and T. Schaub},
  crossref = {lpnmr15},
  pages = {143-150}
}

@inproceedings{bogejakasc15b,
  title = {Answer Set Programming Modulo Acyclicity},
  author = {J. Bomanson and M. Gebser and T. Janhunen and B. Kaufmann and T. Schaub},
  crossref = {aspocp15}
}

@article{bogejakasc16a,
  title = {Answer Set Programming Modulo Acyclicity},
  author = {J. Bomanson and M. Gebser and T. Janhunen and B. Kaufmann and T. Schaub},
  journal = {Fundamenta Informaticae},
  number = {1},
  pages = {63-91},
  volume = {147},
  year = {2016}
}

@inproceedings{bogigeparu20a,
  title = {High-Level Programming via Generalized Planning and {LTL} Synthesis},
  author = {B. Bonet and G. {D}e Giacomo and H. Geffner and F. Patrizi and S. Rubin},
  crossref = {kr20},
  pages = {152-161}
}

@inproceedings{bogwei18a,
  title = {Exploiting Justifications for Lazy Grounding of Answer Set Programs},
  author = {B. Bogaerts and A. Weinzierl},
  crossref = {ijcai18},
  doi = {10.24963/ijcai.2018/240},
  pages = {1737-1745}
}

@inproceedings{bohasa09a,
  title = {Experiments with Massively Parallel Constraint Solving},
  author = {L. Bordeaux and Y. Hamadi and H. Samulowitz},
  crossref = {ijcai09},
  pages = {443-448}
}

@article{bohihome07a,
  title = {A verification framework for agent programming with declarative goals},
  author = {F. de Boer and K. Hindriks and W. van der Hoek and J. Meyer},
  journal = {Journal of Applied Logic},
  number = {2},
  pages = {277-302},
  volume = {5},
  year = {2007}
}

@inproceedings{bojanczyk02a,
  title = {Two-way alternating automata and finite models},
  author = {M. Boja{\'n}czyk},
  booktitle = {International Colloquium on Automata, Languages, and Programming},
  organization = springer,
  pages = {833-844},
  year = {2002}
}

@article{bojani20a,
  title = {Applying Visible Strong Equivalence in Answer-Set Program Transformations},
  author = {J. Bomanson and T. Janhunen and I. Niemel{\"a}},
  journal = tocl,
  number = {21},
  pages = {33:1-33:41},
  volume = {4},
  year = {2020}
}

@article{bojata16a,
  title = {Stable-Unstable Semantics: Beyond {NP} With Normal Logic Programs},
  author = {B. Bogaerts and T. Janhunen and S. Tasharrofi},
  journal = tplp,
  number = {5-6},
  pages = {570-586},
  volume = {16},
  year = {2016}
}

@inproceedings{bojawe19a,
  title = {Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming},
  author = {J. Bomanson and T. Janhunen and A. Weinzierl},
  crossref = {aaai19},
  pages = {2694-2702}
}

@inproceedings{bojesc15a,
  title = {Complexity Results in Epistemic Planning},
  author = {T. Bolander and M. Jensen and F. Schwarzentruber},
  crossref = {ijcai15},
  pages = {2791-2797}
}

@inproceedings{bolamaouwo17a,
  title = {Timed Temporal Logics},
  author = {P. Bouyer and F. Laroussinie and N. Markey and J. Ouaknine and J. Worrell},
  editor = {L. Aceto and G. Bacci and G. Bacci and A. Ing{\'o}lfsd{\'o}ttir and A. Legay and R. Mardare},
  booktitle = {Models, Algorithms, Logics and Tools --- Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday},
  doi = {10.1007/978-3-319-63121-9\_11},
  pages = {211-230},
  publisher = springer,
  series = lncs,
  volume = {10460},
  year = {2017}
}

@article{boland11a,
  title = {Epistemic planning for single and multi-agent systems},
  author = {T. Bolander and M. Andersen},
  journal = jancl,
  number = {1},
  pages = {9-34},
  volume = {21},
  year = {2011}
}

@inproceedings{bolisc04a,
  title = {Profiling Answer Set Programming: The Visualization Component of the \texttt{noMoRe} System},
  author = {A. B{\"o}sel and T. Linke and T. Schaub},
  crossref = {jelia04},
  pages = {702-705}
}

@inproceedings{bollinger91,
  title = {A Model Elimination Calculus for Generalized Clauses},
  author = {T. Bollinger},
  editor = {J. Myopoulos and R. Reiter},
  booktitle = ijcai,
  publisher = m-k,
  year = {1991}
}

@inproceedings{bomapi15a,
  title = {Unifying Hyper and Epistemic Temporal Logics},
  author = {L. Bozzelli and B. Maubert and S. Pinchinat},
  editor = {A. Pitts},
  booktitle = {Proceedings of the Eighteenth International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'15)},
  pages = {167-182},
  publisher = springer,
  series = lncs,
  volume = {9034},
  year = {2015}
}

@inproceedings{bomjan13a,
  title = {Normalizing Cardinality Rules using Merging and Sorting Constructions},
  author = {J. Bomanson and T. Janhunen},
  crossref = {lpnmr13},
  pages = {187-199}
}

@article{bomusc04a,
  title = {Near Optimal Hierarchical Path-Finding},
  author = {A. Botea and M. M{\"u}ller and J. Schaeffer},
  journal = {Journal of Game Development},
  number = {1},
  pages = {7-28},
  volume = {1},
  year = {2004}
}

@article{bonatti01a,
  title = {Resolution for Skeptical Stable Model Semantics},
  author = {P. Bonatti},
  journal = jar,
  number = {4},
  pages = {391-421},
  volume = {27},
  year = {2001}
}

@article{bonatti04a,
  title = {Reasoning with infinite stable models},
  author = {P. Bonatti},
  journal = ai,
  number = {1},
  pages = {75-111},
  volume = {156},
  year = {2004}
}

@inproceedings{bonatti96a,
  title = {Proof Systems for Default and Autoepistemic Logic},
  author = {P. Bonatti},
  editor = {P. Miglioli and U. Moscato and D. Mundici and M. Ornaghi},
  booktitle = {Proceedings Tableaux'96},
  pages = {127-142},
  publisher = springer,
  series = lnai,
  volume = {1071},
  year = {1996}
}

@inproceedings{bongef00a,
  title = {Planning with Incomplete Information as Heuristic Search in Belief Space},
  author = {B. Bonet and H. Geffner},
  crossref = {aips00},
  pages = {52-61}
}

@article{bongef01a,
  title = {Planning as Heuristic Search},
  author = {B. Bonet and H. Geffner},
  journal = ai,
  pages = {5-33},
  volume = {129},
  year = {2001}
}

@inproceedings{bongef03a,
  title = {Labeled {RTDP:} Improving the Convergence of Real-Time Dynamic Programming},
  author = {B. Bonet and H. Geffner},
  crossref = {icaps03},
  pages = {12-21}
}

@inproceedings{bonhel10a,
  title = {Strengthening Landmark Heuristics via Hitting Sets},
  author = {B. Bonet and M. Helmert},
  crossref = {ecai10},
  pages = {329-334}
}

@inproceedings{bonoli97a,
  title = {A sequent calculus for skeptical default logic},
  author = {P. Bonatti and N. Olivetti},
  editor = {D. Galmiche},
  booktitle = {Proceedings Tableaux'97},
  pages = {107-121},
  publisher = springer,
  series = lnai,
  volume = {1227},
  year = {1997}
}

@book{boolos79,
  title = {The Unprovability of Consistency},
  author = {G. Boolos},
  publisher = cup,
  year = {1979}
}

@article{bopasuvi12a,
  title = {Solving constraint satisfaction problems with SAT modulo theories},
  author = {M. Bofill and M. Palah{\'i} and J. Suy and M. Villaret},
  journal = {Constraints},
  number = {3},
  pages = {273-303},
  volume = {17},
  year = {2012}
}

@inproceedings{boposo08a,
  title = {Credulous Resolution for Answer Set Programming},
  author = {P. Bonatti and E. Pontelli and T. Son},
  crossref = {aaai08},
  pages = {418-423}
}

@article{borham02a,
  title = {Pseudo-Boolean optimization},
  author = {E. Boros and P. Hammer},
  journal = {Discrete Applied Mathematics},
  number = {1-3},
  pages = {155-225},
  volume = {123},
  year = {2002}
}

@incollection{borhub06a,
  title = {{BDI} agent programming in AgentSpeak using Jason},
  author = {R. Bordini and J. H{\"u}bner},
  booktitle = {Computational logic in multi-agent systems},
  pages = {143-164},
  publisher = springer,
  year = {2006}
}

@article{bossie85,
  title = {Saturation, Nonmonotonic Reasoning and the Closed World Assumption},
  author = {G. Bossu and P. Siegel},
  journal = ai,
  pages = {13-63},
  volume = {25},
  year = {1985}
}

@inproceedings{boutilier89a,
  title = {A Semantical Approach to Stable Inheritance Reasoning},
  author = {C. Boutilier},
  booktitle = ijcai,
  pages = {1134-1139},
  year = {1989}
}

@techreport{boutilier89b,
  title = {On the Semantics of Stable Inheritance Reasoning},
  author = {C. Boutilier},
  institution = {University of Toronto},
  number = {KRR-TR-89-11},
  type = {Technical Report},
  year = {1989}
}

@techreport{boutilier90a,
  title = {Viewing Conditional Logics of Normality as Extensions of the Modal System {S4}},
  author = {C. Boutilier},
  institution = {University of Toronto},
  number = {KRR-TR-90-4},
  type = {Technical Report},
  year = {1990}
}

@inproceedings{boutilier90b,
  title = {Conditional Logics of Normality as Modal Systems},
  author = {C. Boutilier},
  booktitle = {Proceedings of the American Association for Artificial Intelligence Conference},
  pages = {594-599},
  year = {1990}
}

@techreport{boutilier91a,
  title = {Preliminary Report on Inaccessible Worlds and Irrelevance},
  author = {C. Boutilier},
  institution = {University of Toronto},
  number = {KRR-TR-91-1},
  type = {Technical Report},
  year = {1991}
}

@inproceedings{boutilier91b,
  title = {Inaccessible Worlds and Irrelevance: Preliminary Report},
  author = {C. Boutilier},
  booktitle = ijcai,
  year = {1991}
}

@techreport{boutilier91c,
  title = {Default Priorities as Epistemic Entrenchment},
  author = {C. Boutilier},
  institution = {University of Toronto},
  type = {Technical Report},
  year = {1991}
}

@techreport{boutilier91d,
  title = {Belief Revision as a Modally Defined Conditional},
  author = {C. Boutilier},
  institution = {University of Toronto},
  type = {Technical Report},
  year = {1991}
}

@phdthesis{boutilier91e,
  title = {Conditional Logics for Default Reasoning and Belief Revision},
  author = {C. Boutilier},
  school = {University of Toronto},
  year = {1991}
}

@inproceedings{boutilier92a,
  title = {What is a Default Priority?},
  author = {C. Boutilier},
  editor = {J. Glasgow and B. Hadley},
  booktitle = {Proceedings of the Canadian Artificial Intelligence Conference},
  pages = {148-155},
  publisher = m-k,
  year = {1992}
}

@book{bowen79,
  title = {Model Theory for Modal Logics},
  author = {K. Bowen},
  publisher = {Reidel},
  series = {Synthese Library},
  year = {1979}
}

@article{boyogeissc18a,
  title = {High-Level Synthesis of On-Chip Multiprocessor Architectures Based on Answer Set Programming},
  author = {C. Bobda and F. Yonga and M. Gebser and H. Ishebabi and T. Schaub},
  journal = {Journal of Parallel and Distributed Computing},
  pages = {161-179},
  volume = {117},
  year = {2018}
}

@inproceedings{bozpea15a,
  title = {On the Complexity of Temporal Equilibrium Logic},
  author = {L. Bozzelli and D. Pearce},
  crossref = {lics15},
  pages = {645-656}
}

@inproceedings{bozpea16a,
  title = {On the Expressiveness of Temporal Equilibrium Logic},
  author = {L. Bozzelli and D. Pearce},
  crossref = {jelia16},
  pages = {159-173}
}

@article{bradix99a,
  title = {Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation},
  author = {S. Brass and J. Dix},
  journal = jlp,
  number = {1},
  pages = {1-46},
  volume = {40},
  year = {1999}
}

@inproceedings{bradom08a,
  title = {From One to Many: Planning for Loosely Coupled Multi-Agent Systems},
  author = {R. Brafman and C. Domshlak},
  crossref = {icaps08},
  pages = {28-35}
}

@article{brafman04a,
  title = {A simplifier for propositional formulas with many binary clauses},
  author = {R. Brafman},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics},
  number = {1},
  pages = {52-59},
  volume = {34},
  year = {2004}
}

@inproceedings{brahof04a,
  title = {Conformant Planning via Heuristic Forward Search: {A} New Approach},
  author = {R. Brafman and J. Hoffmann},
  crossref = {icaps04},
  pages = {355-364}
}

@article{brasch85,
  title = {An Overview of the {\sc Kl-One} Knowledge Representation System},
  author = {R. Brachman and J. Schmolze},
  journal = cs,
  number = {2},
  pages = {189-192},
  volume = {9},
  year = {1985}
}

@inproceedings{brass91,
  title = {Deduction with Supernormal Defaults},
  author = {S. Brass},
  editor = {G. Brewka and K. Jantke and P. Schmitt},
  booktitle = {Nonmonotonic and Inductive Logic},
  pages = {153-174},
  publisher = springer,
  year = {1991}
}

@inproceedings{brass93,
  title = {On the Semantics of Supernormal Defaults},
  author = {S. Brass},
  editor = {R. Bajcsy},
  booktitle = ijcai,
  pages = {578-583},
  publisher = m-k,
  year = {1993}
}

@inproceedings{bravos05a,
  title = {Debugging Logic Programs under the Answer Set Semantics.},
  author = {M. Brain and M. {D}e Vos},
  crossref = {asp05},
  pages = {141-152}
}

@article{bravos09a,
  title = {The Significance of Memory Costs in Answer Set Solver Implementation},
  author = {M. Brain and M. {D}e Vos},
  journal = jlc,
  number = {4},
  pages = {615-641},
  volume = {19},
  year = {2009}
}

@inproceedings{brbebe02a,
  title = {Qualitative Choice Logic},
  author = {G. Brewka and S. Benferhat and D. {L}e Berre},
  crossref = {kr02},
  pages = {158-169}
}

@article{brblbocapojalaradeve15a,
  title = {Predicate Logic as a Modeling Language: Modeling and Solving Some Machine Learning and Data Mining Problems With {IDP}3},
  author = {M. Bruynooghe and H. Blockeel and B. Bogaerts and B. {D}e Cat and S. {D}e Pooter and J. Jansen and A. Labarre and J. Ramon and M. Denecker and S. Verwer},
  journal = tplp,
  number = {6},
  pages = {783-817},
  volume = {15},
  year = {2015}
}

@inproceedings{brbodede13a,
  title = {Model Expansion in the Presence of Function Symbols Using Constraint Programming},
  author = {B. {D}e Cat and B. Bogaerts and J. Devriendt and M. Denecker},
  crossref = {ictai13},
  pages = {1068-1075}
}

@inproceedings{brclvo09a,
  title = {A Pragmatic Programmer's Guide to Answer Set Programming},
  author = {M. Brain and O. Cliffe and M. {D}e Vos},
  crossref = {sea09},
  pages = {49-63}
}

@inproceedings{brcrvofi06a,
  title = {{TOAST}: Applying Answer Set Programming to Superoptimisation},
  author = {M. Brain and T. Crick and M. {D}e Vos and J. Fitch},
  crossref = {iclp06},
  pages = {270-284}
}

@inproceedings{brderosc14a,
  title = {{A}re Preferences Giving You a Headache? --- {T}ake asprin!},
  author = {G. Brewka and J. Delgrande and J. Romero and T. Schaub},
  crossref = {aspocp14}
}

@inproceedings{brderosc15a,
  title = {asprin: Customizing Answer Set Preferences without a Headache},
  author = {G. Brewka and J. Delgrande and J. Romero and T. Schaub},
  crossref = {aaai15},
  pages = {1467-1474},
  url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9535}
}

@inproceedings{brderosc15b,
  title = {Implementing Preferences with asprin},
  author = {G. Brewka and J. Delgrande and J. Romero and T. Schaub},
  crossref = {lpnmr15},
  pages = {158-172}
}

@article{brderosc22a,
  title = {A general framework for preferences in answer set programming},
  author = {G. Brewka and J. Delgrande and J. Romero and T. Schaub},
  journal = ai,
  pages = {104023},
  volume = {325},
  year = {2023}
}

@article{brdetr16a,
  title = {{ASP} with First-Order Logic and Definitions},
  author = {M. Bruynooghe and M. Denecker and M. Truszczy{\'n}ski},
  journal = aim,
  number = {3},
  pages = {69-80},
  volume = {37},
  year = {2016}
}

@article{brdifrzu01a,
  title = {Transformation-Based Bottom-Up Computation of the Well-Founded Model},
  author = {S. Brass and J. Dix and B. Freitag and U. Zukowski},
  journal = tplp,
  number = {5},
  pages = {497-538},
  volume = {1},
  year = {2001}
}

@article{brdiheliwo20a,
  title = {Solving Advanced Argumentation Problems with Answer Set Programming},
  author = {G. Brewka and M. Diller and G. Heissenberger and T. Linsbichler and S. Woltran},
  journal = tplp,
  number = {3},
  pages = {391-431},
  volume = {20},
  year = {2020}
}

@book{brdiko93,
  title = {Nonmonotonic Reasoning: An Overview},
  author = {G. Brewka and J. Dix and K. Konolige},
  publisher = {Dikran},
  series = {CSLI Lecture Notes},
  volume = {73},
  year = {1994}
}

@incollection{bredix05a,
  title = {Knowledge Representation with Logic Programs},
  author = {G. Brewka and J. Dix},
  editor = {D. Gabbay and F. Guenthner},
  booktitle = {Handbook of Philosophical Logic},
  pages = {1-85},
  publisher = springer,
  year = {2005}
}

@inproceedings{breeit07a,
  title = {Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems},
  author = {G. Brewka and T. Eiter},
  crossref = {aaai07},
  pages = {385-390}
}

@inproceedings{breeit09a,
  title = {Argumentation Context Systems: A Framework for Abstract Group Argumentation},
  author = {G. Brewka and T. Eiter},
  crossref = {lpnmr09},
  pages = {44-57}
}

@inproceedings{breeit97a,
  title = {Preferred Answer Sets for Extended Logic Programs},
  author = {G. Brewka and T. Eiter},
  crossref = {kr98},
  pages = {86-97}
}

@incollection{breeit98a,
  title = {Prioritizing Default Logic},
  author = {G. Brewka and T. Eiter},
  editor = {S. H{\"o}lldobler},
  booktitle = {Intellectics and Computational Logic --- Papers in Honour of {W}olfgang {B}ibel},
  pages = {27-45},
  publisher = kluwer,
  year = {2000}
}

@article{breeit99a,
  title = {Preferred Answer Sets for Extended Logic Programs},
  author = {G. Brewka and T. Eiter},
  journal = ai,
  number = {1-2},
  pages = {297-356},
  volume = {109},
  year = {1999}
}

@inproceedings{bregor10a,
  title = {Carneades and Abstract Dialectical Frameworks: A Reconstruction},
  author = {G. Brewka and T. Gordon},
  crossref = {comma10},
  pages = {3-12}
}

@inproceedings{bregor94a,
  title = {How to Buy a Porsche: An Approach to Defeasible Decision Making},
  author = {G. Brewka and T. Gordon},
  booktitle = {AAAI-94 Workshop on Computational Dialectics},
  year = {1994}
}

@article{bregot97a,
  title = {Well-Founded Semantics for Default Logic,},
  author = {G. Brewka and G. Gottlob},
  journal = {Fundamenta Informaticae},
  number = {3-4},
  pages = {221-236},
  volume = {31},
  year = {1997}
}

@article{breher93a,
  title = {How to do Things with Worlds: On Formalizing Actions and Plans},
  author = {G. Brewka and J. Hertzberg},
  journal = jlc,
  number = {5},
  pages = {517-532},
  volume = {3},
  year = {1993}
}

@incollection{breifi11a,
  title = {Multi-Context Systems: A Flexible Approach for Integrating Heterogeneous Knowledge Sources},
  author = {G. Brewka and T. Eiter and M. Fink},
  crossref = {mg65},
  pages = {233-258}
}

@article{breitr11a,
  title = {Answer set programming at a glance},
  author = {G. Brewka and T. Eiter and M. Truszczy{\'n}ski},
  doi = {10.1145/2043174.2043195},
  journal = cacm,
  number = {12},
  pages = {92-103},
  volume = {54},
  year = {2011}
}

@article{breitr16a,
  title = {Answer Set Programming: An Introduction to the Special Issue},
  author = {G. Brewka and T. Eiter and M. Truszczynski},
  journal = aim,
  number = {3},
  pages = {5-6},
  volume = {37},
  year = {2016}
}

@techreport{brejun90a,
  title = {Aspects of Non-Monotonic Reasoning},
  author = {G. Brewka and U. Junker},
  address = gmd-adr,
  institution = gmd,
  number = {1},
  type = {Tasso-Report},
  year = {1990}
}

@inproceedings{brejun91a,
  title = {Handling Partially Ordered Defaults in {TMS}},
  author = {U. Junker and G. Brewka},
  editor = {R. Kruse and P. Siegel},
  booktitle = {Proceedings of the First European Conference on Symbolic and Quantitative Aspects for Uncertainty},
  pages = {211-218},
  publisher = springer,
  year = {1991}
}

@article{breneb09a,
  title = {Continual planning and acting in dynamic multiagent environments},
  author = {M. Brenner and B. Nebel},
  journal = {Autonomous Agents and Multi-Agent Systems},
  number = {3},
  pages = {297-331},
  volume = {19},
  year = {2009}
}

@incollection{brenner03a,
  title = {A Multiagent Planning Language},
  author = {M. Brenner},
  booktitle = {Proceedings of the Workshop on PDDL},
  pages = {33-38},
  year = {2003}
}

@article{brerermiri07a,
  title = {Inferring Phylogenetic Trees Using Answer Set Programming},
  author = {D. Brooks and E. Erdem and S. Erdogan and J. Minett and D. Ringe},
  journal = jar,
  number = {4},
  pages = {471-511},
  volume = {39},
  year = {2007}
}

@inproceedings{brermiri05,
  title = {Character-Based Cladistics and Answer Set Programming},
  author = {D. Brooks and E. Erdem and J. Minett and D. Ringe},
  editor = {M. Hermenegildo and D. Cabeza},
  booktitle = {Proceedings of the Seventh International Symposium on Practical Aspects of Declarative Languages (PADL'05)},
  pages = {37-51},
  publisher = springer,
  series = lncs,
  volume = {3350},
  year = {2005}
}

@incollection{bresch93a,
  title = {{Z}ur {V}erwendung nichtmonotoner {I}nferenztechniken bei der {K}onfiguration},
  author = {G. Brewka and T. Schaub},
  editor = {F. di Primio},
  booktitle = {Methoden der K{\"u}nstlichen Intelligenz f{\"u}r Grafikanwendungen},
  chapter = {3},
  note = {In German.},
  pages = {45-60},
  publisher = addison,
  year = {1995}
}

@techreport{brewit84,
  title = {{N}ichtmonotone {L}ogiken},
  author = {G. Brewka and K. Wittur},
  institution = {Universit{\"a}t Bonn},
  number = {40},
  type = {Informatik Berichte},
  year = {1984}
}

@inproceedings{brewka01a,
  title = {On the Relation Between Defeasible Logic and Well-Founded Semantics},
  author = {G. Brewka},
  crossref = {lpnmr01},
  year = {2001}
}

@article{brewka01b,
  title = {Dynamic Argument Systems: A Formal Model of Argumentation Processes Based on Situation Calculus},
  author = {G. Brewka},
  journal = jlc,
  number = {2},
  pages = {257-282},
  volume = {11},
  year = {2001}
}

@inproceedings{brewka02a,
  title = {Logic Programming with Ordered Disjunction},
  author = {G. Brewka},
  crossref = {aaai02},
  pages = {100-105}
}

@inproceedings{brewka04a,
  title = {A Rank Based Description Language for Qualitative Preferences.},
  author = {G. Brewka},
  booktitle = {Proceedings of the 16th European Conference on Artificial Intelligence (ECAI'04)},
  pages = {303-307},
  publisher = ios,
  year = {2004}
}

@inproceedings{brewka04b,
  title = {Answer Sets: From Constraint Programming Towards Qualitative Optimization},
  author = {G. Brewka},
  crossref = {lpnmr04},
  pages = {34-46}
}

@inproceedings{brewka04c,
  title = {Complex Preferences for Answer Set Optimization},
  author = {G. Brewka},
  crossref = {kr04},
  pages = {213-223}
}

@article{brewka05a,
  title = {Answer Sets and Qualitative Decision Making},
  author = {G. Brewka},
  journal = {Synthese},
  pages = {171-181},
  volume = {146},
  year = {2005}
}

@article{brewka06a,
  title = {Answer Sets and Qualitative Optimization},
  author = {G. Brewka},
  journal = {Logic Journal of the {IGPL}},
  number = {3},
  pages = {413-433},
  volume = {14},
  year = {2006}
}

@inproceedings{brewka86,
  title = {Tweety --- Still Flying: Some Remarks on Abnormal Birds, Applicable Rules and a Default Prover},
  author = {G. Brewka},
  booktitle = aaai,
  year = {1986}
}

@inproceedings{brewka87a,
  title = {Nichtmonotone Logiken: Ein einf{\"u}hrender {{\"u}}berblick},
  author = {G. Brewka},
  booktitle = {KIFS-87},
  pages = {188-217},
  publisher = springer,
  year = {1987}
}

@inproceedings{brewka87b,
  title = {The Logic of Inheritance in Frame Systems},
  author = {G. Brewka},
  booktitle = ijcai,
  year = {1987}
}

@phdthesis{brewka89a,
  title = {Nonmonotonic Reasoning: From Theoretical Foundation to Efficient Computation},
  author = {G. Brewka},
  note = {Revised Version appeared as: Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990.},
  school = {Universit{\"a}t Hamburg},
  year = {1989}
}

@article{brewka89b,
  title = {Nichtmonotone Logiken: Ein kurzer {\"u}berblick},
  author = {G. Brewka},
  journal = {K{\"u}nstliche Intelligenz},
  pages = {5-12},
  volume = {2},
  year = {1989}
}

@inproceedings{brewka89c,
  title = {Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules},
  author = {G. Brewka},
  booktitle = {Proceedings of the First German Workshop on Nonmonotonic Reasoning},
  year = {1989}
}

@article{brewka89d,
  title = {Nonmonotonic Logics --- A Brief Overview},
  author = {G. Brewka},
  journal = aicom,
  number = {2},
  pages = {88-97},
  volume = {2},
  year = {1989}
}

@inproceedings{brewka89e,
  title = {Preferred Subtheories: An Extended Logical Framework for Default Reasoning},
  author = {G. Brewka},
  booktitle = ijcai,
  pages = {1043-1048},
  year = {1989}
}

@book{brewka91a,
  title = {Nonmonotonic Reasoning: Logical Foundations of Commonsense},
  author = {G. Brewka},
  publisher = cup,
  year = {1991}
}

@article{brewka91b,
  title = {Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules},
  author = {G. Brewka},
  journal = ai,
  number = {2},
  pages = {183-205},
  volume = {50},
  year = {1991}
}

@inproceedings{brewka91c,
  title = {Assertional Default Theories},
  author = {G. Brewka},
  editor = {R. Kruse},
  booktitle = {Proceedings of European Conference on Symbolic and Quantitative Approaches to Uncertainty},
  pages = {120-124},
  publisher = springer,
  year = {1991}
}

@misc{brewka91d,
  title = {Defaults as first Class Citizens: Yet Another Framework for Default Reasoning},
  author = {G. Brewka},
  howpublished = {manuscript},
  year = {1991}
}

@techreport{brewka92a,
  title = {Exploiting Dependency Information in Nonmonotonic Reasoning: A Framework for Cumulative Default Logics},
  author = {G. Brewka},
  institution = icsi,
  year = {1992}
}

@misc{brewka93a,
  title = {Specificity in Default Logic and its Application to Obligation},
  author = {G. Brewka},
  howpublished = {Manuscript},
  year = {1993}
}

@inproceedings{brewka94a,
  title = {Adding Priorities and Specificity to Default Logic},
  author = {G. Brewka},
  editor = {L. Pereira and D. Pearce},
  booktitle = {European Workshop on Logics in Artificial Intelligence (JELIA'94)},
  pages = {247-260},
  publisher = springer,
  series = lnai,
  year = {1994}
}

@inproceedings{brewka94b,
  title = {A Reconstruction of Rescher's Theory of Formal Disputation based on Default Logic},
  author = {G. Brewka},
  editor = {A. Cohn},
  booktitle = ecai,
  pages = {366-370},
  publisher = wiley,
  year = {1994}
}

@inproceedings{brewka94c,
  title = {Reasoning about Priorities in Default Logic},
  author = {G. Brewka},
  booktitle = aaai,
  pages = {940-945},
  publisher = aaaimit,
  volume = {2},
  year = {1994}
}

@article{brewka96a,
  title = {Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences},
  author = {G. Brewka},
  journal = jair,
  pages = {19-36},
  volume = {4},
  year = {1996}
}

@inproceedings{brewol10a,
  title = {Abstract Dialectical Frameworks},
  author = {G. Brewka and S. Woltran},
  crossref = {kr10}
}

@inproceedings{brfaba16a,
  title = {Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments},
  author = {C. Brenton and W. Faber and S. Batsakis},
  crossref = {iclp-lipics16},
  pages = {4:1-4:15}
}

@inproceedings{brfale08a,
  title = {Normal Form Nested Programs},
  author = {A. Bria and W. Faber and N. Leone},
  crossref = {jelia08},
  pages = {76-88}
}

@inproceedings{brfamaposcsc07a,
  title = {What should an {ASP} Solver output? {A} Multiple Position Paper},
  author = {M. Brain and W. Faber and M. Maratea and A. Polleres and T. Schaub and R. Schindlauer},
  crossref = {sea07},
  pages = {26-37}
}

@inproceedings{brfile83,
  title = {{\sc Krypton}: Integrating Terminology and Assertion},
  author = {R. Brachman and R. Fikes and H. Levesque},
  booktitle = aaai,
  pages = {31-35},
  publisher = aaaimit,
  year = {1983}
}

@inproceedings{brgepusctowo07a,
  title = {Debugging {ASP} Programs by Means of {ASP}},
  author = {M. Brain and M. Gebser and J. P{\"u}hrer and T. Schaub and H. Tompits and S. Woltran},
  crossref = {lpnmr07},
  pages = {31-43}
}

@inproceedings{brgepusctowo07b,
  title = {That is Illogical Captain! --- The Debugging Support Tool spock for Answer-Set Programs: System Description},
  author = {M. Brain and M. Gebser and J. P{\"u}hrer and T. Schaub and H. Tompits and S. Woltran},
  crossref = {sea07},
  pages = {71-85}
}

@inproceedings{brgfuj85a,
  title = {A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran},
  author = {F. Brglez and H. Fujiwara},
  booktitle = {Proceedings of IEEE Int'l Symposium Circuits and Systems (ISCAS 85)},
  pages = {677-692},
  publisher = ieee,
  year = {1985}
}

@inproceedings{brgile85,
  title = {An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of {\sc Krypton}},
  author = {R. Brachman and V. Gilbert and H. Levesque},
  booktitle = ijcai,
  year = {1985}
}

@inproceedings{bricos99,
  title = {Characterizing and computing stable models of logic programs: the non-stratified case},
  author = {G. Brignoli and S. Costantini and O. D'Antona and A. Provetti},
  editor = {C. Baral and H. Mohanty},
  booktitle = {Proceedings of the Conference on Information Technology, Bhubaneswar, India},
  pages = {197-201},
  publisher = {{AAAI} Press},
  year = {1999}
}

@inproceedings{brjokrsc15a,
  title = {Safety Verification and Refutation by k-Invariants and k-Induction},
  author = {M. Brain and S. Joshi and D. Kroening and P. Schrammel},
  booktitle = {Static Analysis Symposium (SAS'15)},
  pages = {145-161},
  publisher = springer,
  series = lncs,
  volume = {9291},
  year = {2015}
}

@article{brkaryxiza18a,
  title = {Querying Log Data with Metric Temporal Logic},
  author = {S. Brandt and E. Kalayci and V. Ryzhikov and G. Xiao and M. Zakharyaschev},
  journal = jair,
  pages = {829-877},
  volume = {62},
  year = {2018}
}

@article{brkasm06a,
  title = {Planning Graph Heuristics for Belief Space Search},
  author = {D. Bryce and S. Kambhampati and D. Smith},
  journal = jair,
  pages = {35-99},
  volume = {26},
  year = {2006}
}

@inproceedings{brmasc91,
  title = {{JTMS} and Logic Programming},
  author = {G. Brewka and D. Makinson and K. Schlechta},
  editor = {V. Marek and A. Nerode and V. Subrahmanian},
  booktitle = {Proceedings of the First International Workshop on Logic Programming and Nonmonotonic Reasoning},
  pages = {199-210},
  publisher = {MIT Press},
  year = {1991}
}

@inproceedings{brnisy02a,
  title = {Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs.},
  author = {G. Brewka and I. Niemel{\"a} and T. Syrj{\"a}nen},
  crossref = {jelia02},
  pages = {444-455}
}

@article{brnisy04a,
  title = {Logic Programs with Ordered Disjunction},
  author = {G. Brewka and I. Niemel{\"a} and T. Syrj{\"a}nen},
  journal = ci,
  number = {2},
  pages = {335-357},
  volume = {20},
  year = {2004}
}

@inproceedings{brnitr03a,
  title = {Answer Set Optimization},
  author = {G. Brewka and I. Niemel{\"a} and M. Truszczy{\'n}ski},
  crossref = {ijcai03},
  pages = {867-872}
}

@inproceedings{brnitr05a,
  title = {Prioritized Component Systems},
  author = {G. Brewka and I. Niemel{\"a} and M. Truszczy{\'n}ski},
  crossref = {aaai05},
  pages = {596-601}
}

@incollection{brnitr08a,
  title = {Nonmonotonic Reasoning},
  author = {G. Brewka and I. Niemel{\"a} and M. Truszczy{\'n}ski},
  chapter = {6},
  crossref = {KRHandbook},
  pages = {239-284}
}

@article{brooks91a,
  title = {Intelligence without Representation},
  author = {R. Brooks},
  journal = ai,
  number = {1-3},
  pages = {139-159},
  volume = {47},
  year = {1991}
}

@inproceedings{brosho89,
  title = {New Results on Semantical Non-Monotonic Reasoning},
  author = {A. Brown and Y. Shoham},
  editor = {M. Reinfrank and J. de Kleer and M. Ginsberg and E. Sandewall},
  booktitle = {Proceedings of the Second International Workshop on Non-Monotonic Reasoning},
  pages = {19-26},
  publisher = springer,
  series = lnai,
  volume = {346},
  year = {1989}
}

@article{brpepova10a,
  title = {A semantical framework for hybrid knowledge bases},
  author = {J. de Bruijn and D. Pearce and A. Polleres and A. Valverde},
  journal = {Knowledge Information Systems},
  number = {1},
  pages = {81-104},
  volume = {25},
  year = {2010}
}

@inproceedings{brrose07a,
  title = {Contextual Default Reasoning},
  author = {G. Brewka and F. Roelofsen and L. Serafini},
  crossref = {ijcai07},
  pages = {268-273}
}

@inproceedings{brsawi14,
  title = {Qualitative Simulation with Answer Set Programming},
  author = {I. Bratko and C. Sammut and T. Wiley},
  crossref = {ecai14},
  pages = {915-920}
}

@techreport{brscni97b,
  title = {Prolog technology for default reasoning: Implementation and the {{\sf XRay}} system},
  author = {S. Br{\"u}ning and T. Linke and P. Nicolas and T. Schaub},
  institution = {Institute of Informatics, University of Potsdam},
  note = {(This is an extended version of \cite{nicsch98}.) Full version in preparation.},
  year = {1998}
}

@inproceedings{brtrwo10a,
  title = {Representing Preferences Among Sets},
  author = {G. Brewka and M. Truszczy{\'n}ski and S. Woltran},
  crossref = {aaai10},
  pages = {273-278}
}

@book{brucker07,
  title = {Scheduling Algorithms},
  author = {P. Brucker},
  publisher = springer,
  year = {2007}
}

@article{brusch90a,
  title = {Job-shop Scheduling with Multi-purpose Machines},
  author = {P. Brucker and R. Schlie},
  journal = {Computing},
  number = {4},
  pages = {369-375},
  volume = {45},
  year = {1990}
}

@inproceedings{brusch93,
  title = {Using classical theorem-proving techniques for approximate reasoning},
  author = {S. Br{\"u}ning and T. Schaub},
  editor = {B. Bouchon-Meunier and R. Yager},
  booktitle = {Proceedings of the Fifth International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems},
  pages = {493-498},
  publisher = {IPMU},
  volume = {1},
  year = {1994}
}

@inproceedings{brusch95a,
  title = {Using classical theorem-proving techniques for approximate reasoning: A Revised Report},
  author = {S. Br{\"u}ning and T. Schaub},
  editor = {B. Bouchon-Meunier and R. Yager and L. Zadeh},
  booktitle = {Advances in Intelligent Computing},
  pages = {389-398},
  publisher = springer,
  year = {1995}
}

@inproceedings{brusch96a,
  title = {A model-based approach to consistency-checking},
  author = {S. Br{\"u}ning and T. Schaub},
  editor = {Z. Ras and M. Michalewicz},
  booktitle = {Proceedings of the Ninth International Symposium on Methodologies for Intelligent Systems},
  pages = {315-324},
  publisher = springer,
  series = lnai,
  volume = {1079},
  year = {1996}
}

@techreport{brusch97a,
  title = {Prolog technology for default reasoning: Proof theory and compilation techniques},
  author = {S. Br{\"u}ning and T. Schaub},
  institution = {LERIA},
  year = {1997}
}

@techreport{brusch98a,
  title = {Default Model Elimination: A Connection Tableau based approach for handling Incomplete Information},
  author = {S. Br{\"u}ning and T. Schaub},
  institution = uofp,
  year = {1998}
}

@article{brusch98b,
  title = {Prolog technology for default reasoning: Proof theory and compilation techniques},
  author = {S. Br{\"u}ning and T. Schaub},
  journal = ai,
  number = {1},
  pages = {1-75},
  volume = {106},
  year = {1998}
}

@inproceedings{brusch99a,
  title = {Avoiding non-ground variables},
  author = {S. Br{\"u}ning and T. Schaub},
  editor = {A. Hunter and S. Parsons},
  booktitle = {Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty},
  pages = {92-103},
  publisher = springer,
  series = lnai,
  volume = {1638},
  year = {1999}
}

@incollection{brusch99b,
  title = {A Connection Calculus for handling Incomplete Information},
  author = {S. Br{\"u}ning and T. Schaub},
  editor = {S. H{\"o}lldobler},
  booktitle = {Intellectics and Computational Logic --- Papers in Honor of {W}olfgang {B}ibel},
  pages = {47-66},
  publisher = kluwer,
  year = {2000}
}

@article{bryant92a,
  title = {Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams},
  author = {R. Bryant},
  journal = acmcs,
  number = {3},
  pages = {293-318},
  volume = {24},
  year = {1992}
}

@inproceedings{brzoska91a,
  title = {Temporal Logic Programming and its Relation to Constraint Logic Programming},
  author = {C. Brzoska},
  crossref = {slp91},
  pages = {661-677}
}

@inproceedings{brzoska93a,
  title = {Temporal Logic Programming with Metric and Past Operators},
  author = {C. Brzoska},
  crossref = {fisowe93a},
  pages = {21-39}
}

@inproceedings{brzoska93b,
  title = {Temporal Logic Programming with Bounded Universal Modality Goals},
  author = {C. Brzoska},
  crossref = {iclp93},
  pages = {239-256}
}

@inproceedings{brzoska95a,
  title = {Temporal Logic Programming in Dense Time},
  author = {C. Brzoska},
  crossref = {slp95},
  pages = {303-317}
}

@article{brzoska98a,
  title = {Programming in Metric Temporal Logic},
  author = {C. Brzoska},
  journal = tcs,
  number = {1-2},
  pages = {55-125},
  volume = {202},
  year = {1998}
}

@inproceedings{budlie15a,
  title = {Performance Tuning in Answer Set Programming},
  author = {M. Buddenhagen and Y. Lierler},
  crossref = {lpnmr15},
  year = {2015}
}

@article{buechi60a,
  title = {Weak Second-Order Arithmetic and Finite Automata},
  author = {J. B{\"u}chi},
  journal = {Zeitschrift f{\"u}r mathematische Logik und Grundlagen der Mathematik},
  number = {1-6},
  pages = {66-92},
  volume = {6},
  year = {1960}
}

@inproceedings{buechi62a,
  title = {On a Decision Method in Restricted Second Order Arithmetic},
  author = {J. B{\"u}chi},
  editor = {E. Nagel and P. Suppes and A. Tarski},
  booktitle = {Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science},
  pages = {1-11},
  publisher = {Stanford University Press},
  year = {1962}
}

@incollection{buechi90a,
  title = {On a decision method in restricted second order arithmetic},
  author = {R. B{\"u}chi},
  booktitle = {The Collected Works of J. Richard B{\"u}chi},
  pages = {425-435},
  publisher = springer,
  year = {1990}
}

@article{bufadopo20a,
  title = {Modelling Multi-Agent Epistemic Planning in {ASP}},
  author = {A. Burigana and F. Fabiano and A. Dovier and E. Pontelli},
  journal = tplp,
  number = {5},
  pages = {593-608},
  volume = {20},
  year = {2020}
}

@article{bufale02a,
  title = {Disjunctive Logic Programs with Inheritance},
  author = {F. Buccafurri and W. Faber and N. Leone},
  journal = tplp,
  number = {3},
  pages = {293-321},
  volume = {2},
  year = {2002}
}

@inproceedings{bufale99a,
  title = {Disjunctive Logic Programs with Inheritance},
  author = {F. Buccafurri and W. Faber and N. Leone},
  booktitle = iclp,
  pages = {79-93},
  publisher = {MIT Press},
  year = {1999}
}

@inproceedings{bulera05ricochet,
  title = {Ricochet {R}obots --- A Case Study for Human Complex Problem Solving},
  author = {N. Butko and K. Lehmann and V. Ramenzoni},
  booktitle = {Proceedings of the Annual Santa Fe Institute Summer School on Complex Systems (CSSS'05)},
  year = {2005}
}

@article{bylander94a,
  title = {The Computational Complexity of Propositional {STRIPS} Planning},
  author = {T. Bylander},
  journal = ai,
  number = {1-2},
  pages = {165-204},
  volume = {69},
  year = {1994}
}

@inproceedings{cabalar01a,
  title = {Well Founded Semantics as Two-dimensional Here-and-There},
  author = {P. Cabalar},
  crossref = {asp01},
  pages = {15-20}
}

@inproceedings{cabalar08a,
  title = {Partial Functions and Equality in Answer Set Programming},
  author = {P. Cabalar},
  crossref = {iclp08},
  pages = {392-406}
}

@inproceedings{cabalar10a,
  title = {A Normal Form for Linear Temporal Equilibrium Logic},
  author = {P. Cabalar},
  crossref = {jelia10},
  pages = {64-76}
}

@article{cabalar11a,
  title = {Functional answer set programming},
  author = {P. Cabalar},
  doi = {10.1017/S1471068410000517},
  journal = tplp,
  number = {2-3},
  pages = {203-233},
  volume = {11},
  year = {2011}
}

@inproceedings{cabalar99a,
  title = {Temporal Answer Sets},
  author = {P. Cabalar},
  editor = {M. Meo and M. Ferro},
  booktitle = {Proceedings of the Joint Conference on Declarative Programming (AGP'99)},
  pages = {351-366},
  year = {1999}
}

@inproceedings{cabamumc18a,
  title = {Finite {LTL} Synthesis as Planning},
  author = {A. Camacho and J. Baier and C. Muise and S. McIlraith},
  crossref = {icaps18},
  pages = {29-38}
}

@inproceedings{cabdem11a,
  title = {Automata-based Computation of Temporal Equilibrium Models},
  author = {P. Cabalar and S. Demri},
  editor = {G. Vidal},
  booktitle = {Proceedings of the Twenty-first International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'11)},
  pages = {57-72},
  publisher = springer,
  series = lncs,
  volume = {7225},
  year = {2011}
}

@inproceedings{cabdie11a,
  title = {{STELP} --- a Tool for Temporal Answer Set Programming},
  author = {P. Cabalar and M. Di{\'e}guez},
  crossref = {lpnmr11},
  pages = {370-375}
}

@inproceedings{cabdie14a,
  title = {Strong Equivalence of Non-Monotonic Temporal Theories},
  author = {P. Cabalar and M. Di{\'e}guez},
  crossref = {kr14}
}

@inproceedings{cabemc19a,
  title = {Towards a Unified View of {AI} Planning and Reactive Synthesis},
  author = {A. Camacho and M. Bienvenu and S. McIlraith},
  crossref = {icaps19},
  pages = {58-67}
}

@article{cabfer08a,
  title = {Propositional theories are strongly equivalent to logic programs},
  author = {P. Cabalar and P. Ferraris},
  journal = tplp,
  number = {6},
  pages = {745-759},
  volume = {7},
  year = {2007}
}

@inproceedings{cabper07a,
  title = {Temporal Equilibrium Logic: {A} First Approach},
  author = {P. Cabalar and G. {P{\'e}rez Vega}},
  editor = {R. Moreno-D{\'\i}az and F. Pichler and A. Quesada-Arencibia},
  booktitle = {Proceedings of the Eleventh International Conference on Computer Aided Systems Theory (EUROCAST'17)},
  pages = {241-248},
  publisher = springer,
  series = lncs,
  volume = {4739},
  year = {2007}
}

@inproceedings{cabsch19a,
  title = {Temporal Logic Programs with Temporal Description Logic Axioms},
  author = {P. Cabalar and T. Schaub},
  crossref = {baader60},
  pages = {174-186}
}

@inproceedings{cabsch19b,
  title = {Dynamic and Temporal Answer Set Programming on Linear Finite Traces},
  author = {P. Cabalar and T. Schaub},
  crossref = {datalog19},
  pages = {3-6}
}

@inproceedings{cabveg07a,
  title = {Temporal Equilibrium Logic: {A} First Approach},
  author = {P. Cabalar and G. {P{\'e}rez Vega}},
  editor = {R. Moreno-D{\'\i}az and F. Pichler and A. Quesada-Arencibia},
  booktitle = {Revised Selected Papers of the Eleventh International Conference on Computer Aided Systems Theory (EUROCAST'07)},
  pages = {241-248},
  publisher = springer,
  series = lncs,
  volume = {4739},
  year = {2007}
}

@inproceedings{cacacale96a,
  title = {Using the {D}avis and {P}utnam Procedure for an Efficient Computation of Preferred Models},
  author = {T. Castell and C. Cayrol and M. Cayrol and D. {L}e Berre},
  crossref = {ecai96},
  pages = {350-354}
}

@inproceedings{cacacofrpoqu08a,
  title = {Intelligent adaptive monitoring for cardiac surveillance},
  author = {L. Callens and G. Carrault and M. Cordier and {\'E}. Fromont and F. Portet and R. Quiniou},
  crossref = {ecai08},
  pages = {653-657}
}

@article{cacadu21a,
  title = {Semi-stable semantics},
  author = {M. Caminada and W. Carnielli and P. Dunne},
  journal = jlc,
  number = {5},
  pages = {1207-1254},
  volume = {22},
  year = {2012}
}

@inproceedings{cacechcolesesttazd02a,
  title = {Monitoring Streams - A New Class of Data Management Applications},
  author = {D. Carney and U. {\c{C}}etintemel and M. Cherniack and C. Convey and S. Lee and G. Seidman and M. Stonebraker and N. Tatbul and S. Zdonik},
  crossref = {vldb02},
  pages = {215-226}
}

@article{cacoia07a,
  title = {External Sources of Knowledge and Value Invention in Logic Programming},
  author = {F. Calimeri and S. Cozza and G. Ianni},
  journal = amai,
  number = {3-4},
  pages = {333-361},
  volume = {50},
  year = {2007}
}

@inproceedings{cacoiale08a,
  title = {Computable Functions in {ASP}: Theory and Implementation},
  author = {F. Calimeri and S. Cozza and G. Ianni and N. Leone},
  crossref = {iclp08},
  pages = {407-424}
}

@article{cadebrsr15a,
  title = {Lazy Model Expansion: Interleaving Grounding with Search},
  author = {B. {D}e Cat and M. Denecker and M. Bruynooghe and P. Stuckey},
  journal = jair,
  pages = {235-286},
  volume = {52},
  year = {2015}
}

@inproceedings{cadest12a,
  title = {Lazy Model Expansion by Incremental Grounding},
  author = {B. {D}e Cat and M. Denecker and P. Stuckey},
  crossref = {iclp-lipics12},
  pages = {201-211}
}

@inproceedings{cadihasc21a,
  title = {Automata for Dynamic Answer Set Solving: Preliminary Report},
  author = {P. Cabalar and M. Di{\'e}guez and S. Hahn and T. Schaub},
  crossref = {aspocp21},
  url = {http://ceur-ws.org/Vol-2970/aspocpinvited1.pdf}
}

@inproceedings{cadilasc20a,
  title = {Implementing Dynamic Answer Set Programming over finite traces},
  author = {P. Cabalar and M. Di{\'e}guez and F. Laferriere and T. Schaub},
  crossref = {ecai20},
  doi = {10.3233/FAIA200151},
  pages = {656-663}
}

@inproceedings{cadilasc23a,
  title = {Past-Present Temporal Programs over Finite Traces},
  author = {P. Cabalar and M. Di{\'e}guez and F. Laferri{\`{e}}re and T. Schaub},
  crossref = {jelia23},
  pages = {787-795}
}

@inproceedings{cadilascst24a,
  title = {A Fixpoint Characterisation of Temporal Equilibrium Logic},
  author = {P. Cabalar and M. Di{\'e}guez and F. Laferriere and T. Schaub and I. St{\'e}phan},
  crossref = {lpnmr24},
  note = {To appear},
  optdoi = {},
  optpages = {}
}

@inproceedings{cadisc19a,
  title = {Towards Dynamic Answer Set Programming over finite traces},
  author = {P. Cabalar and M. Di{\'e}guez and T. Schaub},
  crossref = {lpnmr19},
  doi = {10.1007/978-3-030-20528-7\_12},
  pages = {148-162}
}

@article{cadiscsc20a,
  title = {Towards Metric Temporal Answer Set Programming},
  author = {P. Cabalar and M. Di{\'e}guez and T. Schaub and A. Schuhmann},
  journal = tplp,
  number = {5},
  pages = {783-798},
  volume = {20},
  year = {2020}
}

@inproceedings{cadiscsc21a,
  title = {Metric Temporal Answer Set Programming over Timed Traces (extended abstract)},
  author = {P. Cabalar and M. Di{\'e}guez and T. Schaub and A. Schuhmann},
  booktitle = {Stream Reasoning Workshop},
  year = {2021}
}

@inproceedings{cadiscsc22a,
  title = {Metric Temporal Answer Set Programming over Timed Traces},
  author = {P. Cabalar and M. Di{\'e}guez and T. Schaub and A. Schuhmann},
  crossref = {lpnmr22},
  doi = {10.1007/978-3-031-15707-3\_10},
  pages = {117-130}
}

@article{cadivi15a,
  title = {An infinitary encoding of temporal equilibrium logic},
  author = {P. Cabalar and M. Di{\'e}guez and C. Vidal},
  journal = tplp,
  number = {4-5},
  pages = {666-680},
  volume = {15},
  year = {2015}
}

@inproceedings{cadlen90,
  title = {The Complexity of Closed World Reasoning and Circumscription},
  author = {M. Cadoli and M. Lenzerini},
  booktitle = aaai,
  pages = {550-555},
  publisher = aaaimit,
  year = {1990}
}

@article{cadofupeza20a,
  title = {Efficiently Coupling the {I-DLV} Grounder with {ASP} Solvers},
  author = {F. Calimeri and C. Dodaro and D. Fusc{\`a} and S. Perri and J. Zangari},
  journal = tplp,
  number = {2},
  pages = {205-224},
  volume = {20},
  year = {2020}
}

@article{cadoli92a,
  title = {The complexity of model checking for circumscriptive formulae},
  author = {M. Cadoli},
  journal = ipl,
  pages = {113-118},
  volume = {44},
  year = {1992}
}

@inproceedings{cadoli93a,
  title = {Semantical and Computational Aspects of Horn Approximations},
  author = {M. Cadoli},
  booktitle = ijcai,
  pages = {39-45},
  year = {1993}
}

@inproceedings{cadosc94a,
  title = {Is intractability of nonmonotonic reasoning a real drawback},
  author = {M. Cadoli and F. Donini and M. Schaerf},
  booktitle = aaai,
  pages = {946-951},
  publisher = aaaimit,
  year = {1994}
}

@inproceedings{cadosc95a,
  title = {On Compact Representations of Propositional Circumscription},
  author = {M. Cadoli and F. Donini and M. Schaerf},
  booktitle = {Twelfth Symposium on Theoretical Aspects of Computer Science (STACS-95)},
  pages = {205-216},
  year = {1995}
}

@article{cadsch05a,
  title = {Compiling problem specifications into {SAT}},
  author = {M. Cadoli and A. Schaerf},
  journal = ai,
  number = {1-2},
  pages = {89-120},
  volume = {162},
  year = {2005}
}

@article{cadsch93b,
  title = {A Survey on Complexity Results for Non-monotonic Logics},
  author = {M. Cadoli and M. Schaerf},
  journal = jlp,
  volume = {17},
  year = {1993}
}

@article{cadsch96a,
  title = {On the complexity of entailment in propositional multivalued logics},
  author = {M. Cadoli and M. Schaerf},
  journal = amai,
  pages = {29-50},
  volume = {18},
  year = {1996}
}

@inproceedings{caeigo94a,
  title = {Default Logic as a Query Language},
  author = {M. Cadoli and T. Eiter and G. Gottlob},
  crossref = {kr94},
  pages = {99-108}
}

@inproceedings{caerer09a,
  title = {Computing Weighted Solutions in Answer Set Programming},
  author = {D. {\c{C}}akmak and E. Erdem and H. Erdogan},
  crossref = {lpnmr09},
  pages = {416-422}
}

@inproceedings{cafabr20a,
  title = {A System for Explainable Answer Set Programming},
  author = {P. Cabalar and J. Fandinno and B. Mu{\~n}iz},
  crossref = {iclp-tc20},
  doi = {10.4204/EPTCS.325.19},
  pages = {124-136}
}

@inproceedings{cafafa18a,
  title = {Splitting Epistemic Logic Programs},
  author = {P. Cabalar and J. Fandinno and L. {Fari{\~n}as del Cerro}},
  booktitle = {Proceedings of the Seventeenth International Workshop on Non-monotonic Reasoning {(NMR'18)}},
  pages = {81-89},
  year = {2018}
}

@inproceedings{cafafa19a,
  title = {Founded World Views with Autoepistemic Equilibrium Logic},
  author = {P. Cabalar and J. Fandinno and L. {Fari{\~n}as del Cerro}},
  crossref = {lpnmr19},
  pages = {134-147}
}

@inproceedings{cafafa19b,
  title = {Splitting Epistemic Logic Programs},
  author = {P. Cabalar and J. Fandinno and L. {Fari{\~n}as del Cerro}},
  crossref = {lpnmr19},
  pages = {120-133}
}

@article{cafafa20a,
  title = {Autoepistemic Answer Set Programming},
  author = {P. Cabalar and J. Fandinno and L. {Fari{\~n}as del Cerro}},
  journal = ai,
  pages = {103382},
  volume = {289},
  year = {2020}
}

@article{cafafa21a,
  title = {Splitting Epistemic Logic Programs},
  author = {P. Cabalar and J. Fandinno and L. {Fari{\~n}as del Cerro}},
  journal = tplp,
  pages = {296-316},
  volume = {21},
  year = {2021}
}

@article{cafafala21a,
  title = {Valid attacks in argumentation frameworks with recursive attacks},
  author = {C. Cayrol and J. Fandinno and L. {Fari{\~n}as del Cerro} and M. Lagasquie-Schiex},
  journal = amai,
  pages = {1573-7470},
  volume = {89},
  year = {2021}
}

@article{cafafape18a,
  title = {Functional {ASP} with Intensional Sets: Application to {G}elfond-{Z}hang Aggregates},
  author = {P. Cabalar and J. Fandinno and L. {Fari{\~n}as del Cerro} and D. Pearce},
  doi = {10.1017/S1471068418000169},
  journal = tplp,
  number = {3-4},
  pages = {390-405},
  volume = {18},
  year = {2018}
}

@article{cafagarosc20a,
  title = {eclingo: A solver for Epistemic Logic Programs},
  author = {P. Cabalar and J. Fandinno and J. Garea and J. Romero and T. Schaub},
  journal = tplp,
  note = {\url{https://github.com/potassco/eclingo}},
  number = {5},
  pages = {834-847},
  volume = {20},
  year = {2020}
}

@article{cafageiakakrlemarisc19a,
  title = {{ASP-Core-2} Input Language Format},
  author = {F. Calimeri and W. Faber and M. Gebser and G. Ianni and R. Kaminski and T. Krennwallner and N. Leone and M. Maratea and F. Ricca and T. Schaub},
  journal = tplp,
  number = {2},
  pages = {294-309},
  volume = {20},
  year = {2020}
}

@techreport{cafalepf01a,
  title = {Pruning operators for answer set programming systems},
  author = {F. Calimeri and W. Faber and N. Leone and G. Pfeifer},
  institution = {Technische Universit{\"a}t Wien},
  number = {INFSYS RR-1843-01-07},
  type = {Technical Report},
  year = {2001}
}

@article{cafali20a,
  title = {Modular Answer Set Programming as a Formal Specification Language},
  author = {P. Cabalar and J. Fandinno and Y. Lierler},
  journal = tplp,
  number = {5},
  pages = {767-782},
  volume = {20},
  year = {2020}
}

@inproceedings{cafali91a,
  title = {Contextual Negations and Reasoning with Contradictions},
  author = {W. Carnielli and L. {Fari{\~n}as del Cerro} and M. {Lima Marques}},
  editor = {J. Mylopoulos and R. Reiter},
  booktitle = ijcai,
  pages = {532-537},
  publisher = m-k,
  year = {1991}
}

@article{cafapfle06a,
  title = {Pruning Operators for Disjunctive Logic Programming Systems},
  author = {F. Calimeri and W. Faber and G. Pfeifer and N. Leone},
  journal = {Fundamenta Informaticae},
  number = {2-3},
  pages = {183-214},
  volume = {71},
  year = {2006}
}

@inproceedings{cafascsc17a,
  title = {Gelfond-Zhang aggregates as propositional formulas},
  author = {P. Cabalar and J. Fandinno and T. Schaub and S. Schellhorn},
  crossref = {lpnmr17},
  pages = {117-131}
}

@article{cafascsc17b,
  title = {Gelfond-Zhang aggregates as propositional formulas},
  author = {P. Cabalar and J. Fandinno and T. Schaub and S. Schellhorn},
  journal = ai,
  pages = {26-43},
  volume = {274},
  year = {2019}
}

@inproceedings{cafascsc19a,
  title = {Lower Bound Founded Logic of Here-and-There},
  author = {P. Cabalar and J. Fandinno and T. Schaub and S. Schellhorn},
  crossref = {jelia19},
  doi = {10.1007/978-3-030-19570-0\_34},
  pages = {509-525}
}

@inproceedings{cafascwa20a,
  title = {An {ASP} Semantics for Constraints Involving Conditional Aggregates},
  author = {P. Cabalar and J. Fandinno and T. Schaub and P. Wanko},
  crossref = {ecai20},
  doi = {10.3233/FAIA200152},
  pages = {664-671}
}

@inproceedings{cafascwa20b,
  title = {A Uniform Treatment of Aggregates and Constraints in Hybrid {ASP}},
  author = {P. Cabalar and J. Fandinno and T. Schaub and P. Wanko},
  crossref = {kr20},
  doi = {10.24963/KR.2020/20},
  pages = {193-202}
}

@article{cafascwa21a,
  title = {Towards a Semantics for Hybrid {ASP} systems},
  author = {P. Cabalar and J. Fandinno and T. Schaub and P. Wanko},
  journal = {CoRR},
  url = {https://arxiv.org/abs/2108.03061},
  volume = {abs/2108.03061},
  year = {2021}
}

@article{cafascwa23a,
  title = {On the Semantics of Hybrid {ASP} Systems Based on Clingo},
  author = {P. Cabalar and J. Fandinno and T. Schaub and P. Wanko},
  doi = {10.3390/a16040185},
  journal = {Algorithms},
  number = {4},
  url = {https://www.mdpi.com/1999-4893/16/4/185},
  volume = {16},
  year = {2023}
}

@article{cafito02a,
  title = {Modeling and Solving the Train Timetabling Problem},
  author = {A. Caprara and M. Fischetti and P. Toth},
  journal = {Operations Research},
  pages = {851-861},
  volume = {50},
  year = {2002}
}

@inproceedings{cafoloma16a,
  title = {A Compilation of the Full {PDDL}+ Language into {SMT}},
  author = {M. Cashmore and M. Fox and D. Long and D. Magazzeni},
  crossref = {icaps16},
  pages = {79-87}
}

@article{cafupeza17a,
  title = {{I-DLV:} The new intelligent grounder of {DLV}},
  author = {F. Calimeri and D. Fusc{\`{a}} and S. Perri and J. Zangari},
  doi = {10.3233/IA-170104},
  journal = {Intelligenza Artificiale},
  number = {1},
  pages = {5-20},
  volume = {11},
  year = {2017}
}

@inproceedings{cafzab90,
  title = {Extending resolution for model construction},
  author = {R. Caferra and N. Zabel},
  booktitle = {European Workshop on Logics in Artificial Intelligence (JELIA'90)},
  publisher = springer,
  year = {1990}
}

@article{cagahe99a,
  title = {Formalizing Action and Change in Modal Logic {I}: the frame problem},
  author = {M. Castilho and O. Gasquet and A. Herzig},
  journal = jlc,
  number = {5},
  pages = {701-735},
  volume = {9},
  year = {1999}
}

@article{caganoalfr11a,
  title = {Optimal Placement of Valves in a Water Distribution Network with {CLP}({FD})},
  author = {M. Cattafi and M. Gavanelli and M. Nonato and S. Alvisi and M. Franchini},
  journal = tplp,
  number = {4-5},
  pages = {731-747},
  volume = {11},
  year = {2011}
}

@inproceedings{cagemari14a,
  title = {The Design of the Fifth Answer Set Programming Competition},
  author = {F. Calimeri and M. Gebser and M. Maratea and F. Ricca},
  annote = {USED v4 to indicate version four},
  crossref = {iclp-tc14},
  url = {http://arxiv.org/abs/1405.3710v4},
  volume = {arXiv:1405.3710v4}
}

@article{cagemari15a,
  title = {Design and Results of the Fifth Answer Set Programming Competition},
  author = {F. Calimeri and M. Gebser and M. Maratea and F. Ricca},
  journal = ai,
  pages = {151-181},
  volume = {231},
  year = {2016}
}

@article{cagita03a,
  title = {{SAT}-based planning in complex domains: Concurrency, constraints and nondeterminism},
  author = {C. Castellini and E. Giunchiglia and A. Tacchella},
  journal = ai,
  number = {1-2},
  pages = {85-117},
  volume = {147},
  year = {2003}
}

@inproceedings{cagolumapi2010a,
  title = {Datalog+/-: {A} Family of Logical Knowledge Representation and Query Languages for New Applications},
  author = {A. Cal{\`\i} and G. Gottlob and T. Lukasiewicz and B. Marnette and A. Pieris},
  crossref = {lics10},
  pages = {228-242}
}

@inproceedings{cagrtr14a,
  title = {Detecting decidable classes of finitely ground logic programs with function symbols},
  author = {M. Calautti and S. Greco and I. Trubitsyna},
  booktitle = {Proceedings of the Fifteenth International Symposium on Principles and Practice of Declarative Programming, (PPDP'13)},
  pages = {239-250},
  year = {2013}
}

@inproceedings{cahaokpaerpa09a,
  title = {Bridging the Gap between High-Level Reasoning and Low-Level Control},
  author = {O. Caldiran and K. Haspalamutgil and A. Ok and C. Palaz and E. Erdem and V. Patoglu},
  crossref = {lpnmr09},
  pages = {342-354}
}

@article{caiapapeza19a,
  title = {Incremental Answer Set Programming with Overgrounding},
  author = {F. Calimeri and G. Ianni and F. Pacenza and S. Perri and J. Zangari},
  journal = tplp,
  number = {5-6},
  pages = {957-973},
  volume = {19},
  year = {2019}
}

@article{caiari13a,
  title = {The Third Open Answer Set Programming Competition},
  author = {F. Calimeri and G. Ianni and F. Ricca},
  journal = tplp,
  number = {1},
  pages = {117-135},
  volume = {14},
  year = {2014}
}

@inproceedings{cakakakatuer07a,
  title = {Solving Challenging Grid Puzzles with Answer Set Programming},
  author = {M. {\c{C}}ayl{\i} and A. Karatop and E. Kavlak and H. Kaynar and F. T{\"u}re and E. Erdem},
  crossref = {asp07},
  pages = {175-190}
}

@inproceedings{cakamosc19a,
  title = {telingo = {ASP} + Time},
  author = {P. Cabalar and R. Kaminski and P. Morkisch and T. Schaub},
  crossref = {lpnmr19},
  doi = {10.1007/978-3-030-20528-7\_19},
  pages = {256-269}
}

@inproceedings{cakaossc16a,
  title = {An {ASP} Semantics for Default Reasoning with Constraints},
  author = {P. Cabalar and R. Kaminski and M. Ostrowski and T. Schaub},
  crossref = {ijcai16},
  doi = {10.5555/3060621.3060762},
  pages = {1015-1021}
}

@article{cakascsc18a,
  title = {Temporal Answer Set Programming on Finite Traces},
  author = {P. Cabalar and R. Kaminski and T. Schaub and A. Schuhmann},
  doi = {10.1017/S1471068418000297},
  journal = tplp,
  number = {3-4},
  pages = {406-420},
  volume = {18},
  year = {2018}
}

@book{calepe04a,
  title = {Automated Model Building},
  author = {R. Caferra and A. Leitsch and N. Peltier},
  publisher = kluwer,
  series = {Applied Logic Series},
  year = {2004}
}

@inproceedings{calerive09a,
  title = {A Visual Tracer for {DLV}},
  author = {F. Calimeri and N. Leone and F. Ricca and P. Veltri},
  crossref = {sea09},
  pages = {79-93}
}

@inproceedings{caletal02a,
  title = {Pruning operators for answer set programming systems},
  author = {F. Calimeri and W. Faber and N. Leone and G. Pfeifer},
  editor = {S. Benferhat and E. Giunchiglia},
  booktitle = {Proceedings of the ninth International Workshop on Non-Monotonic Reasoning (NMR'04)},
  pages = {200-209},
  year = {2002}
}

@inproceedings{calian05a,
  title = {External Sources of Computation for Answer Set Solvers},
  author = {F. Calimeri and G. Ianni},
  crossref = {lpnmr05},
  pages = {105-118}
}

@article{camaze20a,
  title = {Planning for Hybrid Systems via Satisfiability Modulo Theories},
  author = {M. Cashmore and D. Magazzeni and P. Zehtabi},
  journal = jair,
  pages = {235-283},
  volume = {67},
  year = {2020}
}

@inproceedings{cammci19a,
  title = {Learning interpretable models expressed in linear temporal logic},
  author = {A. Camacho and S. McIlraith},
  crossref = {icaps19},
  pages = {621-630}
}

@article{caodpeva07a,
  title = {Partial equilibrium logic},
  author = {P. Cabalar and S. Odintsov and D. Pearce and A. Valverde},
  journal = amai,
  number = {3-4},
  pages = {305-331},
  volume = {50},
  year = {2007}
}

@inproceedings{caotpo00a,
  title = {Temporal Constraint Networks in Action},
  author = {P. Cabalar and R. Otero and S. Pose},
  crossref = {ecai00},
  pages = {543-547}
}

@inproceedings{capeva05a,
  title = {Reducing Propositional Theories in Equilibrium Logic to Logic Programs},
  author = {P. Cabalar and D. Pearce and A. Valverde},
  booktitle = {Proceedings of the Twelfth Portuguese Conference on Artificial Intelligence (EPIA'05)},
  pages = {4-17},
  publisher = springer,
  series = lncs,
  volume = {3808},
  year = {2005}
}

@inproceedings{capeva09a,
  title = {A Revised Concept of Safety for General Answer Set Programs.},
  author = {P. Cabalar and D. Pearce and A. Valverde},
  crossref = {lpnmr09},
  pages = {58-70}
}

@article{capeva09b,
  title = {Safety Preserving Transformations for General Answer Set Programs},
  author = {P. Cabalar and D. Pearce and A. Valverde},
  crossref = {lopstr09}
}

@article{capeva17a,
  title = {Stable reasoning},
  author = {P. Cabalar and D. Pearce and A. Valverde},
  doi = {10.1080/11663081.2018.1439358},
  journal = jancl,
  number = {3-4},
  pages = {238-254},
  volume = {27},
  year = {2017}
}

@inproceedings{capsur21a,
  title = {{DPLL(MAPF):} an Integration of Multi-Agent Path Finding and {SAT} Solving Technologies},
  author = {M. Capek and P. Surynek},
  crossref = {socs21},
  pages = {153-155}
}

@inproceedings{carevi19a,
  title = {A Complete Planner for Temporal Answer Set Programming},
  author = {P. Cabalar and M. Rey and C. Vidal},
  crossref = {epia19},
  pages = {520-525}
}

@article{cascgigi02a,
  title = {An Algorithm to Evaluate Quantified {B}oolean Formulae and Its Experimental Evaluation},
  author = {M. Cadoli and M. Schaerf and A. Giovanardi and M. Giovanardi},
  journal = jar,
  number = {2},
  pages = {101-142},
  volume = {28},
  year = {2002}
}

@inproceedings{caslee11a,
  title = {Representing the Language of the Causal Calculator in Answer Set Programming},
  author = {M. Casolary and J. Lee},
  crossref = {iclp-lipics11}
}

@inproceedings{caswar01a,
  title = {An Environment for the Exploration of Non Monotonic Logic Programs},
  author = {L. Castro and D. Warren},
  crossref = {wlpe01},
  url = {http://arxiv.org/abs/cs.PL/0111049}
}

@article{catbru13a,
  title = {Detection and Exploitation of Functional Dependencies for Model Generation},
  author = {B. {D}e Cat and M. Bruynooghe},
  journal = tplp,
  number = {4-5},
  pages = {471-485},
  volume = {13},
  year = {2013}
}

@inproceedings{ceertaurer09a,
  title = {Comparing {ASP} and {CP} on Four Grid Puzzles},
  author = {M. {\c{C}}elik and H. Erdo{\u{g}}an and F. Tahao{\u{g}}lu and T. Uras and E. Erdem},
  crossref = {rcra09}
}

@inproceedings{cegeth14a,
  title = {Online Agent Logic Programming with o{C}lingo},
  author = {T. Cerexhe and M. Gebser and M. Thielscher},
  crossref = {pricai14},
  pages = {945-957}
}

@book{cegota90,
  title = {Logic Programming and Databases},
  author = {S. Ceri and G. Gottlob and L. Tanca},
  publisher = springer,
  year = {1990}
}

@inproceedings{cesath13a,
  title = {Evaluating Reactive Answer Set Solving for General Game Playing},
  author = {T. Cerexhe and O. Sabuncu and M. Thielscher},
  crossref = {lpnmr13},
  pages = {219-232}
}

@inproceedings{chafro91,
  title = {Graded logics: A framework for uncertain and defeasible knowledge},
  author = {P. Chatalic and C. Froidevaux},
  editor = {Z. Ras and M. Zemankova},
  booktitle = {Fifth International Symposium on Methodologies for Intelligent Systems (ISMIS'91)},
  pages = {479-489},
  publisher = springer,
  series = lnai,
  volume = {542},
  year = {1991}
}

@article{chakha15a,
  title = {A Research Survey: Review of Flexible Job Shop Scheduling Techniques},
  author = {I. Chaudhry and A. Khan},
  journal = {International Transactions in Operational Research},
  number = {3},
  pages = {551-591},
  volume = {23},
  year = {2016}
}

@book{chalee73,
  title = {Symbolic Logic and Mechanical Theorem Proving},
  author = {C. Chang and R. Lee},
  publisher = {Academic Press},
  year = {1973}
}

@book{chamcd84,
  title = {An Introduction to Aritifical Intelligence},
  author = {E. Charniak and D. McDermott},
  address = {Reading, MA},
  publisher = addison,
  year = {1984}
}

@article{chapman87a,
  title = {Planning for Conjunctive Goals},
  author = {D. Chapman},
  journal = ai,
  number = {3},
  pages = {333-377},
  volume = {32},
  year = {1987}
}

@inproceedings{chcomi06a,
  title = {Automated Generation of Implied Constraints},
  author = {J. Charnley and S. Colton and I. Miguel},
  crossref = {ecai06},
  pages = {73-77}
}

@article{chdvalgawawo15a,
  title = {Methods for solving reasoning problems in abstract argumentation - {A} survey},
  author = {G. Charwat and W. Dvor{\'a}k and S. {Alice Gaggl} and J. Wallner and S. Woltran},
  journal = ai,
  pages = {28-63},
  volume = {220},
  year = {2015}
}

@book{chellas80,
  title = {Modal logic: an introduction},
  author = {B. Chellas},
  publisher = cup,
  year = {1980}
}

@inproceedings{chenlama07a,
  title = {A Short Introduction to Computational Social Choice},
  author = {Y. Chevaleyre and U. Endriss and J. Lang and N. Maudet},
  editor = {J. van Leeuwen and G. Italiano and W. van der Hoek and C. Meinel and H. Sack and F. Plasil},
  booktitle = {Proceedings of the Thirty-third Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)},
  pages = {51-69},
  publisher = springer,
  series = lncs,
  volume = {4362},
  year = {2007}
}

@inproceedings{chewar93a,
  title = {Query Evaluation under the Well Founded Semantics},
  author = {W. Chen and D. Warren},
  crossref = {pods93},
  pages = {168-179}
}

@inproceedings{chgewa05a,
  title = {Modeling Hybrid Domains Using Process Description Language},
  author = {S. Chintabathina and M. Gelfond and R. Watson},
  crossref = {asp05}
}

@inproceedings{chgewa07a,
  title = {Defeasible laws, parallel actions, and reasoning about resources},
  author = {S. Chintabathina and M. Gelfond and R. Watson},
  editor = {E. Amir and V. Lifschitz and R. Miller},
  booktitle = {Proceedings of the Eighth International Symposium on Logical Formalization of Commonsense Reasoning (COMMONSENSE'07)},
  publisher = aaaimit,
  year = {2007}
}

@inproceedings{chgose01a,
  title = {Formal Models of Heavy-Tailed Behavior in Combinatorial Search},
  author = {H. Chen and C. Gomes and B. Selman},
  crossref = {cp01},
  pages = {408-421}
}

@inproceedings{chhalist21a,
  title = {Symmetry Breaking for k-Robust Multi-Agent Path Finding},
  author = {Z. Chen and D. Harabor and J. Li and P. Stuckey},
  crossref = {aaai21},
  pages = {12267-12274}
}

@article{chhuxizh09a,
  title = {Long-distance mutual exclusion for planning},
  author = {Y. Chen and R. Huang and Z. Xing and W. Zhang},
  journal = ai,
  number = {2},
  pages = {365-391},
  volume = {173},
  year = {2009}
}

@article{chibrusa03a,
  title = {Enumerating and Characterizing the Perfect Elimination Orderings of a Chordal Graph},
  author = {L. Chandran and L. Ibarra and F. Ruskey and J. Sawada},
  journal = tcs,
  number = {2},
  pages = {303-317},
  volume = {307},
  year = {2003}
}

@article{chimon00a,
  title = {Temporal representation and reasoning in artificial intelligence: Issues and approaches},
  author = {L. Chittaro and A. Montanari},
  journal = amai,
  number = {1-4},
  pages = {47-106},
  volume = {28},
  year = {2000}
}

@inproceedings{chjijijiwa09a,
  title = {Integrating {NLP} with Reasoning about Actions for Autonomous Agents Communicating with Humans},
  author = {X. Chen and J. Jiang and J. Ji and G. Jin and F. Wang},
  crossref = {iat09},
  pages = {137-140}
}

@inproceedings{chjijijiwaxi10a,
  title = {Developing high-level cognitive functions for service robots},
  author = {X. Chen and J. Ji and J. Jiang and G. Jin and F. Wang and J. Xie},
  crossref = {aamas10},
  pages = {989-996}
}

@inproceedings{chjili08a,
  title = {Computing Loops With at Most One External Support Rule},
  author = {X. Chen and J. Ji and F. Lin},
  crossref = {kr08},
  pages = {401-410}
}

@inproceedings{chjili09a,
  title = {Computing Loops With at Most One External Support Rule for Disjunctive Logic Programs},
  author = {X. Chen and J. Ji and F. Lin},
  crossref = {iclp09},
  pages = {130-144}
}

@article{chkost81a,
  title = {Alternation},
  author = {A. Chandra and D. Kozen and L. Stockmeyer},
  doi = {10.1145/322234.322243},
  journal = jacm,
  number = {1},
  pages = {114-133},
  volume = {28},
  year = {1981}
}

@article{chku05a,
  title = {A Fast Pseudo-{B}oolean Constraint Solver},
  author = {D. Chai and A. Kuehlmann},
  journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  number = {3},
  pages = {305-317},
  volume = {24},
  year = {2005}
}

@inproceedings{chlili05a,
  title = {{SELP}---A System for Studying Strong Equivalence Between Logic Programs},
  author = {Y. Chen and F. Lin and L. Li},
  crossref = {lpnmr05},
  pages = {442-446}
}

@inproceedings{chliwaza06a,
  title = {First-Order Loop Formulas for Normal Logic Programs},
  author = {Y. Chen and F. Lin and Y. Wang and M. Zhang},
  crossref = {kr06},
  pages = {298-307}
}

@article{chlona03a,
  title = {Conflict Resolution using Logic Programming},
  author = {J. Chomicki and J. Lobo and S. Naqvi},
  journal = tkde,
  number = {1},
  pages = {244-249},
  volume = {15},
  year = {2003}
}

@inproceedings{chmamitr95a,
  title = {Experimenting with Nonmonotonic Reasoning},
  author = {P. Cholewi{\'n}ski and V. Marek and A. Mikitiuk and M. Truszczy{\'n}ski},
  editor = {L. Sterling},
  booktitle = iclp,
  pages = {267-281},
  publisher = {MIT Press},
  year = {1995}
}

@inproceedings{chmasc16a,
  title = {On the Impact of Modal Depth in Epistemic Planning},
  author = {T. Charrier and B. Maubert and F. Schwarzentruber},
  crossref = {ijcai16},
  pages = {1030-1036}
}

@inproceedings{chmatr96a,
  title = {Default Reasoning System {DeReS}},
  author = {P. Cholewi{\'n}ski and V. Marek and M. Truszczy{\'n}ski},
  crossref = {kr96},
  pages = {518-528}
}

@inproceedings{chmeva13a,
  title = {A Scalable and Nearly Uniform Generator of {SAT} Witnesses},
  author = {S. Chakraborty and K. Meel and M. Vardi},
  crossref = {cav13},
  pages = {608-623}
}

@inproceedings{chmeva13b,
  title = {A Scalable Approximate Model Counter},
  author = {S. Chakraborty and K. Meel and M. Vardi},
  crossref = {cp13},
  pages = {200-216}
}

@inproceedings{choimi88a,
  title = {Temporal Deductive Databases and Infinite Objects},
  author = {J. Chomicki and T. Imielinski},
  editor = {C. Edmondson-Yurkanan and M. Yannakakis},
  booktitle = {Proceedings of the Seventh {ACM} {SIGACT-SIGMOD-SIGART} Symposium on Principles of Database Systems},
  pages = {61-73},
  publisher = acm,
  year = {1988}
}

@inproceedings{choimi89a,
  title = {Relational Specifications of Infinite Query Answers},
  author = {J. Chomicki and T. Imielinski},
  editor = {J. Clifford and B. Lindsay and D. Maier},
  booktitle = {Proceedings of the 1989 {ACM} {SIGMOD} International Conference on Management of Data},
  pages = {174-183},
  publisher = acm,
  year = {1989}
}

@article{choimi93a,
  title = {Finite Representation of Infinite Query Answers},
  author = {J. Chomicki and T. Imielinski},
  doi = {10.1145/151634.151635},
  journal = tods,
  number = {2},
  pages = {181-223},
  volume = {18},
  year = {1993}
}

@inproceedings{cholewinski95a,
  title = {Reasoning with Stratified Default Theories},
  author = {P. Cholewi{\'n}ski},
  editor = {V. Marek and A. Nerode},
  booktitle = {Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning},
  pages = {273-286},
  publisher = springer,
  series = lncs,
  volume = {928},
  year = {1995}
}

@article{chomicki95a,
  title = {Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding},
  author = {J. Chomicki},
  journal = tods,
  number = {2},
  pages = {149-186},
  volume = {20},
  year = {1995}
}

@article{chpewawa05a,
  title = {Preference-Based Frequent Pattern Mining},
  author = {M. Cho and J. Pei and H. Wang and W. Wang},
  journal = {International Journal of Data Warehousing and Mining},
  number = {4},
  pages = {56-77},
  volume = {1},
  year = {2005}
}

@book{chrimc79,
  title = {Aritificial Intelligence Programming},
  author = {E. Charniak and C. Riesbeck and D. McDermott},
  address = {Hillsdale, NJ},
  publisher = {Lawrence Erlbaum Associates},
  year = {1979}
}

@inproceedings{chrwol03a,
  title = {{GridSAT}: A {C}haff-based Distributed {SAT} Solver for the {G}rid},
  author = {W. Chrabakh and R. Wolski},
  crossref = {sc03},
  pages = {37}
}

@article{chrwol06a,
  title = {Grid{SAT}: a system for solving satisfiability problems using a computational grid},
  author = {W. Chrabakh and R. Wolski},
  journal = {Parallel Computing},
  number = {9},
  pages = {660-687},
  volume = {32},
  year = {2006}
}

@inproceedings{chsrzhka17a,
  title = {Plan Explanations as Model Reconciliation: Moving Beyond Explanation as Soliloquy},
  author = {T. Chakraborti and S. Sreedharan and Y. Zhang and S. Kambhampati},
  crossref = {ijcai17},
  pages = {156-163}
}

@article{cimrov00a,
  title = {Conformant Planning via Symbolic Model Checking},
  author = {A. Cimatti and M. Roveri},
  journal = jair,
  pages = {305-338},
  volume = {13},
  year = {2000}
}

@inproceedings{ciorba96a,
  title = {A Query Answering Algorithm for {\L}ukaszewicz' General Open Default Theory},
  author = {V. Ciorba},
  editor = {J. Alferes and L. Pereira and E. Orlowska},
  booktitle = {Fifth European Workshop on Logics in Artificial Intelligence (JELIA'96)},
  pages = {208-223},
  publisher = springer,
  series = lnai,
  volume = {1126},
  year = {1996}
}

@incollection{cipitr08a,
  title = {Automated Planning},
  author = {A. Cimatti and M. Pistore and P. Traverso},
  chapter = {22},
  crossref = {KRHandbook},
  pages = {841-867}
}

@article{cirobe04a,
  title = {Conformant planning via symbolic model checking and heuristic search},
  author = {A. Cimatti and M. Roveri and P. Bertoli},
  journal = ai,
  number = {1-2},
  pages = {127-206},
  volume = {159},
  year = {2004}
}

@inproceedings{cirosh04a,
  title = {Bounded Verification of Past {LTL}},
  author = {A. Cimatti and M. Roveri and D. Sheridan},
  crossref = {fmcad04},
  pages = {245-259}
}

@incollection{clark78a,
  title = {Negation as Failure},
  author = {K. Clark},
  editor = {H. Gallaire and J. Minker},
  booktitle = {Logic and Data Bases},
  pages = {293-322},
  publisher = {Plenum Press},
  year = {1978}
}

@inproceedings{clasor03a,
  title = {New techniques that improve {MACE}-style finite model finding},
  author = {K. Claessen and N. S{\"o}rensson},
  editor = {P. Baumgartner and C. Ferm{\"u}ller},
  booktitle = {Proceedings of the Workshop on Model Computation --- Principles, Algorithms, Applications (MODEL'03)},
  year = {2003}
}

@article{clbirazh01a,
  title = {Bounded Model Checking Using Satisfiability Solving},
  author = {E. Clarke and A. Biere and R. Raimi and Y. Zhu},
  journal = {Formal Methods in System Design},
  number = {1},
  pages = {7-34},
  volume = {19},
  year = {2001}
}

@book{clgrpe99a,
  title = {Model checking},
  author = {E. Clarke and O. Grumberg and D. Peled},
  publisher = {MIT Press},
  year = {1999}
}

@book{clomel81,
  title = {Programming in {P}rolog},
  author = {W. Clocksin and C. Mellish},
  publisher = springer,
  year = {1981}
}

@inproceedings{clvobrpa08a,
  title = {{ASPVIZ}: Declarative Visualisation and Animation Using Answer Set Programming},
  author = {O. Cliffe and M. {D}e Vos and M. Brain and J. Padget},
  crossref = {iclp08},
  pages = {724-728}
}

@inproceedings{clvopa09a,
  title = {Modelling Normative Frameworks Using Answer Set Programing},
  author = {O. Cliffe and M. {D}e Vos and J. Padget},
  crossref = {lpnmr09},
  pages = {548-553}
}

@article{cocotu87a,
  title = {On the Complexity of Cutting-Plane Proofs},
  author = {W. Cook and C. Coullard and G. Tur{\'a}n},
  journal = {Discrete Applied Mathematics},
  number = {1},
  pages = {25-38},
  volume = {18},
  year = {1987}
}

@article{codapr02a,
  title = {On the equivalence and range of applicability of graph-based representations of logic programs},
  author = {S. Costantini and O. D'Antona and A. Provetti},
  journal = ipl,
  number = {5},
  pages = {241-249},
  volume = {84},
  year = {2002}
}

@article{codd70a,
  title = {A Relational Model of Data for Large Shared Data Banks},
  author = {E. Codd},
  journal = cacm,
  number = {6},
  pages = {377-387},
  volume = {13},
  year = {1970}
}

@article{codd72a,
  title = {Relational Completeness of Data Base Sublanguages},
  author = {E. Codd},
  journal = {Research Report / RJ / IBM / San Jose, California},
  volume = {RJ987},
  year = {1972}
}

@article{codulemavo06a,
  title = {Maintaining large software distributions: new challenges from the {FOSS} era},
  author = {R. {D}i Cosmo and B. Durak and X. Leroy and F. Mancinelli and J. Vouillon},
  journal = {EASST Newsletter},
  pages = {7-20},
  volume = {12},
  year = {2006}
}

@inproceedings{coevgeprscsith13a,
  title = {Extending the Metabolic Network of {E}ctocarpus Siliculosus using Answer Set Programming},
  author = {G. Collet and D. Eveillard and M. Gebser and S. Prigent and T. Schaub and A. Siegel and S. Thiele},
  crossref = {lpnmr13},
  pages = {245-256}
}

@inproceedings{cofahascsc23a,
  title = {Interactive Configuration with {ASP} Multi-Shot Solving},
  author = {R. Comploi-Taupe and A. Falkner and S. Hahn and T. Schaub and G. Schenner},
  crossref = {conf23},
  pages = {95-103},
  url = {https://ceur-ws.org/Vol-3509/paper13.pdf}
}

@article{cofope10a,
  title = {Extending and Implementing {RASP}},
  author = {S. Costantini and A. Formisano and D. Petturiti},
  journal = {Fundamenta Informaticae},
  number = {1-2},
  pages = {1-33},
  volume = {105},
  year = {2010}
}

@article{cofrsc22a,
  title = {Applying Incremental Answer Set Solving to Product Configuration},
  author = {R. Comploi-Taupe and G. Francesutto and G. Schenner},
  journal = {CoRR},
  url = {https://arxiv.org/abs/2207.08599},
  volume = {abs/2207.08599},
  year = {2022}
}

@article{cofrscwe23a,
  title = {Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach},
  author = {R. Comploi-Taupe and G. Friedrich and K. Schekotihin and A. Weinzierl},
  journal = jair,
  pages = {59-114},
  volume = {76},
  year = {2023}
}

@inproceedings{cohascsc22a,
  title = {Challenges of Developing an {API} for Interactive Configuration using {ASP}},
  author = {R. Comploi-Taupe and S. Hahn and G. Schenner and T. Schaub},
  crossref = {taasp22},
  url = {http://www.kr.tuwien.ac.at/events/taasp22/papers/TAASP_2022_paper_5.pdf}
}

@inproceedings{cojarinype13a,
  title = {Learning Chordal {M}arkov Networks by Constraint Satisfaction},
  author = {J. Corander and T. Janhunen and J. Rintanen and H. Nyman and J. Pensar},
  crossref = {nips13},
  pages = {1349-1357}
}

@inproceedings{cojasasa12a,
  title = {A {SAT}-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence},
  author = {E. Coquery and S. Jabbour and L. Sa{\"\i}s and Y. Salhi},
  crossref = {ecai12},
  pages = {258-263}
}

@inproceedings{colalima04a,
  title = {Expressive Power and Succinctness of Propositional Languages for Preference Representation},
  author = {S. Coste-Marquis and J. Lang and P. Liberatore and P. Marquis},
  crossref = {kr10},
  pages = {203-212}
}

@inproceedings{colcol11a,
  title = {{LPRPG-P:} Relaxed Plan Heuristics for Planning with Preferences},
  author = {A. Coles and A. Coles},
  crossref = {icaps11}
}

@inproceedings{coltep19a,
  title = {Industrial Size Job Shop Scheduling Tackled by Present Day {CP} Solvers},
  author = {G. {D}a Col and E. Teppan},
  crossref = {cp19},
  pages = {144-160}
}

@inproceedings{contest07a,
  title = {The First Answer Set Programming System Competition},
  author = {M. Gebser and L. Liu and G. Namasivayam and A. Neumann and T. Schaub and M. Truszczy{\'n}ski},
  crossref = {lpnmr07},
  pages = {3-17}
}

@inproceedings{contest09a,
  title = {The Second Answer Set Programming Competition},
  author = {M. Denecker and J. Vennekens and S. Bond and M. Gebser and M. Truszczy{\'n}ski},
  crossref = {lpnmr09},
  pages = {637-654}
}

@inproceedings{contest11a,
  title = {The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track},
  author = {F. Calimeri and G. Ianni and F. Ricca and M. Alviano and A. Bria and G. Catalano and S. Cozza and W. Faber and O. Febbraro and N. Leone and M. Manna and A. Martello and C. Panetta and S. Perri and K. Reale and M. Santoro and M. Sirianni and G. Terracina and P. Veltri},
  crossref = {lpnmr11},
  pages = {388-403}
}

@inproceedings{contest13a,
  title = {The Fourth Answer Set Programming Competition: Preliminary Report},
  author = {M. Alviano and F. Calimeri and G. Charwat and M. Dao-Tran and C. Dodaro and G. Ianni and T. Krennwallner and M. Kronegger and J. Oetsch and A. Pfandler and J. P{\"u}hrer and C. Redl and F. Ricca and P. Schneider and M. Schwengerer and L. Spendier and J. Wallner and G. Xiao},
  crossref = {lpnmr13},
  pages = {42-53}
}

@inproceedings{cook71a,
  title = {The Complexity of Theorem-Proving Procedures},
  author = {S. Cook},
  editor = {M. Harrison and R. Banerji and J. Ullman},
  booktitle = {Proceedings of the Third Annual ACM Symposium on Theory of Computing (STOC'71)},
  pages = {151-158},
  publisher = acm,
  year = {1971}
}

@article{coorec79a,
  title = {The Relative Efficiency of Propositional Proof Systems},
  author = {S. Cook and R. Reckhow},
  journal = jsl,
  number = {1},
  pages = {36-50},
  volume = {44},
  year = {1979}
}

@article{cosfor10a,
  title = {Answer Set Programming with Resources},
  author = {S. Costantini and A. Formisano},
  journal = jlc,
  number = {2},
  pages = {533-571},
  volume = {20},
  year = {2010}
}

@inproceedings{cosmar02a,
  title = {Complexity Results for Paraconsistent Inference Relations},
  author = {S. Coste-Marquis and P. Marquis},
  crossref = {kr02},
  pages = {61-72}
}

@article{cospro03a,
  title = {Normal Forms for Answer Sets Programming},
  author = {S. Costantini and A. Provetti},
  journal = tplp,
  number = {5},
  pages = {747-760},
  volume = {7},
  year = {2005}
}

@inproceedings{cotmal06a,
  title = {Fast and flexible difference constraint propagation for {DPLL(T)}},
  author = {S. Cotton and O. Maler},
  crossref = {sat06},
  pages = {170-183}
}

@inproceedings{courkuxuayko16a,
  title = {Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding},
  author = {L. Cohen and T. Uras and T. Kumar and H. Xu and N. Ayanian and S. Koenig},
  crossref = {ijcai16},
  pages = {3067-3074}
}

@article{cowefr20a,
  title = {Conflict Generalisation in {ASP}: Learning Correct and Effective Non-Ground Constraints},
  author = {R. Comploi-Taupe and A. Weinzierl and G. Friedrich},
  doi = {10.1017/S1471068420000368},
  journal = tplp,
  pages = {799-814},
  volume = {20},
  year = {2020}
}

@article{craaut96a,
  title = {Experimental results on the crossover point in random {3SAT}},
  author = {J. Crawford and L. Auton},
  journal = ai,
  number = {1-2},
  pages = {31-57},
  volume = {81},
  year = {1996}
}

@inproceedings{crabak94a,
  title = {Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems},
  author = {J. Crawford and A. Baker},
  crossref = {aaai94},
  pages = {1092-1097}
}

@inproceedings{crbrvofi09a,
  title = {Generating Optimal Code Using Answer Set Programming},
  author = {T. Crick and M. Brain and M. {D}e Vos and J. Fitch},
  crossref = {lpnmr09},
  pages = {554-559}
}

@inproceedings{crecod04a,
  title = {Compilation of LTL goal formulas into PDDL},
  author = {S. Cresswell and A. Coddington},
  crossref = {ecai04},
  pages = {985-986}
}

@inproceedings{crjoro14a,
  title = {A Single-Agent Approach to Multiagent Planning},
  author = {M. Crosby and A. Jonsson and M. Rovatsos},
  crossref = {ecai14},
  pages = {237-242}
}

@inproceedings{cudorisc20a,
  title = {Overcoming the Grounding Bottleneck Due to Constraints in {ASP} Solving: Constraints Become Propagators},
  author = {B. Cuteri and C. Dodaro and F. Ricca and P. Sch{\"u}ller},
  crossref = {ijcai20},
  pages = {1688-1694}
}

@inproceedings{cufagr03a,
  title = {Improving Query Optimization for Disjunctive Datalog},
  author = {C. Cumbo and W. Faber and G. Greco},
  editor = {F. Buccafurri},
  booktitle = {Proceedings of the Joint Conference on Declarative Programming (AGP'03)},
  pages = {252-262},
  year = {2003}
}

@book{cugust91a,
  title = {{D}as {PLAKON}-{B}uch},
  author = {R. Cunis and A. G{\"u}nter and H. Strecker},
  doi = {10.1007/978-3-662-06485-6},
  publisher = springer,
  series = {Informatik Fachberichte},
  volume = {266},
  year = {1991}
}

@article{cuiswi01,
  title = {Preference Logic Grammars: Fixed-point Semantics and Application to Data Standardization},
  author = {B. Cui and T. Swift},
  journal = ai,
  number = {1-2},
  pages = {117-147},
  volume = {138},
  year = {2002}
}

@inproceedings{cuwagrko21a,
  title = {Stratified Negation in Datalog with Metric Temporal Operators},
  author = {D. Cucala and P. Wa{\l}ega and B. {Cuenca Grau} and E. Kostylev},
  crossref = {aaai21},
  pages = {6488-6495}
}

@article{czemal85,
  title = {Key Notions of Tarski's Methodology of Deductive Systems},
  author = {J. Czelakowski and G. Malinowski},
  journal = {Studia Logica},
  number = {4},
  pages = {321-351},
  volume = {44},
  year = {1985}
}

@inproceedings{daba07a,
  title = {Using More Reasoning to Improve \#{SAT} Solving},
  author = {J. Davies and F. Bacchus},
  crossref = {aaai07},
  pages = {185-190}
}

@inproceedings{dabamc13a,
  title = {Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge},
  author = {S. Davis-Mendelow and J. Baier and S. McIlraith},
  crossref = {aaai13},
  pages = {209-216}
}

@article{dacosta74,
  title = {On the theory of inconsistent formal systems},
  author = {N. da Costa},
  journal = {Notre Dame Journal of Formal Logic},
  pages = {497-510},
  volume = {15},
  year = {1974}
}

@inproceedings{dadopo09a,
  title = {Logic Programming Techniques in Protein Structure Determination: Methodologies and Results},
  author = {A. {Dal Pal{\`u}} and A. Dovier and E. Pontelli},
  crossref = {lpnmr09},
  pages = {560-566}
}

@inproceedings{dadoporo09a,
  title = {Answer Set Programming with Constraints Using Lazy Grounding},
  author = {A. {Dal Pal{\`u}} and A. Dovier and E. Pontelli and G. Rossi},
  crossref = {iclp09},
  pages = {115-129}
}

@inproceedings{daeifikr10a,
  title = {Distributed Nonmonotonic Multi-Context Systems},
  author = {M. Dao-Tran and T. Eiter and M. Fink and T. Krennwallner},
  crossref = {kr10}
}

@inproceedings{daeifiwewe12a,
  title = {{OMiGA} : An Open Minded Grounding On-The-Fly Answer Set Solver},
  author = {M. Dao-Tran and T. Eiter and M. Fink and G. Weidinger and A. Weinzierl},
  crossref = {jelia12},
  pages = {480-483}
}

@article{daeigovo01a,
  title = {Complexity and Expressive Power of Logic Programming},
  author = {E. Dantsin and T. Eiter and G. Gottlob and A. Voronkov},
  journal = acmcs,
  number = {3},
  pages = {374-425},
  volume = {33},
  year = {2001}
}

@inproceedings{daeigovo97a,
  title = {Complexity and Expressive Power of Logic Programming},
  author = {E. Dantsin and T. Eiter and G. Gottlob and A. Voronkov},
  booktitle = {Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity (CCC'97)},
  pages = {82-101},
  publisher = ieee,
  year = {1997}
}

@inproceedings{dakichka16a,
  title = {Incremental Task and Motion Planning: A Constraint-Based Approach},
  author = {N. Dantam and Z. Kingston and S. Chaudhuri and L. Kavraki},
  booktitle = {Proceedings of the Conference on Robotics: Science and Systems (RSS'16)},
  url = {http://www.roboticsproceedings.org/rss12/p02.pdf},
  year = {2016}
}

@inproceedings{dalal88a,
  title = {Investigations into Theory of Knowledge Base Revision.},
  author = {M. Dalal},
  booktitle = aaai,
  pages = {449-479},
  year = {1988}
}

@incollection{dalen86a,
  title = {Intuitionistic Logic},
  author = {D. van Dalen},
  crossref = {PHandbook},
  doi = {10.1007/978-94-009-5203-4_4},
  pages = {225-339},
  volume = {3}
}

@book{dalen89a,
  title = {Logic and structure},
  author = {D. van Dalen},
  doi = {10.1007/978-1-4471-4558-5},
  publisher = springer,
  series = {Universitext},
  year = {1989}
}

@article{dalolo62a,
  title = {A machine program for theorem-proving},
  author = {M. Davis and G. Logemann and D. Loveland},
  issue = {7},
  journal = cacm,
  pages = {394-397},
  volume = {5},
  year = {1962}
}

@article{damawego11a,
  title = {Topological Value Iteration Algorithms},
  author = {P. Dai and Mausam and D. Weld and J. Goldsmith},
  journal = jair,
  pages = {181-209},
  volume = {42},
  year = {2011}
}

@incollection{damper96a,
  title = {A survey on paraconsistent semantics for extended logic programs and transformations for well-founded semantics},
  author = {C. Dam{\'a}sio and L. Pereira},
  editor = {D. Gabbay and P. Smets},
  booktitle = {Handbook of Defeasible Reasoning and Uncertainty Management Systems},
  pages = {241-320},
  publisher = kluwer,
  volume = {2},
  year = {1998}
}

@book{dantzig63a,
  title = {Linear Programming and Extensions},
  author = {G. Dantzig},
  publisher = {Princeton University Press},
  year = {1963}
}

@article{daodisdorona19a,
  title = {Planning with actively eliciting preferences},
  author = {M. Das and P. Odom and M. Islam and J. Doppa and D. Roth and S. Natarajan},
  journal = {Knowledge Based Systems},
  pages = {219-227},
  volume = {165},
  year = {2019}
}

@incollection{darpip09a,
  title = {Complete Algorithms},
  author = {A. Darwiche and K. Pipatsrisawat},
  chapter = {3},
  crossref = {SATHandbook},
  pages = {99-130}
}

@article{dastani08a,
  title = {{2APL}: a practical agent programming language},
  author = {M. Dastani},
  journal = {Autonomous Agents and Multi-Agent Systems},
  number = {3},
  pages = {214-248},
  volume = {16},
  year = {2008}
}

@incollection{datmot07a,
  title = {The Sliding-Window Computation Model and Results},
  author = {M. Datar and R. Motwani},
  crossref = {ads07},
  pages = {149-167}
}

@inproceedings{davbac07a,
  title = {Using More Reasoning to Improve \#{SAT} Solving},
  author = {J. Davies and F. Bacchus},
  crossref = {aaai07},
  pages = {185-190},
  year = {2007}
}

@inproceedings{davbac11a,
  title = {Solving {MAXSAT} by Solving a Sequence of Simpler {SAT} Instances},
  author = {J. Davies and F. Bacchus},
  crossref = {cp11},
  pages = {225-239}
}

@article{davput60a,
  title = {A computing procedure for quantification theory},
  author = {M. Davis and H. Putnam},
  journal = jacm,
  pages = {201-215},
  volume = {7},
  year = {1960}
}

@article{debie11a,
  title = {Maximum Entropy Models and Subjective Interestingness: An Application to Tiles in Binary Databases},
  author = {T. {D}e Bie},
  journal = {Data Mining and Knowledge Discovery},
  number = {3},
  pages = {407-446},
  volume = {23},
  year = {2011}
}

@article{debobrde14a,
  title = {Predicate Logic as a Modelling Language: The {IDP} System},
  author = {B. {D}e Cat and B. Bogaerts and M. Bruynooghe and M. Denecker},
  journal = {CoRR},
  url = {http://arxiv.org/abs/1401.6312v1},
  volume = {abs/1401.6312},
  year = {2014}
}

@incollection{debobrjade18a,
  title = {Predicate logic as a modeling language: the {IDP} system},
  author = {B. {D}e Cat and B. Bogaerts and M. Bruynooghe and G. Janssens and M. Denecker},
  crossref = {DeclarativeLP},
  pages = {121-177}
}

@article{decfro02a,
  title = {Backjump-based backtracking for constraint satisfaction problems},
  author = {R. Dechter and D. Frost},
  journal = ai,
  number = {2},
  pages = {147-188},
  volume = {136},
  year = {2002}
}

@inproceedings{dechgest23a,
  title = {Enhancing Temporal Planning Domains by Sequential Macro-actions},
  author = {M. {D}e Bortoli and L. Chrpa and M. Gebser and G. Steinbauer-Wagner},
  crossref = {jelia23},
  pages = {595-604}
}

@inproceedings{dechgest23b,
  title = {Enhancing Temporal Planning Domains by Sequential Macro-actions (Extended Version)},
  author = {M. {D}e Bortoli and L. Chrpa and M. Gebser and G. Steinbauer-Wagner},
  journal = {CoRR},
  url = {http://arxiv.org/abs/2307.12081},
  volume = {abs/2307.12081},
  year = {2023}
}

@book{dechter03a,
  title = {Constraint Processing},
  author = {R. Dechter},
  publisher = m-k,
  year = {2003}
}

@article{dedebrst15a,
  title = {Lazy Model Expansion: Interleaving Grounding with Search},
  author = {B. {D}e Cat and M. Denecker and M. Bruynooghe and P. Stuckey},
  journal = jair,
  pages = {235-286},
  volume = {52},
  year = {2015}
}

@inproceedings{deeireri15a,
  title = {Constraint Answer Set Programming Based on {HEX}-Programs},
  author = {A. {D}e Rosis and T. Eiter and C. Redl and F. Ricca},
  crossref = {aspocp15}
}

@inproceedings{defaielepf03a,
  title = {Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in {DLV}},
  author = {T. Dell'Armi and W. Faber and G. Ielpa and N. Leone and G. Pfeifer},
  crossref = {ijcai03},
  pages = {847-852}
}

@inproceedings{deghmerisc03a,
  title = {{\L}ukaszewicz-style Answer Set Programming: A Preliminary Report},
  author = {J. Delgrande and M. Gharib and R. Mercer and V. Risch and T. Schaub},
  crossref = {asp03}
}

@article{degiacomo96a,
  title = {Eliminating ``converse'' from converse PDL},
  author = {G. {D}e Giacomo},
  journal = {Journal of Logic, Language and Information},
  number = {2},
  pages = {193-208},
  volume = {5},
  year = {1996}
}

@book{degola16a,
  title = {Temporal Logics in Computer Science: Finite-State Systems},
  author = {S. Demri and V. Goranko and M. Lange},
  doi = {10.1017/CBO9781139236119},
  publisher = cup,
  series = {Cambridge Tracts in Theoretical Computer Science},
  year = {2016}
}

@article{degper21a,
  title = {Behavioral {QLTL}},
  author = {G. {D}e Giacomo and G. Perelli},
  journal = {CoRR},
  volume = {abs/2102.11184},
  year = {2021}
}

@inproceedings{degrhu09a,
  title = {A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming},
  author = {J. Delgrande and T. Grote and A. Hunter},
  crossref = {lpnmr09},
  pages = {355-367}
}

@inproceedings{dehana05a,
  title = {A Clause-Based Heuristic for {SAT} Solvers},
  author = {N. Dershowitz and Z. Hanna and A. Nadel},
  crossref = {sat05},
  pages = {46-60}
}

@inproceedings{dehana06a,
  title = {A scalable algorithm for minimal unsatisfiable core extraction},
  author = {N. Dershowitz and Z. Hanna and A. Nadel},
  crossref = {sat06},
  pages = {36-41}
}

@inproceedings{dehana07a,
  title = {Towards a Better Understanding of the Functionality of a Conflict-Driven {SAT} Solver},
  author = {N. Dershowitz and Z. Hanna and A. Nadel},
  crossref = {sat07},
  pages = {287-293}
}

@inproceedings{dehusc02a,
  title = {{COBA}: A consistency-based belief revision system},
  author = {J. Delgrande and A. Hunter and T. Schaub},
  crossref = {jelia02},
  pages = {509-512}
}

@article{dejasc92a,
  title = {Alternative Approaches to Default Logic},
  author = {J. Delgrande and T. Schaub and W. Jackson},
  journal = ai,
  number = {1-2},
  pages = {167-237},
  volume = {70},
  year = {1994}
}

@article{dekkon89a,
  title = {Eliminating the Fixed Predicates from a Circumscription},
  author = {J. de Kleer and K. Konolige},
  journal = ai,
  pages = {391-389},
  volume = {39},
  year = {1989}
}

@article{dekkur03a,
  title = {Fundamentals of model-based diagnosis},
  author = {J. {D}e Kleer and J. Kurien},
  journal = {{IFAC Proceedings}},
  number = {5},
  pages = {25-36},
  volume = {36},
  year = {2003}
}

@article{dekleer86a,
  title = {An Assumption-based Truth Maintenance System},
  author = {J. de Kleer},
  journal = ai,
  pages = {163-196},
  volume = {28},
  year = {1986}
}

@article{dekleer86b,
  title = {Extending the {ATMS}},
  author = {J. de Kleer},
  journal = ai,
  pages = {197-214},
  volume = {28},
  year = {1986}
}

@article{dekleer86c,
  title = {Problem-Solving with the {ATMS}},
  author = {J. de Kleer},
  journal = ai,
  pages = {215-224},
  volume = {28},
  year = {1986}
}

@inproceedings{delasc07a,
  title = {Belief change based on global minimisation},
  author = {J. Delgrande and J. Lang and T. Schaub},
  crossref = {ijcai07},
  pages = {2468-2473}
}

@inproceedings{delgrande87a,
  title = {A Logic for Representing Default and Prototypical Properties},
  author = {J. Delgrande},
  booktitle = ijcai,
  publisher = m-k,
  year = {1987}
}

@inproceedings{delgrande87b,
  title = {An Approach to Default Reasoning Based on a First-Order Conditional Logic},
  author = {J. Delgrande},
  booktitle = aaai,
  pages = {340-345},
  publisher = m-k,
  year = {1987}
}

@article{delgrande87c,
  title = {A First-Order Conditional Logic for Prototypical Properties},
  author = {J. Delgrande},
  journal = ai,
  pages = {105-130},
  volume = {33},
  year = {1987}
}

@article{delgrande88,
  title = {An Approach to Default Reasoning Based on a First Order Conditional Logic},
  author = {J. Delgrande},
  journal = ai,
  pages = {63-90},
  volume = {36},
  year = {1988}
}

@inproceedings{deliscth06a,
  title = {COBA~2.0: A Consistency-Based Belief Change System.},
  author = {J. Delgrande and D. Liu and T. Schaub and S. Thiele},
  crossref = {nmr06},
  pages = {267-273}
}

@inproceedings{deliscth07a,
  title = {{COBA~2.0}: A Consistency-Based Belief Change System},
  author = {J. Delgrande and D. Liu and T. Schaub and S. Thiele},
  crossref = {ecsqaru07},
  pages = {78-90}
}

@article{delitrve19a,
  title = {The informal semantics of Answer Set Programming: {A} Tarskian perspective},
  author = {M. Denecker and Y. Lierler and M. Truszczy{\'n}ski and J. Vennekens},
  journal = {CoRR},
  url = {http://arxiv.org/abs/1901.09125},
  volume = {abs/1901.09125},
  year = {2019}
}

@inproceedings{deljac91,
  title = {Default Logic Revisited},
  author = {J. Delgrande and W. Jackson},
  crossref = {kr91},
  pages = {118-127}
}

@article{delsch00a,
  title = {Expressing Preferences in Default Logic},
  author = {J. Delgrande and T. Schaub},
  journal = ai,
  number = {1-2},
  pages = {41-87},
  volume = {123},
  year = {2000}
}

@incollection{delsch00b,
  title = {The Role of Default Logic in Knowledge Representation},
  author = {J. Delgrande and T. Schaub},
  editor = {J. Minker},
  address = {Dordrecht},
  booktitle = {Logic-Based Artificial Intelligence},
  pages = {107-126},
  publisher = kluwer,
  year = {2000}
}

@inproceedings{delsch00c,
  title = {A Consistency-Based Model for Belief Change: Preliminary Report},
  author = {J. Delgrande and T. Schaub},
  booktitle = aaai,
  pages = {392-398},
  publisher = aaaimit,
  year = {2000}
}

@inproceedings{delsch01a,
  title = {How to reason credulously and skeptically within a single extension.},
  author = {J. Delgrande and T. Schaub},
  editor = {S. Benferhat and P. Besnard},
  booktitle = {Proceedings of the Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty},
  pages = {592-603},
  publisher = springer,
  series = lnai,
  year = {2001}
}

@article{delsch01c,
  title = {A Consistency-Based Paradigm for Belief Change},
  author = {J. Delgrande and T. Schaub},
  journal = ai,
  number = {1-2},
  pages = {1-41},
  volume = {151},
  year = {2003}
}

@article{delsch02a,
  title = {Reasoning credulously and skeptically within a single extension.},
  author = {J. Delgrande and T. Schaub},
  journal = jancl,
  number = {2},
  pages = {259-285},
  volume = {12},
  year = {2002}
}

@article{delsch02c,
  title = {Reasoning with Sets of Defaults in Default Logic},
  author = {J. Delgrande and T. Schaub},
  journal = ci,
  number = {1},
  pages = {56-88},
  volume = {20},
  year = {2004}
}

@inproceedings{delsch03a,
  title = {On the Relation between Reiter's Default Logic and its (major) Variants},
  author = {J. Delgrande and T. Schaub},
  editor = {T. Nielsen and N. Zhang},
  booktitle = {Proceedings of the Seventh European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty},
  pages = {452-463},
  publisher = springer,
  series = lnai,
  volume = {2711},
  year = {2003}
}

@inproceedings{delsch04a,
  title = {Two Approaches to Merging Knowledge Bases},
  author = {J. Delgrande and T. Schaub},
  crossref = {jelia04},
  pages = {426-438}
}

@inproceedings{delsch04b,
  title = {Consistency-Based Approaches to Merging Knowledge Bases},
  author = {J. Delgrande and T. Schaub},
  editor = {J. Delgrande and T. Schaub},
  booktitle = {Proceedings of the tenth International Workshop on Non-Monotonic Reasoning (NMR'04)},
  pages = {126-133},
  year = {2004}
}

@article{delsch05a,
  title = {Expressing Default Logic Variants in Default Logic},
  author = {J. Delgrande and T. Schaub},
  journal = jlc,
  number = {5},
  pages = {593-621},
  volume = {15},
  year = {2005}
}

@article{delsch07a,
  title = {A Consistency-Based Framework for Merging Knowledge Bases},
  author = {J. Delgrande and T. Schaub},
  journal = {Journal of Applied Logic},
  number = {3},
  pages = {459-477},
  volume = {5},
  year = {2007}
}

@techreport{delsch93a,
  title = {On Using System {Z} to Generate Prioritised Default Theories},
  author = {J. Delgrande and T. Schaub},
  institution = {IRISA},
  year = {1993}
}

@inproceedings{delsch93b,
  title = {On Using System {Z} to Generate Prioritised Default Theories},
  author = {J. Delgrande and T. Schaub},
  editor = {G. Brewka and C. Witteveen},
  booktitle = {Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications},
  volume = {1},
  year = {1993}
}

@inproceedings{delsch94a,
  title = {A General Approach to Specificity in Default Reasoning},
  author = {J. Delgrande and T. Schaub},
  crossref = {kr94},
  pages = {146-157}
}

@misc{delsch94b,
  title = {Towards Hybrid Nonmonotonic Reasoning Systems: A Position Paper},
  author = {J. Delgrande and T. Schaub},
  note = {Contribution to the Fifth International Workshop on Nonmonotonic Reasoning},
  year = {1994}
}

@inproceedings{delsch94c,
  title = {Incorporating Specificity into Circumscriptive Theories},
  author = {J. Delgrande and T. Schaub},
  editor = {B. Nebel and L. Dreschler-Fischer},
  booktitle = {Proceedings of the Eighteenth Annual German Conference on Artificial Intelligence (KI'94)},
  pages = {272-283},
  publisher = springer,
  series = lnai,
  volume = {861},
  year = {1994}
}

@inproceedings{delsch95a,
  title = {Towards Hybrid Nonmonotonic Reasoning Systems},
  author = {J. Delgrande and T. Schaub},
  editor = {J. Hallam},
  booktitle = {Hybrid Problems, Hybrid Solutions},
  pages = {39-50},
  publisher = ios,
  series = {Frontiers in Artificial Intelligence and Applications},
  volume = {27},
  year = {1995}
}

@article{delsch96a,
  title = {Compiling Specificity into Approaches to Nonmonotonic Reasoning},
  author = {J. Delgrande and T. Schaub},
  journal = ai,
  number = {1-2},
  pages = {301-348},
  volume = {90},
  year = {1997}
}

@inproceedings{delsch97a,
  title = {Compiling reasoning with and about preferences into default logic},
  author = {J. Delgrande and T. Schaub},
  editor = {M. Pollack},
  booktitle = ijcai,
  pages = {168-174},
  publisher = m-k,
  year = {1997}
}

@inproceedings{delsch98a,
  title = {Reasoning with Sets of Preferences in Default Logic},
  author = {J. Delgrande and T. Schaub},
  editor = {H. Lee and H. Motoda},
  booktitle = {Pacific Rim International Conference on Artificial Intelligence},
  pages = {134-145},
  publisher = springer,
  series = lnai,
  volume = {1531},
  year = {1998}
}

@inproceedings{delsch99a,
  title = {The Role of Default Logic in Knowledge Representation},
  author = {J. Delgrande and T. Schaub},
  booktitle = {Workshop on Logic-Based Artificial Intelligence},
  year = {1999}
}

@incollection{dematr00a,
  title = {Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning},
  author = {M. Denecker and V. Marek and M. Truszczy{\'n}ski},
  editor = {J. Minker},
  address = {Dordrecht},
  booktitle = {Logic-Based Artificial Intelligence},
  pages = {127-144},
  publisher = kluwer,
  year = {2000}
}

@article{dematr04a,
  title = {Ultimate approximation and its application in nonmonotonic knowledge representation systems},
  author = {M. Denecker and V. Marek and M. Truszczy{\'n}ski},
  journal = {Information and Computation},
  number = {1},
  pages = {84-121},
  volume = {192},
  year = {2004}
}

@inproceedings{dembjo08a,
  title = {{Z3}: An Efficient {SMT} Solver},
  author = {L. de Moura and N. Bj{\o}rner},
  crossref = {tacas08},
  pages = {337-340},
  url = {http://research.microsoft.com/projects/z3/z3.pdf}
}

@article{demepe91a,
  title = {Temporal Constraint Networks},
  author = {R. Dechter and I. Meiri and J. Pearl},
  journal = ai,
  number = {1-3},
  pages = {61-95},
  volume = {49},
  year = {1991}
}

@inproceedings{demibr92a,
  title = {Temporal Reasoning with Abductive Event Calculus},
  author = {M. Denecker and L. Missiaen and M. Bruynooghe},
  crossref = {ecai92},
  pages = {384-388}
}

@incollection{denkak02a,
  title = {Abduction in logic programming},
  author = {M. Denecker and A. Kakas},
  editor = {A. Kakas and F. Sadri},
  booktitle = {Computational logic: Logic programming and beyond},
  pages = {402-436},
  publisher = springer,
  year = {2002}
}

@article{denter08a,
  title = {A logic of nonmonotone inductive definitions},
  author = {M. Denecker and E. Ternovska},
  journal = tocl,
  number = {2},
  pages = {14:1-14:52},
  volume = {9},
  year = {2008}
}

@inproceedings{depebr01a,
  title = {Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates},
  author = {M. Denecker and N. Pelov and M. Bruynooghe},
  crossref = {iclp01},
  pages = {212-226}
}

@inproceedings{dereso98a,
  title = {Execution Monitoring of High-Level Robot Programs},
  author = {G. {D}e Giacomo and R. Reiter and M. Soutchanski},
  crossref = {kr98},
  pages = {453-465}
}

@inproceedings{descto00a,
  title = {Logic Programs with Compiled Preferences},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  editor = {C. Baral and M. Truszczy{\'n}ski},
  booktitle = {Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning},
  publisher = {\texttt{arXiv.org} e-Print archive},
  year = {2000}
}

@inproceedings{descto00b,
  title = {A Compiler for Ordered Logic Programs},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  editor = {C. Baral and M. Truszczy{\'n}ski},
  booktitle = {Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning},
  note = {System Abstract},
  publisher = {\texttt{arXiv.org} e-Print archive},
  year = {2000}
}

@inproceedings{descto00c,
  title = {Logic Programs with Compiled Preferences},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  editor = {W. Horn},
  booktitle = ecai,
  pages = {392-398},
  publisher = ios,
  year = {2000}
}

@inproceedings{descto00d,
  title = {A Compilation of {B}rewka and {E}iter's Approach to Prioritization},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  editor = {M. Ojeda-Aciego and I. Guzm{\'a}n and G. Brewka and L. Pereira},
  booktitle = {Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA'00)},
  pages = {376-390},
  publisher = springer,
  series = lnai,
  volume = {1919},
  year = {2000}
}

@inproceedings{descto01a,
  title = {A Generic Compiler for Ordered Logic Programs},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  crossref = {lpnmr01},
  pages = {411-415}
}

@article{descto02a,
  title = {A Framework for Compiling Preferences in Logic Programs},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  journal = tplp,
  number = {2},
  pages = {129-187},
  volume = {3},
  year = {2003}
}

@inproceedings{descto04a,
  title = {Domain-Specific Preferences for Causal Reasoning and Planning.},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  crossref = {kr04},
  pages = {673-682}
}

@inproceedings{descto05a,
  title = {A General Framework for Expressing Preferences in Causal Reasoning and Planning},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  crossref = {cs05},
  pages = {47-53}
}

@inproceedings{descto06a,
  title = {An Extended Query Language for Action Languages (and its Application to Aggregates and Preferences)},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  crossref = {nmr06},
  pages = {362-370}
}

@inproceedings{descto06b,
  title = {A Preference-Based Framework for Updating Logic Programs: Preliminary Report},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  crossref = {prefs06},
  pages = {31-44}
}

@article{descto07a,
  title = {A General Framework for Expressing Preferences in Causal Reasoning and Planning},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  journal = jlc,
  pages = {871-907},
  volume = {17},
  year = {2007}
}

@inproceedings{descto07b,
  title = {A Preference-Based Framework for Updating Logic Programs},
  author = {J. Delgrande and T. Schaub and H. Tompits},
  crossref = {lpnmr07},
  pages = {71-83}
}

@inproceedings{desctowa02a,
  title = {Towards a Classification of Preference Handling Approaches in Nonmonotonic Reasoning},
  author = {J. Delgrande and T. Schaub and H. Tompits and K. Wang},
  editor = {U. Junker},
  booktitle = {Proceedings of the Workshop on Preferences in Artificial Intelligence and Constraint Programming: Symbolic Approaches},
  pages = {16-24},
  publisher = {{AAAI} Press},
  year = {2002}
}

@article{desctowa03a,
  title = {A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning},
  author = {J. Delgrande and T. Schaub and H. Tompits and K. Wang},
  journal = ci,
  number = {2},
  pages = {308-334},
  volume = {20},
  year = {2004}
}

@inproceedings{desctowo01a,
  title = {On Computing Solutions to Belief Change Scenarios},
  author = {J. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  editor = {S. Benferhat and P. Besnard},
  booktitle = {Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty},
  pages = {510-521},
  publisher = springer,
  series = lnai,
  year = {2001}
}

@article{desctowo01b,
  title = {On Computing Belief Change Operations using Quantified {B}oolean Formulas},
  author = {J. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  journal = jlc,
  number = {6},
  pages = {801-826},
  volume = {14},
  year = {2004}
}

@inproceedings{desctowo08a,
  title = {Belief Revision of Logic Programs under Answer Set Semantics},
  author = {J. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  crossref = {kr08},
  pages = {411-421}
}

@inproceedings{desctowo09a,
  title = {Merging Logic Programs under Answer Set Semantics},
  author = {J. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  crossref = {iclp09},
  pages = {160-174}
}

@article{desctowo09b,
  title = {A Model-theoretic Approach to Belief Change in Answer Set Programming},
  author = {J. Delgrande and T. Schaub and H. Tompits and S. Woltran},
  journal = tocl,
  number = {2},
  pages = {14:1-14:46},
  volume = {14},
  year = {2013}
}

@inproceedings{dhfahata17a,
  title = {Enabling Integrated Product and Factory Configuration in Smart Production Ecosystems},
  author = {D. Dhungana and A. Falkner and A. Haselb{\"o}ck and R. Taupe},
  crossref = {seaa17},
  pages = {266-273}
}

@incollection{difuni01a,
  title = {Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations.},
  author = {J. Dix and U. Furbach and I. Niemel{\"a}},
  crossref = {ARHandbook},
  pages = {1241-1354}
}

@inproceedings{digelurosc17a,
  title = {plasp 3: Towards Effective {ASP} Planning},
  author = {Y. Dimopoulos and M. Gebser and P. L{\"u}hne and J. Romero and T. Schaub},
  crossref = {lpnmr17},
  pages = {286-300}
}

@article{digelurosc18a,
  title = {plasp 3: Towards Effective {ASP} Planning},
  author = {Y. Dimopoulos and M. Gebser and P. L{\"u}hne and J. Romero and T. Schaub},
  journal = tplp,
  number = {3},
  pages = {477-504},
  volume = {19},
  year = {2019}
}

@article{digipa04a,
  title = {Generalizing {B}oolean Satisfiability {I}: Background and Survey of Existing Work},
  author = {H. Dixon and M. Ginsberg and A. Parkes},
  journal = jair,
  pages = {193-243},
  volume = {21},
  year = {2004}
}

@book{dihoko07a,
  title = {Dynamic Epistemic Logic},
  author = {H. van Ditmarsch and W. van der Hoek and B. Kooi},
  publisher = springer,
  year = {2007}
}

@inproceedings{dikuna05a,
  title = {Planning in Answer Set Programming using Ordered Task Decomposition},
  author = {J. Dix and U. Kuter and D. Nau},
  crossref = {wwst05},
  pages = {521-576}
}

@misc{dimacs,
  title = {Satisfiability Suggested Format},
  howpublished = {ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/doc/},
  key = {dimacs},
  publisher = {DIMACS Center for Discrete Mathematics and Theoretical Computer Science},
  year = {1993}
}

@inproceedings{dimkak95a,
  title = {Logic Programming without Negation as Failure},
  author = {Y. Dimopoulos and A. Kakas},
  editor = {J. Lloyd},
  booktitle = {Proceedings of the International Symposium of Logic Programming},
  pages = {369-383},
  publisher = {MIT Press},
  year = {1995}
}

@article{dimmag94,
  title = {A Graph-Theoretic Approach to Default Logic},
  author = {Y. Dimopoulos and V. Magirou},
  journal = {Information and Computation},
  pages = {239-256},
  publisher = {Academic Press},
  volume = {112},
  year = {1994}
}

@inproceedings{dimopoulos93a,
  title = {The Computational Value of Joint Consistency},
  author = {Y. Dimopoulos},
  editor = {G. Brewka and C. Witteveen},
  booktitle = {Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications},
  year = {1993}
}

@inproceedings{dimopoulos93b,
  title = {The Computational Value of Joint Consistency},
  author = {Y. Dimopoulos},
  editor = {L. Pereira and D. Pearce},
  booktitle = {European Workshop on Logics in Artificial Intelligence (JELIA'94)},
  pages = {50-65},
  publisher = springer,
  series = lnai,
  volume = {838},
  year = {1994}
}

@inproceedings{dimsid02a,
  title = {Towards Local Search for Answer Sets.},
  author = {Y. Dimopoulos and A. Sideris},
  crossref = {iclp02},
  pages = {363-377}
}

@article{dimtor96,
  title = {Graph theoretical structures in logic programs and default theories},
  author = {Y. Dimopoulos and A. Torres},
  journal = tcs,
  pages = {209-244},
  publisher = elsevier,
  volume = {170},
  year = {1996}
}

@inproceedings{dineko97a,
  title = {Encoding Planning Problems in Nonmonotonic Logic Programs},
  author = {Y. Dimopoulos and B. Nebel and J. K{\"o}hler},
  editor = {S. Steel and R. Alami},
  booktitle = {Proceedings of the Fourth European Conference on Planning},
  pages = {169-181},
  publisher = springer,
  series = lnai,
  url = {citeseer.nj.nec.com/dimopoulos97encoding.html},
  volume = {1348},
  year = {1997}
}

@inproceedings{ditrza12a,
  title = {Formal Aspects of Free and Open Source Software Components: A Short Survey},
  author = {R. {D}i Cosmo and R. Treinen and S. Zacchiroli},
  editor = {E. Giachino and R. H{\"a}hnle and F. de Boer and M. Bonsangue},
  booktitle = {Proceedings of the Eleventh International Symposium on Formal Methods for Components and Objects (FMCO'12)},
  pages = {216-239},
  publisher = springer,
  series = lncs,
  volume = {7866},
  year = {2012}
}

@inproceedings{dix92a,
  title = {On Cumulativity in Default Logic and its Relation to {P}oole's Approach},
  author = {J. Dix},
  editor = {B. Neumann},
  booktitle = ecai,
  pages = {289-293},
  publisher = wiley,
  year = {1992}
}

@inproceedings{dix92b,
  title = {A Framework for Representing and Characterizing Semantics of Logic Programs},
  author = {J. Dix},
  crossref = {kr92},
  pages = {591-602}
}

@article{dlv03a,
  title = {The {DLV} System for Knowledge Representation and Reasoning},
  author = {N. Leone and G. Pfeifer and W. Faber and T. Eiter and G. Gottlob and S. Perri and F. Scarcello},
  journal = tocl,
  number = {3},
  pages = {499-562},
  volume = {7},
  year = {2006}
}

@article{dlv18a,
  title = {The {ASP} System {DLV}: Advancements and Applications},
  author = {W. Adrian and M. Alviano and F. Calimeri and B. Cuteri and C. Dodaro and W. Faber and D. Fusc{\`{a}} and N. Leone and M. Manna and S. Perri and F. Ricca and P. Veltri and J. Zangari},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {177-179},
  volume = {32},
  year = {2018}
}

@inproceedings{dlv97a,
  title = {A Deductive System for Nonmonotonic Reasoning},
  author = {T. Eiter and N. Leone and C. Mateis and G. Pfeifer and F. Scarcello},
  crossref = {lpnmr97},
  pages = {363-374}
}

@misc{dlvManual,
  title = {{DLV} --- User Manual},
  author = {R. Bihlmeyer and W. Faber and G. Ielpa and V. Lio and G. Pfeifer},
  key = {dlv},
  url = {http://www.dlvsystem.com/man}
}

@inproceedings{dodmar17a,
  title = {Nurse Scheduling via Answer Set Programming},
  author = {C. Dodaro and M. Maratea},
  crossref = {lpnmr17},
  doi = {10.1007/978-3-319-61660-5\_27},
  pages = {301-307}
}

@article{dodric20a,
  title = {The External Interface for Extending {WASP}},
  author = {C. Dodaro and F. Ricca},
  journal = tplp,
  number = {2},
  pages = {225-248},
  volume = {20},
  year = {2020}
}

@inproceedings{dofopo05a,
  title = {A Comparison of {CLP(FD)} and {ASP} Solutions to {NP}-Complete Problems},
  author = {A. Dovier and A. Formisano and E. Pontelli},
  crossref = {iclp05},
  pages = {67-82}
}

@inproceedings{dofopo07a,
  title = {Multivalued Action Languages with Constraints in {CLP(FD)}},
  author = {A. Dovier and A. Formisano and E. Pontelli},
  crossref = {iclp07},
  pages = {255-270}
}

@article{dofopo09a,
  title = {An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems},
  author = {A. Dovier and A. Formisano and E. Pontelli},
  journal = {Journal of Experimental and Theoretical Artificial Intelligence},
  number = {2},
  pages = {79-121},
  volume = {21},
  year = {2009}
}

@article{dofopo10a,
  title = {Multivalued action languages with constraints in {CLP(FD)}},
  author = {A. Dovier and A. Formisano and E. Pontelli},
  journal = tplp,
  number = {2},
  pages = {167-235},
  volume = {10},
  year = {2010}
}

@article{dogagrmamopo21a,
  title = {An {ASP}-based Solution to the Chemotherapy Treatment Scheduling Problem},
  author = {C. Dodaro and G. Galat{\`{a}} and A. Grioni and M. Maratea and M. Mochi and I. Porro},
  doi = {10.1017/S1471068421000363},
  journal = tplp,
  number = {6},
  pages = {835-851},
  volume = {21},
  year = {2021}
}

@inproceedings{dogakhmapo19a,
  title = {An {ASP}-based Solution for Operating Room Scheduling with Beds Management},
  author = {C. Dodaro and G. Galat{\`{a}} and M. Khan and M. Maratea and I. Porro},
  crossref = {ruleml19},
  pages = {67-81}
}

@article{dogalemurisc16a,
  title = {Combining Answer Set Programming and domain heuristics for solving hard industrial problems},
  author = {C. Dodaro and P. Gasteiger and N. Leone and B. Musitsch and F. Ricca and K. Schekotihin},
  journal = tplp,
  number = {5-6},
  pages = {653-669},
  volume = {16},
  year = {2016}
}

@article{dogalemurisc16b,
  title = {Combining Answer Set Programming and domain heuristics for solving hard industrial problems},
  author = {C. Dodaro and P. Gasteiger and N. Leone and B. Musitsch and F. Ricca and K. Schekotihin},
  journal = tplp,
  number = {5-6},
  pages = {653-669},
  volume = {16},
  year = {2016}
}

@article{dogarerisc19a,
  title = {Debugging Non-Ground {ASP} Programs: Technique and Graphical Tools},
  author = {C. Dodaro and P. Gasteiger and K. Reale and F. Ricca and K. Schekotihin},
  doi = {10.1017/S1471068418000492},
  journal = tplp,
  number = {2},
  pages = {290-316},
  volume = {19},
  year = {2019}
}

@inproceedings{dohakrru11a,
  title = {Software Verification Using k-Induction},
  author = {A. Donaldson and L. Haller and D. Kroening and P. R{\"u}mmer},
  booktitle = {Static Analysis Symposium (SAS'11)},
  pages = {351-368},
  publisher = springer,
  series = lncs,
  volume = {6887},
  year = {2011}
}

@article{dokam03a,
  title = {Sapa: {A} Multi-objective Metric Temporal Planner},
  author = {M. Do and S. Kambhampati},
  journal = jair,
  pages = {155-194},
  volume = {20},
  year = {2003}
}

@inproceedings{dolenari15a,
  title = {Allotment Problem in Travel Industry: A Solution Based on {ASP}},
  author = {C. Dodaro and N. Leone and B. Nardi and F. Ricca},
  crossref = {rr15},
  pages = {77-92}
}

@inproceedings{dololi11a,
  title = {Answer Set Programming for Stream Reasoning},
  author = {T. Do and S. Loke and F. Liu},
  crossref = {ai11},
  pages = {104-109}
}

@article{dolusz97a,
  title = {Computing Circumscription revisited: A reduction algorithm},
  author = {P. Doherty and W. {\L}ukaszewicz and A. Szalas},
  journal = jar,
  pages = {297-334},
  volume = {18},
  year = {1997}
}

@inproceedings{doporo03a,
  title = {Intensional Sets in {CLP}},
  author = {A. Dovier and E. Pontelli and G. Rossi},
  crossref = {iclp03},
  pages = {284-299},
  year = {2003}
}

@inproceedings{dorisc16a,
  title = {External propagators in wasp: Preliminary report},
  author = {C. Dodaro and F. Ricca and P. Sch{\"u}ller},
  booktitle = {Proceedings of the Twenty-third International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'16)},
  pages = {1-9},
  publisher = {CEUR Workshop Proceedings},
  volume = {1745},
  year = {2016}
}

@book{dovpon10a,
  title = {A 25-Year Perspective on Logic Programming},
  editor = {A. Dovier and E. Pontelli},
  publisher = springer,
  series = lncs,
  volume = {6125},
  year = {2010}
}

@article{dowgal84a,
  title = {Linear-time algorithms for testing the satisfiability of propositional {H}orn formulae},
  author = {W. Dowling and J. Gallier},
  journal = jlp,
  pages = {267-284},
  volume = {1},
  year = {1984}
}

@article{doyle79a,
  title = {A Truth Maintenance System},
  author = {J. Doyle},
  journal = ai,
  pages = {231-272},
  volume = {12},
  year = {1979}
}

@inproceedings{doyle90a,
  title = {Rational Belief Revision (Extended Abstract)},
  author = {J. Doyle},
  editor = {K. Konolige},
  booktitle = {Third International Workshop on Nonmonotonic Reasoning},
  pages = {272-281},
  year = {1989}
}

@article{doywel91a,
  title = {Impediments to Universal Preference-Based Default Theories},
  author = {J. Doyle and M. Wellman},
  journal = ai,
  number = {1-3},
  pages = {97-128},
  volume = {49},
  year = {1991}
}

@article{drefre89,
  title = {Truth Maintenance Systeme},
  author = {O. Dressler and H. Freitag},
  journal = {K{\"u}nstliche Intelligenz},
  pages = {13-19},
  volume = {2},
  year = {1989}
}

@phdthesis{drescher15a,
  title = {Conflict-driven constraint answer set solving},
  author = {C. Drescher},
  school = {Computer Science and Engineering, Faculty of Engineering, UNSW},
  year = {2015}
}

@inproceedings{dressler90,
  title = {Problem Solving with the {NM}-{ATMS}},
  author = {O. Dressler},
  editor = {K. Konolige},
  booktitle = {Third International Workshop on Nonmonotonic Reasoning},
  pages = {44-57},
  year = {1990}
}

@article{drethi11a,
  title = {{ALPprolog} --- A new logic programming method for dynamic domains},
  author = {C. Drescher and M. Thielscher},
  journal = tplp,
  number = {4-5},
  pages = {451-468},
  volume = {11},
  year = {2011}
}

@article{drewal10a,
  title = {A Translational Approach to Constraint Answer Set Solving},
  author = {C. Drescher and T. Walsh},
  doi = {10.1017/S1471068410000220},
  journal = tplp,
  number = {4-6},
  pages = {465-480},
  volume = {10},
  year = {2010}
}

@inproceedings{drewal12a,
  title = {Answer Set Solving with Lazy Nogood Generation},
  author = {C. Drescher and T. Walsh},
  crossref = {iclp-lipics12},
  pages = {188-200}
}

@inproceedings{drewal13a,
  title = {Efficient Approximation of Well-Founded Justification and Well-Founded Domination},
  author = {C. Drescher and T. Walsh},
  crossref = {lpnmr13},
  pages = {277-289}
}

@inproceedings{drgegrkakoossc08a,
  title = {Conflict-Driven Disjunctive Answer Set Solving},
  author = {C. Drescher and M. Gebser and T. Grote and B. Kaufmann and A. K{\"o}nig and M. Ostrowski and T. Schaub},
  crossref = {kr08},
  pages = {422-432}
}

@inproceedings{drgekasc08a,
  title = {Heuristics in Conflict Resolution},
  author = {C. Drescher and M. Gebser and B. Kaufmann and T. Schaub},
  crossref = {nmr08},
  pages = {141-149}
}

@inproceedings{drtiwa10a,
  title = {Symmetry-breaking answer set solving},
  author = {C. Drescher and O. Tifrea and T. Walsh},
  editor = {M. Balduccini and S. Woltran},
  booktitle = {Proceedings of ICLP'10 Workshop on Answer Set Programming and Other Computing Paradigm},
  year = {2010}
}

@article{drtiwa11a,
  title = {Symmetry-breaking answer set solving},
  author = {C. Drescher and O. Tifrea and T. Walsh},
  journal = aicom,
  number = {2},
  pages = {177-194},
  volume = {24},
  year = {2011}
}

@inproceedings{dulefamirexu16a,
  title = {Spot 2.0 - {A} Framework for {LTL} and $\omega$-automata Manipulation},
  author = {A. Duret-Lutz and A. Lewkowicz and A. Fauchille and T. Michaud and E. Renault and L. Xu},
  editor = {C. Artho and A. Legay and D. Peled},
  booktitle = {Proceedings of Fourteenth International Symposium on Automated Technology for Verification and Analysis (ATVA'16)},
  doi = {10.1007/978-3-319-46520-3\_8},
  pages = {122-129},
  series = lncs,
  volume = {9938},
  year = {2016}
}

@article{dumaosscwa11a,
  title = {Automatic Network Reconstruction using {ASP}},
  author = {M. Durzinsky and W. Marwan and M. Ostrowski and T. Schaub and A. Wagler},
  journal = tplp,
  number = {4-5},
  pages = {749-766},
  volume = {11},
  year = {2011}
}

@inproceedings{dume06a,
  title = {A Fast Linear-Arithmetic Solver for {DPLL(T)}},
  author = {B. Dutertre and L. {Mendon{\c{c}}a de Moura}},
  crossref = {cav06},
  pages = {81-94}
}

@book{dummett77,
  title = {Elements of intuitionism},
  author = {M. Dummett},
  publisher = {Oxford University Press},
  year = {1977}
}

@article{dung95a,
  title = {On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and $n$-person games},
  author = {P. Dung},
  journal = ai,
  number = {2},
  pages = {321-357},
  volume = {77},
  year = {1995}
}

@article{dung95b,
  title = {An Argumentation-theoretic Foundation For Logic Programming},
  author = {P. Dung},
  journal = jlp,
  pages = {151-177},
  year = {1995}
}

@inproceedings{durfee01a,
  title = {Distributed Problem Solving and Planning},
  author = {E. Durfee},
  booktitle = {Multi-Agent Systems and Applications: Selected Tutorial Papers of the Ninth {ECCAI} Advanced Course ({ACAI}'01) and Agent Link's Third European Agent Systems Summer School, ({EASSS'01})},
  pages = {118-149},
  year = {2001}
}

@incollection{durfee99a,
  title = {Distributed Problem Solving and Planning},
  author = {E. Durfee},
  editor = {G. Weiss},
  booktitle = {Muliagent Systems: A Modern Approach to Distributed Artificial Intelligence},
  pages = {121-164},
  publisher = {MIT Press},
  year = {1999}
}

@inproceedings{dvgawawo11a,
  title = {Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems},
  author = {W. Dvo{\v{r}}{\'a}k and S. Gaggl and J. Wallner and S. Woltran},
  crossref = {inap11},
  pages = {117-130}
}

@inproceedings{dvrawalwo20a,
  title = {{ASPARTIX-V19} - An Answer-Set Programming Based System for Abstract Argumentation},
  author = {W. Dvor{\'a}k and A. Rapberger and J. Wallner and S. Woltran},
  crossref = {foiks20},
  pages = {79-89},
  year = {2020}
}

@inproceedings{dwgrkoscve08a,
  title = {Tools for Representing and Reasoning about Biological Models in Action Language $\mathcal{C}$},
  author = {S. Dworschak and T. Grote and A. K{\"o}nig and T. Schaub and P. Veber},
  crossref = {nmr08},
  pages = {94-102}
}

@inproceedings{dwgrkoscve08b,
  title = {The System {BioC} for Reasoning about Biological Models in Action Language $\mathcal{C}$},
  author = {S. Dworschak and T. Grote and A. K{\"o}nig and T. Schaub and P. Veber},
  booktitle = {Proceedings of the Twentieth International Conference on Tools with Artificial Intelligence (ICTAI'08)},
  pages = {11-18},
  publisher = ieee,
  volume = {1},
  year = {2008}
}

@article{dwgrniscse07a,
  title = {Modeling biological networks by action languages via answer set programming},
  author = {S. Dworschak and S. Grell and V. Nikiforova and T. Schaub and J. Selbig},
  journal = {Constraints},
  number = {1-2},
  pages = {21-65},
  volume = {13},
  year = {2008}
}

@inproceedings{eastru00a,
  title = {DATALOG with Constraints --- An Answer-Set Programming System.},
  author = {D. East and M. Truszczy{\'n}ski},
  booktitle = aaai,
  pages = {163-168},
  publisher = aaaimit,
  year = {2000}
}

@inproceedings{eastru01a,
  title = {Propositional Satisfiability in Answer-Set Programming},
  author = {D. East and M. Truszczy{\'n}ski},
  editor = {F. Baader and G. Brewka and T. Eiter},
  booktitle = {Proceedings of the Joint German/Austrian Conference on Artificial Intelligence (KI'01)},
  pages = {138-153},
  publisher = springer,
  series = lnai,
  volume = {2174},
  year = {2001}
}

@inproceedings{easyreach13a,
  title = {Fostering Social Interaction of Home-Bound Elderly People: The \textit{{E}asy{R}each} System},
  author = {R. Bisiani and D. Merico and S. Pinardi and M. Dominoni and A. Cesta and A. Orlandini and R. Rasconi and M. Suriano and A. Umbrico and O. Sabuncu and T. Schaub and D. D'Aloisi and R. Nicolussi and F. Papa and V. Bouglas and G. Giakas and T. Kavatzikidis and S. Bonfiglio},
  crossref = {ieaaie13},
  pages = {33-42}
}

@book{ebflth78,
  title = {Einf{\"u}hrung in die Mathematische Logik},
  author = {H. Ebbinghaus and J. Flum and W. Thomas},
  address = {Darmstadt},
  publisher = {Wissenschaftliche Buchgesellschaft},
  year = {1978}
}

@book{ebflth96a,
  title = {Einf{\"u}hrung in die mathematische Logik},
  author = {H. Ebbinghaus and J. Flum and W. Thomas},
  address = {Heidelberg, Berlin, Oxford},
  publisher = {Spektrum akademischer Verlag},
  year = {1996}
}

@article{ebhahe04a,
  title = {Structural Analysis of Expanding Metabolic Networks},
  author = {O. Ebenh{\"o}h and T. Handorf and R. Heinrich},
  journal = {Genome Informatics},
  number = {1},
  pages = {35-45},
  volume = {15},
  year = {2004}
}

@misc{ebnf,
  title = {Extended {B}ackus-{N}aur Form},
  key = {ebnf},
  url = {http://standards.iso.org/ittf/PubliclyAvailableStandards/s026153\_ISO\_IEC\_14977\_1996(E).zip},
  year = {1996}
}

@techreport{edehof04a,
  title = {{PDDL}2.2: The Language for the Classical Part of the 4th International Planning Competition},
  author = {S. Edelkamp and J. Hoffmann},
  institution = {Institute of Informatics, University of Freiburg},
  number = {195},
  year = {2004}
}

@techreport{eder84a,
  title = {An Implementation of a Theorem Prover based on the Connection Method},
  author = {E. Eder},
  institution = tum,
  note = {IX},
  number = {ATP-33-VII-84},
  year = {1984}
}

@inproceedings{eder91,
  title = {Consolution and its Relation with Resolution},
  author = {E. Eder},
  booktitle = ijcai,
  pages = {132-136},
  publisher = m-k,
  year = {1991}
}

@book{eder92,
  title = {Relative Complexities of First Order Calculi},
  author = {E. Eder},
  address = {Braunschweig},
  publisher = {Vieweg Verlag},
  year = {1992}
}

@inproceedings{eenbie05a,
  title = {Effective Preprocessing in {SAT} Through Variable and Clause Elimination},
  author = {N. E{\'e}n and A. Biere},
  crossref = {sat05},
  pages = {61-75}
}

@inproceedings{eensor03a,
  title = {An Extensible {SAT}-solver},
  author = {N. E{\'e}n and N. S{\"o}rensson},
  crossref = {sat03},
  pages = {502-518}
}

@article{eensor03b,
  title = {Temporal Induction by Incremental {SAT} Solving},
  author = {N. E{\'e}n and N. S{\"o}rensson},
  journal = {Electronic Notes in Theoretical Computer Science},
  number = {4},
  volume = {89},
  year = {2003}
}

@article{eensor06a,
  title = {Translating Pseudo-{B}oolean Constraints into {SAT}},
  author = {N. E{\'e}n and N. S{\"o}rensson},
  journal = jsat,
  pages = {1-26},
  volume = {2},
  year = {2006}
}

@inproceedings{egeitowo00a,
  title = {Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas},
  author = {U. Egly and T. Eiter and H. Tompits and S. Woltran},
  crossref = {aaai00},
  pages = {417-422}
}

@inproceedings{eggawo08a,
  title = {{ASPARTIX}: Implementing Argumentation Frameworks Using Answer-Set Programming},
  author = {U. Egly and S. Gaggl and S. Woltran},
  crossref = {iclp08},
  pages = {734-738}
}

@article{eggawo10a,
  title = {Answer-Set Programming Encodings for Argumentation Frameworks},
  author = {U. Egly and S. Gaggl and S. Woltran},
  journal = {Argument and Computation},
  number = {2},
  pages = {144-177},
  volume = {1},
  year = {2010}
}

@inproceedings{eglrat96a,
  title = {On the Practical Value of Different Definitional Translations to Normal Form.},
  author = {U. Egly and T. Rath},
  crossref = {cade96},
  pages = {403-417}
}

@inproceedings{eiererfi09a,
  title = {Finding Similar or Diverse Solutions in Answer Set Programming},
  author = {T. Eiter and E. Erdem and H. Erdogan and M. Fink},
  crossref = {iclp09},
  pages = {342-356}
}

@article{eiererfi13a,
  title = {Finding similar/diverse solutions in answer set programming},
  author = {T. Eiter and E. Erdem and H. Erdogan and M. Fink},
  journal = tplp,
  number = {3},
  pages = {303-359},
  volume = {13},
  year = {2013}
}

@article{eifalepf03a,
  title = {Computing preferred answer sets by meta-interpretation in answer set programming},
  author = {T. Eiter and W. Faber and N. Leone and G. Pfeifer},
  journal = tplp,
  number = {4-5},
  pages = {463-498},
  volume = {3},
  year = {2003}
}

@article{eifalepf99a,
  title = {The Diagnosis Frontend of the dlv System},
  author = {T. Eiter and W. Faber and N. Leone and G. Pfeifer},
  journal = aicom,
  number = {1-2},
  pages = {99-111},
  url = {citeseer.nj.nec.com/article/eiter99diagnosis.html},
  volume = {12},
  year = {1999}
}

@incollection{eifalepfpo00a,
  title = {Planning under Incomplete Knowledge},
  author = {T. Eiter and W. Faber and N. Leone and G. Pfeifer and A. Polleres},
  crossref = {cl00},
  pages = {807-821}
}

@article{eifalepfpo03a,
  title = {A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity},
  author = {T. Eiter and W. Faber and N. Leone and G. Pfeifer and A. Polleres},
  journal = tocl,
  number = {2},
  pages = {206-263},
  volume = {5},
  year = {2004}
}

@article{eifalepfpo03b,
  title = {A Logic Programming Approach to Knowledge-State Planning},
  author = {T. Eiter and W. Faber and N. Leone and G. Pfeifer and A. Polleres},
  journal = ai,
  number = {1-2},
  pages = {157-211},
  volume = {144},
  year = {2003}
}

@article{eifalepfpo03c,
  title = {Answer Set Planning Under Action Costs},
  author = {T. Eiter and W. Faber and N. Leone and G. Pfeifer and A. Polleres},
  journal = jair,
  pages = {25-71},
  volume = {19},
  year = {2003}
}

@article{eifikrre12a,
  title = {Conflict-driven {ASP} solving with external sources},
  author = {T. Eiter and M. Fink and T. Krennwallner and C. Redl},
  journal = tplp,
  number = {4-5},
  pages = {659-679},
  volume = {12},
  year = {2012}
}

@inproceedings{eifikrre13a,
  title = {Grounding {HEX}-Programs with Expanding Domains},
  author = {T. Eiter and M. Fink and T. Krennwallner and C. Redl},
  editor = {D. Pearce and S. Tasharrofi and E. Ternovska and C. Vidal},
  booktitle = {Second Workshop on Grounding and Transformations for Theories with Variables (GTTV'13)},
  pages = {3-15},
  year = {2013}
}

@inproceedings{eifisato00a,
  title = {Considerations on Updates of Logic Programs},
  author = {T. Eiter and M. Fink and G. Sabbatini and H. Tompits},
  booktitle = {Proceedings of the Seventh European Workshop on Logics in Artificial Intelligence (JELIA'00)},
  pages = {2-20},
  publisher = springer,
  series = lnai,
  volume = {1919},
  year = {2000}
}

@inproceedings{eifisato01a,
  title = {A Generic Approach for Knowledge-Based Information-Site Selection},
  author = {T. Eiter and M. Fink and G. Sabbatini and H. Tompits},
  crossref = {kr02},
  pages = {459-469}
}

@article{eifisato02a,
  title = {On properties of update sequences based on causal rejection},
  author = {T. Eiter and M. Fink and G. Sabbatini and H. Tompits},
  journal = tplp,
  number = {6},
  pages = {711-767},
  volume = {2},
  year = {2002}
}

@inproceedings{eifisc11a,
  title = {Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems},
  author = {T. Eiter and M. Fink and P. Sch{\"u}ller},
  crossref = {lpnmr11},
  pages = {107-119}
}

@inproceedings{eifiscwe10a,
  title = {Finding Explanations of Inconsistency in Multi-Context Systems},
  author = {T. Eiter and M. Fink and P. Sch{\"u}ller and A. Weinzierl},
  crossref = {kr10}
}

@inproceedings{eifitowo04a,
  title = {Simplifying Logic Programs Under Uniform and Strong Equivalence},
  author = {T. Eiter and M. Fink and H. Tompits and S. Woltran},
  crossref = {lpnmr04},
  pages = {87-99}
}

@inproceedings{eifitowo07a,
  title = {Complexity Results for Checking Equivalence of Stratified Logic Programs},
  author = {T. Eiter and M. Fink and H. Tompits and S. Woltran},
  crossref = {ijcai07},
  pages = {330-335}
}

@inproceedings{eigehimuoest22a,
  title = {Large-Neighbourhood Search for Optimisation in Answer-Set Solving},
  author = {T. Eiter and T. Geibinger and N. {Higuera Ruiz} and N. Musliu and J. Oetsch and D. Stepanova},
  crossref = {aaai22},
  doi = {10.1609/AAAI.V36I5.20502},
  pages = {5616-5625}
}

@inproceedings{eigehimuoest22b,
  title = {{ALASPO:} An Adaptive Large-Neighbourhood {ASP} Optimiser},
  author = {T. Eiter and T. Geibinger and N. {Higuera Ruiz} and N. Musliu and J. Oetsch and D. Stepanova},
  crossref = {kr22},
  url = {https://proceedings.kr.org/2022/58/}
}

@article{eigeiakarescwe18a,
  title = {The {DLVHEX} System},
  author = {T. Eiter and S. Germano and G. Ianni and T. Kaminski and C. Redl and P. Sch{\"u}ller and A. Weinzierl},
  doi = {10.1007/s13218-018-0535-y},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {187-189},
  volume = {32},
  year = {2018}
}

@inproceedings{eigemuoeskst21a,
  title = {Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling},
  author = {T. Eiter and T. Geibinger and N. Musliu and J. Oetsch and P. Skocovsk{\'y} and D. Stepanova},
  crossref = {kr21},
  doi = {10.24963/kr.2021/27},
  pages = {280-290}
}

@inproceedings{eigoma94a,
  title = {Expressive Power and Complexity of Disjunctive {D}atalog under the Stable Model Semantics},
  author = {T. Eiter and G. Gottlob and H. Mannila},
  crossref = {iski94},
  pages = {83-103}
}

@inproceedings{eiiakr09a,
  title = {{A}nswer {S}et {P}rogramming: {A} {P}rimer},
  author = {T. Eiter and G. Ianni and T. Krennwallner},
  editor = {S. Tessaris and E. Franconi and T. Eiter and C. Gutierrez and S. Handschuh and M. Rousset and R. Schmidt},
  booktitle = {Fifth International Reasoning Web Summer School (RW'09)},
  note = {Slides at http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-lecture.zip},
  pages = {40-110},
  publisher = springer,
  series = lncs,
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-asp.pdf},
  volume = {5689},
  year = {2009}
}

@article{eiialuscto08a,
  title = {Combining answer set programming with description logics for the Semantic Web},
  author = {T. Eiter and G. Ianni and T. Lukasiewicz and R. Schindlauer and H. Tompits},
  journal = ai,
  number = {12-13},
  pages = {1495-1539},
  volume = {172},
  year = {2008}
}

@inproceedings{eiiascto05a,
  title = {A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming},
  author = {T. Eiter and G. Ianni and R. Schindlauer and H. Tompits},
  crossref = {ijcai05},
  pages = {90-96}
}

@inproceedings{eiiascto06a,
  title = {{DLVHEX}: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics},
  author = {T. Eiter and G. Ianni and R. Schindlauer and H. Tompits},
  crossref = {wi06},
  pages = {1073-1074}
}

@article{eikarewe18a,
  title = {Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access},
  author = {T. Eiter and T. Kaminski and C. Redl and A. Weinzierl},
  journal = jair,
  pages = {665-727},
  volume = {62},
  year = {2018}
}

@inproceedings{eilemapfsc98a,
  title = {A {KR} system dlv: Progress report, comparisons and benchmarks},
  author = {T. Eiter and N. Leone and C. Mateis and G. Pfeifer and F. Scarcello},
  crossref = {kr98},
  pages = {406-417}
}

@inproceedings{eitfin03a,
  title = {Uniform Equivalence of Logic Programs under the Stable Model Semantics},
  author = {T. Eiter and M. Fink},
  crossref = {iclp03},
  pages = {224-238}
}

@article{eitgot92a,
  title = {On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals},
  author = {T. Eiter and G. Gottlob},
  journal = ai,
  pages = {227-270},
  volume = {57},
  year = {1992}
}

@article{eitgot93a,
  title = {Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$-complete},
  author = {G. Gottlob and T. Eiter},
  journal = tcs,
  pages = {231-245},
  volume = {114},
  year = {1993}
}

@article{eitgot95a,
  title = {On the Computational Cost of Disjunctive Logic Programming: Propositional Case},
  author = {T. Eiter and G. Gottlob},
  journal = amai,
  number = {3-4},
  pages = {289-323},
  volume = {15},
  year = {1995}
}

@article{eitgot95b,
  title = {The Complexity of Logic-Based Abduction},
  author = {T. Eiter and G. Gottlob},
  journal = jacm,
  pages = {3-42},
  volume = {42},
  year = {1995}
}

@article{eitkie20a,
  title = {ASP(\ensuremath{\mathcal{AC}}): Answer Set Programming with Algebraic Constraints},
  author = {T. Eiter and R. Kiesel},
  doi = {10.1017/S1471068420000393},
  journal = tplp,
  number = {6},
  pages = {895-910},
  volume = {20},
  year = {2020}
}

@inproceedings{eitkie20b,
  title = {Weighted {LARS} for Quantitative Stream Reasoning},
  author = {T. Eiter and R. Kiesel},
  crossref = {ecai20},
  doi = {10.3233/FAIA200160},
  pages = {729-736}
}

@inproceedings{eitowo05a,
  title = {On Solution Correspondences in Answer Set Programming},
  author = {T. Eiter and H. Tompits and S. Woltran},
  crossref = {ijcai05},
  pages = {97-102}
}

@article{eitpol06a,
  title = {Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications},
  author = {T. Eiter and A. Polleres},
  journal = tplp,
  number = {1-2},
  pages = {23-60},
  volume = {6},
  year = {2006}
}

@inproceedings{eitsim09a,
  title = {Bidirectional Answer Set Programs with Function Symbols},
  author = {T. Eiter and M. {\v Simkus}},
  crossref = {ijcai09},
  pages = {765-771}
}

@inproceedings{elalge23a,
  title = {Hybrid {ASP}-Based Multi-objective Scheduling of Semiconductor Manufacturing Processes},
  author = {M. El-Kholany and R. Ali and M. Gebser},
  crossref = {jelia23},
  pages = {243-252}
}

@inproceedings{elalge23b,
  title = {Hybrid ASP-Based Multi-objective Scheduling of Semiconductor Manufacturing Processes (Extended Version)},
  author = {M. El-Kholany and R. Ali and M. Gebser},
  journal = {CoRR},
  url = {http://arxiv.org/abs/2307.14799},
  volume = {abs/2307.14799},
  year = {2023}
}

@incollection{elgakonowo04a,
  title = {Graphviz and Dynagraph -- Static and Dynamic Graph Drawing Tools},
  author = {J. Ellson and E. Gansner and E. Koutsofios and S. North and G. Woodhull},
  editor = {M. J{\"u}nger and P. Mutzel},
  booktitle = {Graph Drawing Software},
  doi = {10.1007/978-3-642-18638-7\_6},
  pages = {127-148},
  publisher = springer,
  year = {2004}
}

@inproceedings{elgegukakaliscscsc09a,
  title = {A Simple Distributed Conflict-Driven Answer Set Solver},
  author = {E. Ellguth and M. Gebser and M. Gusowski and R. Kaminski and B. Kaufmann and S. Liske and T. Schaub and L. Schneidenbach and B. Schnor},
  crossref = {lpnmr09},
  pages = {490-495}
}

@article{elgesc22a,
  title = {Problem Decomposition and Multi-shot {ASP} Solving for Job-shop Scheduling},
  author = {M. El-Kholany and M. Gebser and K. Schekothin},
  doi = {10.1017/S1471068422000217},
  journal = tplp,
  number = {4},
  pages = {623-639},
  publisher = cup,
  volume = {22},
  year = {2022}
}

@article{elgot61a,
  title = {Decision problems of finite automata design and related arithmetics},
  author = {C. Elgot},
  journal = {Transactions of the American Mathematical Society},
  number = {1},
  pages = {21-51},
  volume = {98},
  year = {1961}
}

@article{elkan90,
  title = {A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems},
  author = {C. Elkan},
  journal = ai,
  number = {2},
  pages = {219-234},
  volume = {43},
  year = {1990}
}

@inproceedings{elkgeb20a,
  title = {Job Shop Scheduling with Multi-shot {ASP}},
  author = {M. El-Kholany and M. Gebser},
  crossref = {taasp20},
  url = {http://www.kr.tuwien.ac.at/events/taasp20/papers/TAASP_2020_paper_4.pdf}
}

@book{elmnav94a,
  title = {Fundamentals of database systems},
  author = {R. Elmasri and S. Navathe},
  publisher = addison,
  year = {1994}
}

@inproceedings{elposo04a,
  title = {Smodels with {CLP} and Its Applications: A Simple and Effective Approach to Aggregates in {ASP}},
  author = {I. Elkabani and E. Pontelli and T. Son},
  crossref = {iclp04},
  doi = {10.1007/978-3-540-27775-0\_6},
  pages = {73-89}
}

@inproceedings{elposo04b,
  title = {{ASP-PROLOG}: A System for Reasoning about Answer Set Programs in {P}rolog},
  author = {O. El-Khatib and E. Pontelli and T. Son},
  crossref = {padl04},
  pages = {148-162}
}

@inproceedings{elposo05a,
  title = {Smodels$^{A}$ - A System for Computing Answer Sets of Logic Programs with Aggregates},
  author = {I. Elkabani and E. Pontelli and T. Son},
  crossref = {lpnmr05},
  pages = {427-431}
}

@inproceedings{elscge22a,
  title = {Decomposition-Based Job-Shop Scheduling with Constrained Clustering},
  author = {M. El-Kholany and K. Schekotihin and M. Gebser},
  crossref = {padl22},
  pages = {165-180}
}

@techreport{elvhun93a,
  title = {Acceptable inferences from inconsistent information},
  author = {M. Elvang and A. Hunter},
  address = {University of Roskilde, Denmark},
  institution = {Centre for cognitive informatics},
  number = {WPCS-93-13},
  year = {1993}
}

@article{elvhun93b,
  title = {Argumentative logics: reasoning with classically inconsistent information},
  author = {M. Elvang and A. Hunter},
  journal = {Journal of Knowledge and Data Engineering},
  pages = {125-145},
  volume = {16},
  year = {1995}
}

@article{emdkow76a,
  title = {The Semantics of Predicate Logic as a Programming Language},
  author = {M. van Emden and R. Kowalski},
  journal = jacm,
  number = {4},
  pages = {733-742},
  volume = {23},
  year = {1976}
}

@incollection{emerson90a,
  title = {Temporal and Modal Logic},
  author = {E. Emerson},
  editor = {J. van Leeuwen},
  booktitle = {Handbook of Theoretical Computer Science},
  pages = {995-1072},
  publisher = {MIT Press},
  year = {1990}
}

@inproceedings{enbomane17a,
  title = {Cooperative Epistemic Multi-Agent Planning for Implicit Coordination},
  author = {T. Engesser and T. Bolander and R. Mattm{\"u}ller and B. Nebel},
  editor = {S. Ghosh and R. Ramanujam},
  booktitle = {Proceedings of the Ninth Workshop on Methods for Modalities},
  pages = {75-90},
  series = {{EPTCS}},
  volume = {243},
  year = {2017}
}

@book{enderton72,
  title = {A Mathematical Introduction to Logic},
  author = {H. Enderton},
  publisher = {Academic Press},
  year = {1972}
}

@techreport{engkam05a,
  title = {On the Complexity of {R}andolph's Robot Game},
  author = {B. Engels and T. Kamphans},
  institution = {Institut f{\"u}r Informatik, Universit{\"a}t Bonn},
  number = {005},
  type = {Research Report},
  year = {2005}
}

@article{engkam06a,
  title = {Randolph's Robot Game is {NP}-hard!},
  author = {B. Engels and T. Kamphans},
  journal = {Electronic Notes in Discrete Mathematics},
  pages = {49-53},
  volume = {25},
  year = {2006}
}

@inproceedings{engkam06b,
  title = {Randolph's Robot Game is {NP}-complete!},
  author = {B. Engels and T. Kamphans},
  crossref = {ewcg06},
  pages = {157-160}
}

@inproceedings{enmasateto04a,
  title = {The {CIFF} Proof Procedure for Abductive Logic Programming with Constraints},
  author = {U. Endriss and P. Mancarella and F. Sadri and G. Terreni and F. Toni},
  crossref = {jelia04},
  pages = {31-43}
}

@article{epstein79,
  title = {Relatedness and Implication},
  author = {R. Epstein},
  journal = {Philosophical Studies},
  pages = {137-173},
  volume = {36},
  year = {1979}
}

@article{erakpa12a,
  title = {Answer set programming for collaborative housekeeping robotics: representation, reasoning, and execution},
  author = {E. Erdem and E. Aker and V. Patoglu},
  journal = {Intelligent Service Robotics},
  number = {4},
  pages = {275-291},
  volume = {5},
  year = {2012}
}

@inproceedings{erdem09a,
  title = {{PHYLO-ASP}: Phylogenetic Systematics with Answer Set Programming},
  author = {E. Erdem},
  crossref = {lpnmr09},
  pages = {567-572}
}

@inproceedings{erdlif01a,
  title = {Fages' Theorem for Programs with Nested Expressions},
  author = {E. Erdem and V. Lifschitz},
  crossref = {iclp01},
  pages = {242-254}
}

@article{erdlif03a,
  title = {Tight Logic Programs},
  author = {E. Erdem and V. Lifschitz},
  journal = tplp,
  number = {4-5},
  pages = {499-518},
  volume = {3},
  year = {2003}
}

@inproceedings{erdlif99a,
  title = {Transformations of Logic Programs Related to Causality and Planning},
  author = {E. Erdem and V. Lifschitz},
  crossref = {lpnmr99},
  pages = {107-116}
}

@inproceedings{erdloz86a,
  title = {On multiple moving objects},
  author = {M. Erdmann and T. {Lozano-P{\'e}rez}},
  crossref = {icra86},
  pages = {1419-1424}
}

@article{erdren59a,
  title = {On random graphs},
  author = {A. Erd{\H{o}}s and P. R{\'e}nyi},
  journal = {Publicationes Mathematicae},
  pages = {290-297},
  volume = {6},
  year = {1959}
}

@inproceedings{erdtur08a,
  title = {Efficient Haplotype Inference with Answer Set Programming},
  author = {E. Erdem and F. T{\"u}re},
  crossref = {aaai08},
  pages = {436-441}
}

@inproceedings{erdwon04a,
  title = {Rectilinear {S}teiner Tree Construction Using Answer Set Programming},
  author = {E. Erdem and M. Wong},
  crossref = {iclp04},
  pages = {386-399}
}

@inproceedings{erertu09a,
  title = {{HAPLO-ASP}: Haplotype Inference Using Answer Set Programming},
  author = {E. Erdem and O. Erdem and F. T{\"u}re},
  crossref = {lpnmr09},
  pages = {573-578}
}

@article{ergele16a,
  title = {Applications of {ASP}},
  author = {E. Erdem and M. Gelfond and N. Leone},
  doi = {10.1609/aimag.v37i3.2678},
  journal = aim,
  number = {3},
  pages = {53-68},
  volume = {37},
  year = {2016}
}

@inproceedings{erhapapaur11a,
  title = {Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation},
  author = {E. Erdem and K. Haspalamutgil and C. Palaz and V. Patoglu and T. Uras},
  crossref = {icra11},
  pages = {4575-4581}
}

@inproceedings{erkiozsc13a,
  title = {A General Formal Framework for Pathfinding Problems with Multiple Agents},
  author = {E. Erdem and D. Kisa and U. {\"O}ztok and P. Sch{\"u}ller},
  crossref = {aaai13},
  pages = {290-296}
}

@inproceedings{erkiozsc13b,
  title = {Experimental Evaluation of Multi-Agent Pathfinding Problems using Answer Set Programming},
  author = {E. Erdem and D. Kisa and U. Oztok and P. Sch{\"u}ller},
  crossref = {rcra13}
}

@article{erli03a,
  title = {Tight Logic Programs},
  author = {E. Erdem and V. Lifschitz},
  journal = tplp,
  number = {4-5},
  pages = {499-518},
  volume = {3},
  year = {2003}
}

@inproceedings{erliwo00a,
  title = {Wire Routing and Satisfiability Planning},
  author = {E. Erdem and V. Lifschitz and M. Wong},
  crossref = {cl00},
  pages = {822-836}
}

@article{ernasu95a,
  title = {Complexity, decidability and undecidability results for domain-independent planning},
  author = {K. Erol and D. Nau and V. Subrahmanian},
  journal = ai,
  number = {1-2},
  pages = {75-88},
  volume = {76},
  year = {1995}
}

@article{erpasascur13a,
  title = {Finding optimal plans for multiple teams of robots through a mediator: {A} logic-based approach},
  author = {E. Erdem and V. Patoglu and Z. Saribatur and P. Sch{\"u}ller and T. Uras},
  journal = tplp,
  number = {4-5},
  pages = {831-846},
  volume = {13},
  year = {2013}
}

@inproceedings{eshghi88a,
  title = {Abductive Planning with Event Calculus},
  author = {K. Eshghi},
  crossref = {iclp88},
  pages = {562-579}
}

@inproceedings{eshkow89a,
  title = {Abduction Compared with Negation by Failure.},
  author = {K. Eshghi and R. Kowalski},
  crossref = {iclp89},
  pages = {234-255}
}

@inproceedings{ethcra96a,
  title = {Towards efficient default reasoning},
  author = {D. Etherington and J. Crawford},
  booktitle = aaai,
  pages = {627-632},
  year = {1996}
}

@phdthesis{etherington86,
  title = {Reasoning with Incomplete Information: Investigations of Non-Monotonic Reasoning},
  author = {D. Etherington},
  note = {Revised Version appeared as: Research Notes in AI, Pitman.},
  school = {Department of Computer Science, University of British Columbia},
  year = {1986}
}

@inproceedings{etherington87a,
  title = {Relating Default Logic and Circumscription},
  author = {D. Etherington},
  booktitle = ijcai,
  pages = {489-494},
  year = {1987}
}

@inproceedings{etherington87b,
  title = {A Semantics for Default Logic},
  author = {D. Etherington},
  booktitle = ijcai,
  pages = {495-498},
  year = {1987}
}

@article{etherington87c,
  title = {Formalizing Nonmonotonic Reasoning},
  author = {D. Etherington},
  journal = ai,
  pages = {41-85},
  volume = {31},
  year = {1987}
}

@book{etherington88,
  title = {Reasoning with Incomplete Information},
  author = {D. Etherington},
  address = {London},
  publisher = pitman,
  series = {Research Notes in Artificial Intelligence},
  year = {1988}
}

@inproceedings{ethrei83,
  title = {On Inheritance Hierarchies with Exceptions},
  author = {D. Etherington and R. Reiter},
  booktitle = aaai,
  pages = {104-108},
  year = {1983}
}

@inproceedings{etkrpe90,
  title = {Nonmonotonicity and the scope of Reasoning},
  author = {D. Etherington and S. Kraus and D. Perlis},
  booktitle = aaai,
  note = {Preliminary Report.},
  pages = {600-607},
  publisher = m-k,
  year = {1990}
}

@article{etmere85,
  title = {On the adequacy of predicate circumscription for closed-world reasoning},
  author = {D. Etherington and R. Mercer and R. Reiter},
  journal = ci,
  pages = {11-15},
  volume = {1},
  year = {1985}
}

@inproceedings{everardo17a,
  title = {Towards an Automated Multitrack Mixing Tool using Answer Set Programming},
  author = {F. Everardo},
  crossref = {smc17},
  pages = {422-428}
}

@inproceedings{evjakasc19a,
  title = {The return of XORRO},
  author = {F. Everardo and T. Janhunen and R. Kaminski and T. Schaub},
  crossref = {lpnmr19},
  pages = {284-297}
}

@inproceedings{eymaro09a,
  title = {Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning},
  author = {P. Eyerich and R. Mattm{\"u}ller and G. R{\"o}ger},
  crossref = {icaps09}
}

@phdthesis{faber02a,
  title = {Enhancing Efficiency and Expressiveness in Answer Set Programming Systems},
  author = {W. Faber},
  school = {Technische Universit{\"a}t Wien},
  type = {Dissertation},
  year = {2002}
}

@inproceedings{faber05a,
  title = {Unfounded sets for disjunctive logic programs with arbitrary aggregates},
  author = {W. Faber},
  crossref = {lpnmr05},
  pages = {40-52}
}

@inproceedings{fabkon05a,
  title = {Strong Equivalence for Logic Programs with Preferences},
  author = {W. Faber and K. Konczak},
  crossref = {ijcai05},
  pages = {430-435}
}

@article{fabkon06a,
  title = {Strong Order Equivalence},
  author = {W. Faber and K. Konczak},
  journal = amai,
  number = {1-2},
  pages = {43-78},
  volume = {47},
  year = {2006}
}

@inproceedings{fableo07a,
  title = {On the Complexity of Answer Set Programming with Aggregates},
  author = {W. Faber and N. Leone},
  crossref = {lpnmr07},
  pages = {97-109}
}

@inproceedings{fabmor23a,
  title = {Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers},
  author = {W. Faber and M. Morak},
  crossref = {aaai23},
  pages = {6322-6329},
  year = {2023}
}

@inproceedings{fabudopo20a,
  title = {{EFP} 2.0: {A} Multi-Agent Epistemic Solver with Multiple E-State Representations},
  author = {F. Fabiano and A. Burigana and A. Dovier and E. Pontelli},
  crossref = {icaps20},
  pages = {101-109}
}

@inproceedings{fabwol09a,
  title = {Manifold Answer-Set Programs for Meta-Reasoning},
  author = {W. Faber and S. Woltran},
  crossref = {lpnmr09},
  pages = {115-128}
}

@inproceedings{fabwol11a,
  title = {Manifold Answer-Set Programs and Their Applications},
  author = {W. Faber and S. Woltran},
  booktitle = {Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning},
  pages = {44-63},
  publisher = springer,
  series = lncs,
  volume = {6565},
  year = {2011}
}

@article{fafage22a,
  title = {Thirty years of Epistemic Specifications},
  author = {J. Fandinno and W. Faber and M. Gelfond},
  journal = tplp,
  number = {6},
  pages = {1043-1083},
  volume = {22},
  year = {2022}
}

@article{fafrhascsc16a,
  title = {Twenty-Five Years of Successful Application of Constraint Technologies at Siemens},
  author = {A. Falkner and G. Friedrich and A. Haselb{\"o}ck and G. Schenner and H. Schreiner},
  doi = {10.1609/aimag.v37i4.2688},
  journal = aim,
  number = {4},
  pages = {67-80},
  volume = {37},
  year = {2016}
}

@article{fafrsctate18a,
  title = {Industrial Applications of Answer Set Programming},
  author = {A. Falkner and G. Friedrich and K. Schekotihin and R. Taupe and E. Teppan},
  doi = {10.1007/s13218-018-0548-6},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {165-176},
  volume = {32},
  year = {2018}
}

@inproceedings{fagedesestre20a,
  title = {Towards {ASP}-based Scheduling for Industrial Transport Vehicles},
  author = {F. Fabricius and M. Gebser and M. {D}e Bortoli and M. Selmair and G. Steinbauer and M. Reip},
  editor = {P. Roth and G. Steinbauer and F. Fraundorfer and M. Brandst{\"o}tter and R. Perko},
  booktitle = {Proceedings of the Joint Austrian Computer Vision and Robotics Workshop (ACVRW'20)},
  pages = {34-41},
  publisher = {Graz University of Technology},
  year = {2020}
}

@inproceedings{fages05a,
  title = {Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM},
  author = {F. Fages},
  crossref = {lopstr05},
  pages = {1-5}
}

@article{fages94a,
  title = {Consistency of {C}lark's completion and the existence of stable models},
  author = {F. Fages},
  journal = {Journal of Methods of Logic in Computer Science},
  pages = {51-60},
  volume = {1},
  year = {1994}
}

@article{fagrle07a,
  title = {Magic Sets and their application to data integration.},
  author = {W. Faber and G. Greco and N. Leone},
  journal = jcss,
  number = {4},
  pages = {584-609},
  volume = {73},
  year = {2007}
}

@article{fahakrscscta20a,
  title = {Solver Requirements for Interactive Configuration.},
  author = {A. Falkner and A. Haselb{\"o}ck and G. Krames and G. Schenner and H. Schreiner and R. Taupe},
  doi = {10.3897/jucs.2020.019},
  journal = jucs,
  number = {3},
  pages = {343-373},
  volume = {26},
  year = {2020}
}

@inproceedings{fahali22a,
  title = {Axiomatization of Aggregates in Answer Set Programming},
  author = {J. Fandinno and Z. Hansen and Y. Lierler},
  crossref = {aaai22},
  pages = {5634-5641}
}

@inproceedings{fahali22b,
  title = {Arguing Correctness of {ASP} Programs with Aggregates},
  author = {J. Fandinno and Z. Hansen and Y. Lierler},
  crossref = {lpnmr22},
  pages = {190-202}
}

@article{fahali24a,
  title = {Axiomatization of Non-Recursive Aggregates in First-Order Answer Set Programming},
  author = {J. Fandinno and Z. Hansen and Y. Lierler},
  journal = jair,
  pages = {977-1031},
  volume = {80},
  year = {2024}
}

@article{fahalilite23a,
  title = {External Behavior of a Logic Program and Verification of Refactoring},
  author = {J. Fandinno and Z. Hansen and Y. Lierler and V. Lifschitz and N. Temple},
  journal = tplp,
  number = {4},
  pages = {933-947},
  volume = {23},
  year = {2023}
}

@book{fahamova95a,
  title = {Reasoning About Knowledge},
  author = {R. Fagin and J. Halpern and Y. Moses and M. Vardi},
  publisher = {{MIT} Press},
  year = {1995}
}

@inproceedings{fahe96a,
  title = {Combinig Classical and Intuitionistic Logic, or: Intuitionistic Implication as a Conditional},
  author = {L. {Fari{\~n}as del Cerro} and A. Herzig},
  crossref = {frocos96},
  pages = {93-102}
}

@inproceedings{faheir15a,
  title = {Epistemic Equilibrium Logic},
  author = {L. {Fari{\~n}as del Cerro} and A. Herzig and E. {Iraz Su}},
  crossref = {ijcai15},
  pages = {2964-2970}
}

@book{fahlman79,
  title = {{NETL}: A system for Representing and Using Real-World Knowledge},
  author = {S. Fahlman},
  address = {Cambridge MA},
  publisher = {MIT Press},
  year = {1979}
}

@inproceedings{fajavecoco10a,
  title = {Efficient Solving of Time-dependent Answer Set Programs},
  author = {T. Fayruzov and J. Janssen and D. Vermeir and C. Cornelis and M. {D}e Cock},
  crossref = {iclp-lipics10},
  pages = {64-73}
}

@article{falaroscso21a,
  title = {Planning with Incomplete Information in Quantified Answer Set Programming},
  author = {J. Fandinno and F. Laferriere and J. Romero and T. Schaub and T. Son},
  doi = {10.1017/S1471068421000259},
  journal = tplp,
  number = {5},
  pages = {663-679},
  publisher = cup,
  volume = {21},
  year = {2021}
}

@inproceedings{falemapf99a,
  title = {Using Database Optimization Techniques for Nonmonotonic Reasoning},
  author = {W. Faber and N. Leone and C. Mateis and G. Pfeifer},
  booktitle = {Proceedings of the Seventh International Workshop on Deductive Databases and Logic Programming (DDLP'99)},
  pages = {135-139},
  year = {1999}
}

@inproceedings{falemari07a,
  title = {Experimenting with Look-Back Heuristics for Hard {ASP} Programs},
  author = {W. Faber and N. Leone and M. Maratea and F. Ricca},
  crossref = {lpnmr07},
  pages = {110-122}
}

@incollection{falepe12a,
  title = {The Intelligent Grounder of {DLV}},
  author = {W. Faber and N. Leone and S. Perri},
  crossref = {vl65},
  pages = {247-264}
}

@techreport{falepepf01a,
  title = {Efficient Instantiation of Disjunctive Databases},
  author = {W. Faber and N. Leone and S. Perri and G. Pfeifer},
  institution = {Technische Universit{\"a}t Wien},
  number = {DBAI-TR-2001-44},
  type = {Technical Report},
  year = {2001}
}

@inproceedings{falepf01a,
  title = {Experimenting with Heuristics for Answer Set Programming},
  author = {W. Faber and N. Leone and G. Pfeifer},
  crossref = {ijcai01},
  pages = {635-640}
}

@inproceedings{falepf04a,
  title = {Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity.},
  author = {W. Faber and N. Leone and G. Pfeifer},
  crossref = {jelia04},
  pages = {200-212}
}

@inproceedings{faleri05a,
  title = {A Backjumping Technique for Disjunctive Logic Programming},
  author = {W. Faber and N. Leone and F. Ricca},
  crossref = {asp05},
  pages = {216-230},
  year = {2005}
}

@article{falilusc20a,
  title = {Verifying Tight Logic Programs with anthem and vampire},
  author = {J. Fandinno and V. Lifschitz and P. L{\"u}hne and T. Schaub},
  journal = tplp,
  number = {5},
  pages = {735-750},
  volume = {20},
  year = {2020}
}

@incollection{falsch14a,
  title = {{SIEMENS}: Configuration and Reconfiguration in Industry},
  author = {A. Falkner and H. Schreiner},
  chapter = {16},
  crossref = {kbc14},
  doi = {10.1016/b978-0-12-415817-7.00016-5},
  pages = {199-210}
}

@incollection{famirosc20a,
  title = {Answer Set Programming Made Easy},
  author = {J. Fandinno and S. Mishra and J. Romero and T. Schaub},
  crossref = {mh60},
  optpages = {toappear}
}

@article{famoch21a,
  title = {Determining Action Reversibility in {STRIPS} Using Answer Set and Epistemic Logic Programming},
  author = {W. Faber and M. Morak and L. Chrpa},
  journal = tplp,
  number = {5},
  pages = {646-662},
  volume = {21},
  year = {2021}
}

@misc{fanhan24a,
  title = {Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence},
  author = {J. Fandinno and Z. Hansen},
  archiveprefix = {arXiv},
  eprint = {2412.10975},
  primaryclass = {cs.AI},
  url = {https://arxiv.org/abs/2412.10975},
  year = {2024}
}

@inproceedings{fanhan25a,
  title = {Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence},
  author = {J. Fandinno and Z. Hansen},
  crossref = {aaai25},
  pages = {(to appear)},
  year = {2025}
}

@inproceedings{fanlie23a,
  title = {Splitting Answer Set Programs with Respect to Intensionality Statements},
  author = {J. Fandinno and Y. Lierler},
  crossref = {aaai23},
  doi = {10.1609/AAAI.V37I5.25780},
  pages = {6338-6345},
  year = {2023}
}

@inproceedings{fanlif23a,
  title = {On {H}euer’s Procedure for Verifying Strong Equivalence},
  author = {J. Fandinno and V. Lifschitz},
  crossref = {jelia23}
}

@inproceedings{fanlif24a,
  title = {Deductive Systems for Logic Programs with Counting: Preliminary Report},
  author = {J. Fandinno and V. Lifschitz},
  crossref = {lpnmr24},
  pages = {1-14},
  year = {2024}
}

@inproceedings{fanlil25a,
  title = {Solving Epistemic Logic Programs using Generate-and-Test with Propagation},
  author = {J. Fandinno and L. Lillo},
  crossref = {aaai25},
  pages = {(to appear)},
  year = {2025}
}

@article{fanmic08a,
  title = {Boosting {SAT} Solver Performance via a New Hybrid Approach},
  author = {L. Fang and M. Hsiao},
  journal = jsat,
  number = {1-4},
  pages = {243-261},
  volume = {5},
  year = {2008}
}

@article{fansch19a,
  title = {Answering the \textquotedblleft why\textquotedblright in answer set programming--A survey of explanation approaches},
  author = {J. Fandinno and C. Schulz},
  doi = {10.1017/S1471068418000534},
  journal = tplp,
  number = {2},
  pages = {114-203},
  volume = {19}
}

@article{fapfle11a,
  title = {Semantics and Complexity of Recursive Aggregates in Answer Set Programming},
  author = {W. Faber and G. Pfeifer and N. Leone},
  journal = ai,
  number = {1},
  pages = {278-298},
  volume = {175},
  year = {2011}
}

@article{fapfledeie08a,
  title = {Design and implementation of aggregate functions in the {DLV} system},
  author = {W. Faber and G. Pfeifer and N. Leone and T. Dell'Armi and G. Ielpa},
  journal = tplp,
  number = {5-6},
  pages = {545-580},
  volume = {8},
  year = {2008}
}

@article{faraza03a,
  title = {An information-theoretic entropy metric for assessing multi-objective optimization solution set quality},
  author = {A. Farhang-Mehr and S. Azarm},
  journal = {Journal of Mechanical Design},
  number = {4},
  pages = {655-663},
  publisher = {American Society of Mechanical Engineers},
  volume = {125},
  year = {2003}
}

@article{farinas86a,
  title = {{MOLOG:} {A} System That Extends {PROLOG} with Modal Logic},
  author = {L. {Fari{\~n}as del Cerro}},
  journal = ngc,
  number = {1},
  pages = {35-50},
  volume = {4},
  year = {1986}
}

@inproceedings{faryscsh15a,
  title = {{OOASP:} Connecting Object-Oriented and Logic Programming},
  author = {A. Falkner and A. Ryabokon and G. Schenner and K. Shchekotykhin},
  crossref = {lpnmr15},
  doi = {10.1007/978-3-319-23264-5\_28},
  pages = {332-345}
}

@article{fatrwo13a,
  title = {Strong Equivalence of Qualitative Optimization Problems},
  author = {W. Faber and M. Truszczy{\'n}ski and S. Woltran},
  journal = jair,
  pages = {351-391},
  volume = {47},
  year = {2013}
}

@inproceedings{fatrwo13b,
  title = {Abstract Preference Frameworks --- A Unifying Perspective on Separability and Strong Equivalence},
  author = {W. Faber and M. Truszczynski and S. Woltran},
  crossref = {aaai13},
  pages = {297-303}
}

@inproceedings{faulva83,
  title = {On the Semantics of Updates in Databases. Preliminary Report.},
  author = {R. Fagin and J. Ullman and M. Vardi},
  booktitle = {Proceedings of the Second ACM Conference SIGACT-SIGMOD},
  pages = {352-365},
  year = {1983}
}

@inproceedings{febrwe06a,
  title = {Planning with Prioritized Goals},
  author = {R. Feldmann and G. Brewka and S. Wenzel},
  crossref = {kr06},
  pages = {503-514}
}

@article{fedeha05a,
  title = {Parallel Multithreaded Satisfiability Solver: Design and Implementation},
  author = {Y. Feldman and N. Dershowitz and Z. Hanna},
  journal = {Electronic Notes in Theoretical Computer Science},
  number = {3},
  pages = {75-90},
  volume = {128},
  year = {2005}
}

@inproceedings{fefaateruraz17a,
  title = {{ASP}-based Knowledge Representations for {IoT} Configuration Scenarios},
  author = {A. Felfernig and A. Falkner and M. Atas and S. Erdeniz and C. Uran and P. Azzoni},
  crossref = {conf17},
  pages = {62-67}
}

@article{fefrja00a,
  title = {{UML} as Domain Specific Language for the Construction of Knowledge-Based Configuration Systems},
  author = {A. Felfernig and G. Friedrich and D. Jannach},
  journal = {International Journal of Software Engineering and Knowledge Engineering},
  number = {4},
  pages = {449-469},
  publisher = {World Scientific},
  volume = {10},
  year = {2000}
}

@article{fefrjastza03a,
  title = {Configuration knowledge representations for Semantic Web applications},
  author = {A. Felfernig and G. Friedrich and D. Jannach and M. Stumptner and M. Zanker},
  doi = {10.1017/s0890060403171041},
  journal = aiedam,
  number = {1},
  pages = {31-50},
  volume = {17},
  year = {2003}
}

@article{felapisctu10a,
  title = {Ant Colony Heuristic for Mapping and Scheduling Tasks and Communications on Heterogeneous Embedded Systems},
  author = {F. Ferrandi and P. Lanzi and C. Pilatp and D. Sciuto and A. Tumeo},
  doi = {10.1109/TCAD.2010.2048354},
  journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  number = {6},
  pages = {911-924},
  volume = {29},
  year = {2010}
}

@inproceedings{felegrri12a,
  title = {{JASP}: A Framework for Integrating Answer Set Programming with {J}ava},
  author = {O. Febbraro and N. Leone and G. Grasso and F. Ricca},
  crossref = {kr12},
  pages = {541-551}
}

@article{feleli06a,
  title = {A Generalization of the {L}in-{Z}hao Theorem},
  author = {P. Ferraris and J. Lee and V. Lifschitz},
  journal = amai,
  number = {1-2},
  pages = {79-101},
  volume = {47},
  year = {2006}
}

@inproceedings{feleli07a,
  title = {A New Perspective on Stable Models},
  author = {P. Ferraris and J. Lee and V. Lifschitz},
  crossref = {ijcai07},
  pages = {372-379}
}

@article{feleli11a,
  title = {Stable models and circumscription},
  author = {P. Ferraris and J. Lee and V. Lifschitz},
  journal = ai,
  number = {1},
  pages = {236-263},
  volume = {175},
  year = {2011}
}

@inproceedings{felelipa09a,
  title = {Symmetric Splitting in the General Theory of Stable Models},
  author = {P. Ferraris and J. Lee and V. Lifschitz and R. Palla},
  crossref = {ijcai09},
  pages = {797-803}
}

@article{felomisu93a,
  title = {Disjunctive {LP} + integrity constraints= stable model semantics},
  author = {J. Fern{\'a}ndez and J. Lobo and J. Minker and V. Subrahmanian},
  journal = amai,
  number = {3-4},
  pages = {449-474},
  publisher = springer,
  volume = {8},
  year = {1993}
}

@inproceedings{fepiwomakl20a,
  title = {Efficient Model-Based Diagnosis of Sequential Circuits},
  author = {A. Feldman and I. Pill and F. Wotawa and I. Matei and J. de Kleer},
  crossref = {aaai20},
  pages = {2814-2821}
}

@incollection{fererenije14a,
  title = {Conflict Detection and Diagnosis in Configuration},
  author = {A. Felfernig and S. Reiterer and F. Reinfrank and G. Ninaus and M. Jeran},
  chapter = {7},
  crossref = {kbc14},
  pages = {73-88}
}

@inproceedings{fereri11a,
  title = {{ASPIDE}: Integrated Development Environment for Answer Set Programming},
  author = {O. Febbraro and K. Reale and F. Ricca},
  crossref = {lpnmr11},
  doi = {10.1007/978-3-642-20895-9\_37},
  pages = {317-330}
}

@article{ferlif02a,
  title = {Weight constraints as nested expressions},
  author = {P. Ferraris and V. Lifschitz},
  journal = tplp,
  number = {1-2},
  pages = {45-74},
  volume = {5},
  year = {2005}
}

@inproceedings{ferlif05a,
  title = {Mathematical Foundations of Answer Set Programming},
  author = {P. Ferraris and V. Lifschitz},
  crossref = {wwst05},
  pages = {615-664}
}

@inproceedings{ferlif10a,
  title = {On the Stable Model Semantics of First-Order Formulas with Aggregates},
  author = {P. Ferraris and V. Lifschitz},
  crossref = {nmr10},
  url = {http://www.cs.utexas.edu/users/ai-lab/?ferraris:nmr10ws}
}

@inproceedings{ferraris05a,
  title = {Answer Sets for Propositional Theories},
  author = {P. Ferraris},
  crossref = {lpnmr05},
  pages = {119-131}
}

@article{ferraris11a,
  title = {Logic programs with propositional connectives and aggregates},
  author = {P. Ferraris},
  doi = {10.1145/1970398.1970401},
  journal = tocl,
  number = {4},
  pages = {25:1-25:40},
  volume = {12},
  year = {2011}
}

@article{fescze12a,
  title = {An efficient diagnosis algorithm for inconsistent constraint sets},
  author = {A. Felfernig and M. Schubert and C. Zehentner},
  journal = aiedam,
  number = {1},
  pages = {53-62},
  volume = {26},
  year = {2012}
}

@inproceedings{fesost11a,
  title = {Half Reification and Flattening},
  author = {T. Feydy and Z. Somogyi and P. Stuckey},
  crossref = {cp11},
  pages = {286-301}
}

@inproceedings{festshbogoshstwasu17a,
  title = {Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges},
  author = {A. Felner and R. Stern and S. Shimony and E. Boyarski and M. Goldenberg and G. Sharon and N. Sturtevant and G. Wagner and P. Surynek},
  crossref = {socs17},
  pages = {29-37}
}

@article{ficsze15a,
  title = {Backdoors to tractable answer set programming},
  author = {J. Fichte and S. Szeider},
  journal = ai,
  pages = {64-103},
  volume = {220},
  year = {2015}
}

@inproceedings{figeiaresc13a,
  title = {{ActHEX}: Implementing {HEX} Programs with Action Atoms},
  author = {M. Fink and S. Germano and G. Ianni and C. Redl and P. Sch{\"u}ller},
  crossref = {lpnmr13},
  pages = {317-322}
}

@article{fihemothwo23a,
  title = {Solving Projected Model Counting by Utilizing Treewidth and its Limits},
  author = {J. Fichte and M. Hecher and M. Morak and P. Thier and S. Woltran},
  journal = ai,
  pages = {103810},
  volume = {314},
  year = {2023}
}

@article{fiknil71a,
  title = {{STRIPS}: A new approach to the application of theorem proving to problem solving},
  author = {R. Fikes and N. Nilsson},
  journal = ai,
  number = {3-4},
  pages = {189-208},
  volume = {2},
  year = {1971}
}

@inproceedings{fimamotr01a,
  title = {Computing stable models in parallel},
  author = {R. Finkel and V. Marek and N. Moore and M. Truszczy{\'n}ski},
  crossref = {asp01},
  pages = {72-76}
}

@article{fimatr92a,
  title = {The pure logic of necessitation},
  author = {M. Fitting and V. Marek and M. Truszczy{\'n}ski},
  journal = jlc,
  pages = {349-373},
  volume = {2},
  year = {1992}
}

@article{finman87a,
  title = {{DIB} --- a distributed implementation of backtracking},
  author = {R. Finkel and U. Manber},
  issue = {2},
  journal = toplas,
  pages = {235-256},
  publisher = acm,
  volume = {9},
  year = {1987}
}

@article{finsip04a,
  title = {Checking Finite Traces Using Alternating Automata},
  author = {B. Finkbeiner and H. Sipma},
  journal = {Formal Methods in System Design},
  number = {2},
  pages = {101-127},
  volume = {24},
  year = {2004}
}

@inproceedings{fischer84a,
  title = {Axiomatisations for some intuitionistic modal logics},
  author = {G. {Fischer Servi}},
  booktitle = {Proceedings of the Rendiconti di Matematica di Torino},
  pages = {179-194},
  volume = {42},
  year = {1984}
}

@incollection{fisher08a,
  title = {Temporal Representation and Reasoning},
  author = {M. Fisher},
  chapter = {12},
  crossref = {KRHandbook},
  pages = {513-550}
}

@inproceedings{fisher94a,
  title = {A Survey of Concurrent {METATEM} - the Language and its Applications},
  author = {M. Fisher},
  crossref = {ictl94},
  pages = {480-505}
}

@article{fislad79a,
  title = {Propositional dynamic logic of regular programs},
  author = {M. Fischer and R. Ladner},
  journal = jcss,
  number = {2},
  pages = {194-211},
  volume = {18},
  year = {1979}
}

@article{fitting02a,
  title = {Fixpoint semantics for logic programming: A survey},
  author = {M. Fitting},
  journal = tcs,
  number = {1-2},
  pages = {25-51},
  volume = {278},
  year = {2002}
}

@article{fitting85a,
  title = {A {K}ripke-{K}leene Semantics for Logic Programs},
  author = {M. Fitting},
  journal = jlp,
  number = {4},
  pages = {295-312},
  volume = {2},
  year = {1985}
}

@article{fitting94a,
  title = {Tableaux for Logic Programming.},
  author = {M. Fitting},
  journal = jar,
  number = {2},
  pages = {175-188},
  volume = {13},
  year = {1994}
}

@article{flfrhascst98a,
  title = {Configuring large systems using generative constraint satisfaction},
  author = {G. Fleishanderl and G. Friedrich and A. Haselbock and H. Schreiner and M. Stumptner},
  journal = isa,
  number = {4},
  pages = {59-68},
  volume = {13},
  year = {1998}
}

@inproceedings{flsapasebo14a,
  title = {Improving Pattern Discovery Relevancy by Deriving Constraints from Expert Models},
  author = {F. Flouvat and J. Sanhes and C. Pasquier and N. Selmaoui-Folcher and J. Boulicaut},
  crossref = {ecai14},
  pages = {327-332}
}

@article{foloma17a,
  title = {Explainable Planning},
  author = {M. Fox and D. Long and D. Magazzeni},
  journal = {CoRR},
  url = {http://arxiv.org/abs/1709.10256},
  volume = {abs/1709.10256},
  year = {2017}
}

@book{forful62a,
  title = {Flows in networks},
  author = {L. Ford and D. Fulkerson},
  publisher = {Princeton University Press},
  year = {1962}
}

@inproceedings{forseg02a,
  title = {{NAGSAT}: A randomized, complete, parallel solver for 3-{SAT}},
  author = {S. Forman and A. Segre},
  booktitle = {Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing (SAT'02)},
  url = {http://gauss.ececs.uc.edu/Conferences/SAT2002/sat2002list.html},
  year = {2002}
}

@misc{forstner22a,
  title = {Opti{G}en Scheduling and Optimization},
  author = {H. Forstner},
  url = {https://media.infineon.com/channel/89133/corporate/1/13q7sMjwwJVAwRCdq2a2mj},
  year = {2022}
}

@article{foxlon03a,
  title = {{PDDL}2.1: An Extension to {PDDL} for Expressing Temporal Planning Domains},
  author = {M. Fox and D. Long},
  journal = jair,
  pages = {61-124},
  volume = {20},
  year = {2003}
}

@article{foxlon06a,
  title = {Modelling Mixed Discrete-Continuous Domains for Planning},
  author = {M. Fox and D. Long},
  journal = jair,
  number = {1},
  pages = {235-297},
  url = {https://dl.acm.org/doi/10.5555/1622572.1622580},
  volume = {27},
  year = {2006}
}

@phdthesis{freeman95a,
  title = {Improvements to Propositional Satisfiability Search Algorithms},
  author = {J. Freeman},
  adress = {Department of Computer and Information Science},
  school = {University of Pennsylvania},
  year = {1995}
}

@inproceedings{frerey02a,
  title = {A Sound and Complete Proof System for {QPTL}},
  author = {T. French and M. Reynolds},
  editor = {P. Balbiani and N. Suzuki and F. Wolter and M. Zakharyaschev},
  booktitle = {Proceedings of the Fourth Conference on Advances in Modal Logic},
  pages = {127-148},
  publisher = {King's College Publications},
  year = {2002}
}

@incollection{frgete22a,
  title = {Symbolic Artificial Intelligence Methods for Prescriptive Analytics},
  author = {G. Friedrich and M. Gebser and E. Teppan},
  editor = {B. Vogel-Heuser and M. Wimmer},
  booktitle = {Digital Transformation: Core Technologies and Emerging Topics from a Computer Science Perspective},
  pages = {385-414},
  publisher = springer,
  year = {2022}
}

@inproceedings{frigia10a,
  title = {{SAT} Encodings of the At-Most-$k$ Constraint},
  author = {A. Frisch and P. Giannoros},
  crossref = {modref10}
}

@inproceedings{frisch87a,
  title = {Inference without chaining},
  author = {A. Frisch},
  booktitle = ijcai,
  pages = {515-519},
  publisher = m-k,
  year = {1987}
}

@inproceedings{frisch91,
  title = {A General Framework for Modal Deduction},
  author = {A. Frisch and R. Scherl},
  crossref = {kr91}
}

@incollection{frjastza14a,
  title = {Knowledge Engineering for Configuration Systems},
  author = {G. Friedrich and D. Jannach and M. Stumptner and M. Zanker},
  chapter = {11},
  crossref = {kbc14},
  doi = {10.1016/B978-0-12-415817-7.00011-6},
  pages = {139-155}
}

@inproceedings{frnele16a,
  title = {Solving the Station Repacking Problem},
  author = {A. Fr{\'e}chette and N. Newman and K. Leyton-Brown},
  crossref = {aaai16},
  pages = {702-709}
}

@misc{frocaf88,
  title = {Memorization of Literals: an Enhancement of the Connection Method},
  author = {B. Fronh{\"o}fer and R. Caferra},
  howpublished = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
  keywords = {connection method, theorem proving, automated reasoning},
  year = {1988}
}

@inproceedings{frogro90,
  title = {Graded default theories for uncertainty},
  author = {C. Froidevaux and C. Grosset{\^e}te},
  editor = {L. Aiello},
  booktitle = ecai,
  pages = {283-288},
  publisher = pitman,
  year = {1990}
}

@inproceedings{froidevaux86,
  title = {Taxonomic Default Theories},
  author = {C. Froidevaux},
  booktitle = ecai,
  pages = {123-129},
  year = {1990}
}

@inproceedings{froidevaux92,
  title = {Default Logic for Action Rule-based Systems},
  author = {C. Froidevaux},
  editor = {B. Neumann},
  booktitle = ecai,
  pages = {413-417},
  publisher = wiley,
  year = {1992}
}

@inproceedings{fromen92,
  title = {A Framework for Default Logic},
  author = {C. Froidevaux and J. Mengin},
  booktitle = {European Workshop on Logics in Artificial Intelligence (JELIA'92)},
  pages = {154-173},
  publisher = springer,
  series = lnai,
  volume = {633},
  year = {1992}
}

@article{fromen94,
  title = {Default Logic: A Unified View},
  author = {C. Froidevaux and J. Mengin},
  journal = ci,
  number = {3},
  pages = {331-369},
  volume = {10},
  year = {1994}
}

@inproceedings{fronhoefer85,
  title = {On refinements of the connection method},
  author = {B. Fronh{\"o}fer},
  editor = {J. Dementrovics and G. Katona and A. Salomaa},
  address = {Amsterdam},
  booktitle = {Algebra, Combinatorics and Logic in Computer Science},
  publisher = {North-Holland},
  volume = {42},
  year = {1985}
}

@article{fronhoefer87,
  title = {Linearity and Plan Generation},
  author = {B. {Fron{\-h}{\"o}{\-f}er}},
  journal = ngc,
  pages = {213-225},
  volume = {5},
  year = {1987}
}

@techreport{fronhoefer89a,
  title = {Default Connections in a Modal Planning Framework},
  author = {B. Fronh{\"o}fer},
  address = {46, Avenue F{\'e}lix Viallet, F-38031 Grenoble Cedex},
  institution = {LIFIA --- INPG},
  steffen = {27},
  year = {1989}
}

@techreport{fronhoefer89b,
  title = {Default Connections in a Modal Planning Framework},
  author = {B. Fronh{\"o}fer},
  address = {M{\"u}nchen, Germany},
  institution = {Technische Universit{\"a}t M{\"u}nchen},
  number = {FKI-108-89},
  type = {Forschungsberichte K{\"u}nstliche Intelligenz},
  year = {1989}
}

@incollection{frosch95,
  title = {The family of Default Logics},
  author = {T. Schaub},
  editor = {D. Gabbay and P. Smets},
  booktitle = {Handbook of Defeasible Reasoning and Uncertainty Management Systems},
  chapter = {5},
  pages = {77-133},
  publisher = kluwer,
  volume = {2},
  year = {1998}
}

@inproceedings{frryfahascsc11a,
  title = {(Re)configuration based on model generation},
  author = {G. Friedrich and A. Ryabokon and A. Falkner and A. Haselb{\"o}ck and G. Schenner and H. Schreiner},
  crossref = {lococo11},
  doi = {10.4204/eptcs.65.3},
  pages = {26-35}
}

@inproceedings{frscel21a,
  title = {Solving a Multi-resource Partial-Ordering Flexible Variant of the Job-Shop Scheduling Problem with Hybrid {ASP}},
  author = {G. Francescutto and K. Schekotihin and M. El-Kholany},
  crossref = {jelia21},
  pages = {313-328}
}

@inproceedings{frscscsiwa17a,
  title = {Hybrid Metabolic Network Completion},
  author = {C. Frioux and T. Schaub and S. Schellhorn and A. Siegel and P. Wanko},
  crossref = {lpnmr17},
  pages = {308-321}
}

@article{frscscsiwa18a,
  title = {Hybrid Metabolic Network Completion},
  author = {C. Frioux and T. Schaub and S. Schellhorn and A. Siegel and P. Wanko},
  journal = tplp,
  number = {1},
  pages = {83-108},
  volume = {19},
  year = {2019}
}

@book{fruabd97,
  title = {Constraint-Programmierung},
  author = {T. Fr{\"u}hwirth and S. Abdennadher},
  publisher = springer,
  year = {1997}
}

@article{fruehwirth98a,
  title = {Theory and Practice of Constraint Handling Rules},
  author = {T. Fr{\"u}hwirth},
  journal = jlp,
  number = {1-3},
  pages = {95-138},
  volume = {37},
  year = {1998}
}

@inproceedings{fruhwirth94a,
  title = {Annotated Constraint Logic Programming Applied to Temporal Reasoning},
  author = {T. Fr{\"u}hwirth},
  editor = {M. Hermenegildo and J. Penjam},
  booktitle = {Proceedings of the Sixth International Symposium on Programming Language Implementation and Logic Programming (PLILP'94)},
  pages = {230-243},
  publisher = springer,
  series = lncs,
  volume = {844},
  year = {1994}
}

@article{fruhwirth96a,
  title = {Temporal Annotated Constraint Logic Programming},
  author = {T. Fr{\"u}hwirth},
  journal = jsc,
  number = {5-6},
  pages = {555-583},
  volume = {22},
  year = {1996}
}

@inproceedings{fugezaancape16a,
  title = {A framework for easing the development of applications embedding answer set programming},
  author = {D. Fusc{\`{a}} and S. Germano and J. Zangari and M. Anastasio and F. Calimeri and S. Perri},
  crossref = {ppdp16},
  pages = {38-49}
}

@inproceedings{fukotamo86a,
  title = {Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to {P}rolog},
  author = {M. Fujita and S. Kono and H. Tanaka and T. Moto-Oka},
  crossref = {iclp86},
  doi = {10.1007/3-540-16492-8\_119},
  pages = {695-709}
}

@inproceedings{fumal06a,
  title = {On Solving the Partial {MAX-SAT} Problem},
  author = {Z. Fu and S. Malik},
  crossref = {sat06},
  pages = {252-265}
}

@inproceedings{gabbay82,
  title = {Intuitionistic bases for nonmonotonic logic},
  author = {D. Gabbay},
  editor = {D. Loveland},
  booktitle = cade,
  pages = {260-273},
  publisher = springer,
  year = {1982}
}

@incollection{gabbay85,
  title = {Theoretical Foundations for Non-monotonic Reasoning in Expert Systems},
  author = {D. Gabbay},
  editor = {K. Apt},
  booktitle = {Logics and Models of Concurrent Systems},
  pages = {439-457},
  publisher = springer,
  year = {1985}
}

@inproceedings{gabbay87a,
  title = {The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems},
  author = {D. Gabbay},
  editor = {B. Banieqbal and H. Barringer and A. Pnueli},
  booktitle = {Proceedings of the Conference on Temporal Logic in Specification},
  pages = {409-448},
  publisher = springer,
  series = lncs,
  volume = {398},
  year = {1987}
}

@incollection{gabbay87b,
  title = {Modal and Temporal Logic Programming},
  author = {D. Gabbay},
  editor = {A. Galton},
  booktitle = {Temporal Logics and their Applications},
  chapter = {6},
  pages = {197-237},
  publisher = {Academic Press},
  year = {1987}
}

@misc{gabbay90,
  title = {{LDS} --- Labeled deductive systems},
  author = {D. Gabbay},
  howpublished = {Draft},
  year = {1990}
}

@misc{gabbay91a,
  title = {A General Theory of Structured Consequence Relations: Theoretical Foundations of Non-monotonic Reasoning},
  author = {D. Gabbay},
  howpublished = {Draft},
  year = {1991}
}

@inproceedings{gabbay91b,
  title = {Theoretical Foundations for Non-monotonic Reasoning Part 2: Structured Non-monotonic Theories},
  author = {D. Gabbay},
  address = {Amsterdam},
  booktitle = {Proceedings of the Third Scandinavian Conference on Artificial Intelligence},
  pages = {19-40},
  publisher = ios,
  year = {1991}
}

@inproceedings{gabhun93,
  title = {Restricted Access logics for inconsistent information},
  author = {D. Gabbay and A. Hunter},
  editor = {M. Clarke and R. Kruse and S. Moral},
  booktitle = {Proceedings of European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty},
  publisher = springer,
  year = {1993}
}

@inproceedings{gacubesh22a,
  title = {Using Answer Set Programming for {HPC} Dependency Solving},
  author = {T. Gamblin and M. Culpo and G. Becker and S. Shudler},
  booktitle = {Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis},
  publisher = {{IEEE} Press},
  year = {2022}
}

@book{gaerdenfors88,
  title = {Knowledge in Flux: Modeling the Dynamics of Epistemic States},
  author = {P. G{\"a}rdenfors},
  address = {Cambridge, MA},
  publisher = {MIT Press},
  year = {1988}
}

@inproceedings{gaerdenfors90,
  title = {Belief Revision and Nonmonotonic Logic: Two Sides of the Same Coin{?}},
  author = {P. G{\"a}rdenfors},
  booktitle = ecai,
  pages = {768-773},
  year = {1990}
}

@inproceedings{gagesf09a,
  title = {Using Answer Set Programming to Enhance Operating System Discovery},
  author = {F. Gagnon and B. Esfandiari},
  crossref = {lpnmr09},
  pages = {579-584}
}

@article{gagrza95a,
  title = {Extrema Predicates in Deductive Databases},
  author = {S. Ganguly and S. Greco and C. Zaniolo},
  journal = jcss,
  number = {2},
  pages = {244-259},
  volume = {51},
  year = {1995}
}

@article{gagsch06a,
  title = {Learning Dynamic Algorithm Portfolios},
  author = {M. Gagliolo and J. Schmidhuber},
  journal = amai,
  number = {3-4},
  pages = {295-328},
  volume = {47},
  year = {2006}
}

@inproceedings{gahast19,
  title = {Lazy {CBS}: Implicit Conflict-Based Search Using Lazy Clause Generation},
  author = {G. Gange and D. Harabor and P. Stuckey},
  crossref = {icaps19},
  pages = {155-162},
  year = {2019}
}

@book{gahejovl94a,
  title = {Design Patterns: Elements of Reusable Object-Oriented Software},
  author = {E. Gamma and R. Helm and R. Johnson and J. Vlissides},
  publisher = addison,
  year = {1994}
}

@book{gahoro94,
  title = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  publisher = {Oxford University Press},
  year = {1994}
}

@inproceedings{gaisha89a,
  title = {Fully Abstract Compositional Semantics for Logic Programs},
  author = {H Gaifman and E. Shapiro},
  booktitle = {Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages (POPL'89)},
  pages = {134-142},
  year = {1989}
}

@book{gallier86,
  title = {Logic for Computer Science: Foundations of Automated Theorem Proving},
  author = {J. Gallier},
  address = {New York},
  publisher = {Harper and Row},
  year = {1986}
}

@article{gamini84,
  title = {Logic and Databases: A Deductive Approach},
  author = {H. Gallaire and J. Minker and J. Nicolas},
  journal = acmcs,
  number = {2},
  pages = {153-185},
  steffen = {19},
  volume = {16},
  year = {1984}
}

@article{gannor00a,
  title = {An open graph visualization system and its applications to software engineering},
  author = {E. Gansner and S. North},
  doi = {10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N},
  journal = {Software: Practice and Experience},
  number = {11},
  pages = {1203-1233},
  volume = {30},
  year = {2000}
}

@inproceedings{gapnshsh80a,
  title = {On the Temporal Basis of Fairness},
  author = {D. Gabbay and A. Pnueli and S. Shelah and J. Stavi},
  crossref = {popl80},
  pages = {163-173}
}

@book{garjoh79a,
  title = {Computers and Intractability: A Guide to the Theory of {NP}-Completeness},
  author = {M. Garey and D. Johnson},
  address = {New York},
  publisher = {W. Freeman and Co.},
  year = {1979}
}

@article{garmak94,
  title = {Nonmonotonic Inference based on Expectation Orderings},
  author = {P. G{\"a}rdenfors and D. Makinson},
  journal = ai,
  pages = {197-245},
  volume = {65},
  year = {1994}
}

@article{gaspari98a,
  title = {Concurrency and knowledge-level communication in agent languages},
  author = {M. Gaspari},
  journal = ai,
  number = {1},
  pages = {1-45},
  volume = {105},
  year = {1998}
}

@book{gaulwi09a,
  title = {Database Systems: The Complete Book},
  author = {H. Garcia-Molina and J. Ullman and J. Widom},
  edition = {2},
  publisher = {Pearson Education},
  year = {2009}
}

@inproceedings{gavgeb13a,
  title = {The {ICLP} 2013 Doctoral Consortium},
  author = {M. Gavanelli and M. Gebser},
  crossref = {iclp-tc13}
}

@inproceedings{geanwuyudo08a,
  title = {{SPADE}: the system s declarative stream processing engine},
  author = {B. Gedik and H. Andrade and K. Wu and P. Yu and M. Doo},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'08)},
  pages = {1123-1134},
  publisher = acm,
  year = {2008}
}

@inproceedings{gebkri14a,
  title = {The {ICLP} 2014 Doctoral Consortium},
  author = {M. Gebser and J. Kriener},
  crossref = {iclp-tc14}
}

@inproceedings{gebsch05a,
  title = {Loops: Relevant or Redundant?},
  author = {M. Gebser and T. Schaub},
  crossref = {lpnmr05},
  pages = {53-65}
}

@inproceedings{gebsch06a,
  title = {Tableaux Calculi for Answer Set Programming (Extended Abstract)},
  author = {M. Gebser and T. Schaub},
  crossref = {wlp06},
  pages = {1-11}
}

@inproceedings{gebsch06b,
  title = {Tableau Calculi for Answer Set Programming},
  author = {M. Gebser and T. Schaub},
  crossref = {nmr06},
  pages = {48-56}
}

@inproceedings{gebsch06c,
  title = {Tableau Calculi for Answer Set Programming},
  author = {M. Gebser and T. Schaub},
  crossref = {iclp06},
  pages = {11-25}
}

@inproceedings{gebsch06d,
  title = {Characterizing {ASP} Inferences by unit propagation},
  author = {M. Gebser and T. Schaub},
  editor = {E. Giunchiglia and V. Marek and D. Mitchell and E. Ternovska},
  booktitle = {Proceedings of the First International Workshop on Search and Logic: Answer Set Programming and {SAT} (LaSh'06)},
  pages = {41-56},
  year = {2006}
}

@inproceedings{gebsch07a,
  title = {Generic Tableaux for Answer Set Programming},
  author = {M. Gebser and T. Schaub},
  crossref = {iclp07},
  pages = {119-133}
}

@article{gebsch09a,
  title = {Tableau Calculi for Logic Programs under Answer Set Semantics},
  author = {M. Gebser and T. Schaub},
  journal = tocl,
  number = {2},
  pages = {15:1-15:40},
  volume = {14},
  year = {2013}
}

@article{gebsch16a,
  title = {Modeling and Language Extensions},
  author = {M. Gebser and T. Schaub},
  journal = aim,
  number = {3},
  pages = {33-44},
  volume = {37},
  year = {2016}
}

@inproceedings{gebser07a,
  title = {Advanced Techniques for Answer Set Programming},
  author = {M. Gebser},
  crossref = {iclp07},
  pages = {458-459}
}

@phdthesis{gebser11a,
  title = {Proof Theory and Algorithms for Answer Set Programming},
  author = {M. Gebser},
  school = uofp,
  type = {Dissertation},
  year = {2011}
}

@book{gefbon13a,
  title = {A Concise Introduction to Models and Methods for Automated Planning},
  author = {H. Geffner and B. Bonet},
  publisher = {Morgan and Claypool Publishers},
  series = {Synthesis Lectures on Artificial Intelligence and Machine Learning},
  year = {2013}
}

@inproceedings{geffner90,
  title = {Conditional Entailment: Closing the Gap between Defaults and Conditionals},
  author = {H. Geffner},
  crosref = {nmr90},
  pages = {58-72}
}

@inproceedings{geffner91,
  title = {Beyond Negation as Failure},
  author = {H. Geffner},
  crossref = {kr91}
}

@inproceedings{gefokh14a,
  title = {Transforming two-way alternating finite automata to one-way nondeterministic automata},
  author = {V. Geffert and A. Okhotin},
  booktitle = {International Symposium on Mathematical Foundations of Computer Science},
  organization = springer,
  pages = {291-302},
  year = {2014}
}

@article{gefpea92,
  title = {Conditional Entailment: Bridging Two Approaches to Default Reasoning},
  author = {H. Geffner and J. Pearl},
  journal = ai,
  number = {2-3},
  pages = {209-244},
  volume = {53},
  year = {1992}
}

@article{geghmesc08a,
  title = {Monotonic Answer Set Programming},
  author = {M. Gebser and M. Gharib and R. Mercer and T. Schaub},
  journal = jlc,
  number = {4},
  pages = {539-564},
  url = {http://logcom.oxfordjournals.org/cgi/r/exn040?ijkey=tsRvfu1amyhfqMt\&keytype=ref},
  volume = {19},
  year = {2009}
}

@inproceedings{geghsc07a,
  title = {Incremental Answer Sets and Their Computation},
  author = {M. Gebser and M. Gharib and T. Schaub},
  crossref = {asp07},
  pages = {161-174}
}

@article{gegimamo25a,
  title = {A simple proof-theoretic characterization of stable models: Reduction to difference logic and experiments},
  author = {M. Gebser and E. Giunchiglia and M. Maratea and M. Mochi},
  journal = ai,
  pages = {104276},
  volume = {340},
  year = {2025}
}

@inproceedings{geglsasc13a,
  title = {Matchmaking with Answer Set Programming},
  author = {M. Gebser and T. Glase and O. Sabuncu and T. Schaub},
  crossref = {lpnmr13},
  pages = {342-347}
}

@inproceedings{gegrkaobsasc12b,
  title = {Stream Reasoning with Answer Set Programming: Preliminary Report},
  author = {M. Gebser and T. Grote and R. Kaminski and P. Obermeier and O. Sabuncu and T. Schaub},
  crossref = {kr12},
  pages = {613-617}
}

@inproceedings{gegrkaobsasc12c,
  title = {Answer Set Programming for Stream Reasoning},
  author = {M. Gebser and T. Grote and R. Kaminski and P. Obermeier and O. Sabuncu and T. Schaub},
  crossref = {aspocp12}
}

@inproceedings{gegrkasc11a,
  title = {Reactive Answer Set Programming},
  author = {M. Gebser and T. Grote and R. Kaminski and T. Schaub},
  crossref = {lpnmr11},
  pages = {54-66}
}

@inproceedings{gegrsc10a,
  title = {Coala: A Compiler from Action Languages to {ASP}},
  author = {M. Gebser and T. Grote and T. Schaub},
  crossref = {jelia10},
  pages = {360-364}
}

@inproceedings{geguhnmi04a,
  title = {Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework},
  author = {C. Gebruers and A. Guerri and B. Hnich and M. Milano},
  crossref = {cpaior04},
  pages = {380-386}
}

@inproceedings{geguivscsithve10a,
  title = {Repair and prediction (under inconsistency) in large biological networks with answer set programming},
  author = {M. Gebser and C. Guziolowski and M. Ivanchev and T. Schaub and A. Siegel and S. Thiele and P. Veber},
  crossref = {kr10},
  pages = {497-507}
}

@inproceedings{geguqurosc16a,
  title = {Knowledge-based Sequence Mining with {ASP}},
  author = {M. Gebser and T. Guyet and R. Quiniou and J. Romero and T. Schaub},
  crossref = {ijcai16},
  pages = {1497-1504}
}

@article{gehakalisc15a,
  title = {Abstract {G}ringo},
  author = {M. Gebser and A. Harrison and R. Kaminski and V. Lifschitz and T. Schaub},
  doi = {10.1017/S1471068415000150},
  journal = tplp,
  number = {4-5},
  pages = {449-463},
  volume = {15},
  year = {2015}
}

@article{gehalosadi09a,
  title = {Deterministic Planning in the Fifth International Planning Competition: {PDDL3} and Experimental Evaluation of the Planners},
  author = {A. Gerevini and P. Haslum and D. Long and A. Saetti and Y. Dimopoulos},
  journal = ai,
  number = {5-6},
  pages = {619-668},
  volume = {173},
  year = {2009}
}

@inproceedings{gehiscth09a,
  title = {xpanda: A (Simple) Preprocessor for Adding Multi-Valued Propositions to {ASP}},
  author = {M. Gebser and H. Hinrichs and T. Schaub and S. Thiele},
  editor = {U. Geske and A. Wolf},
  booktitle = {Proceedings of the Twenty-third Workshop on (Constraint) Logic Programming (WLP'09)},
  year = {2009}
}

@inproceedings{gejajokasc15a,
  title = {{ASP} Solving for Expanding Universes},
  author = {M. Gebser and T. Janhunen and H. Jost and R. Kaminski and T. Schaub},
  crossref = {lpnmr15},
  pages = {354-367}
}

@inproceedings{gejakascsh15a,
  title = {Writing Declarative Specifications for Clauses},
  author = {M. Gebser and T. Janhunen and R. Kaminski and T. Schaub and S. Tasharrofi},
  crossref = {gttv15}
}

@inproceedings{gejakascta16a,
  title = {Writing Declarative Specifications for Clauses},
  author = {M. Gebser and T. Janhunen and R. Kaminski and T. Schaub and S. Tasharrofi},
  crossref = {jelia16},
  pages = {256-271}
}

@misc{gejaosscth08a,
  title = {A Versatile Intermediate Language for Answer Set Programming: Syntax Proposal},
  author = {M. Gebser and T. Janhunen and M. Ostrowski and T. Schaub and S. Thiele},
  howpublished = {Unpublished draft},
  url = {http://www.cs.uni-potsdam.de/wv/pdfformat/gejaosscth08a.pdf},
  year = {2008}
}

@inproceedings{gejaosscth08b,
  title = {A Versatile Intermediate Language for Answer Set Programming},
  author = {M. Gebser and T. Janhunen and M. Ostrowski and T. Schaub and S. Thiele},
  crossref = {nmr08},
  pages = {150-159}
}

@inproceedings{gejari14a,
  title = {{ASP} Encodings of Acyclicity Properties},
  author = {M. Gebser and T. Janhunen and J. Rintanen},
  crossref = {kr14}
}

@inproceedings{gejari14b,
  title = {Declarative Encodings of Acyclicity Properties},
  author = {M. Gebser and T. Janhunen and J. Rintanen},
  crossref = {aspocp14}
}

@inproceedings{gejari14c,
  title = {Answer Set Programming as {SAT} modulo Acyclicity},
  author = {M. Gebser and T. Janhunen and J. Rintanen},
  crossref = {ecai14},
  pages = {351-356}
}

@inproceedings{gejari14d,
  title = {{SAT} modulo Graphs: Acyclicity},
  author = {M. Gebser and T. Janhunen and J. Rintanen},
  crossref = {jelia14},
  pages = {137-151}
}

@article{gejari20a,
  title = {Declarative Encodings of Acyclicity Properties},
  author = {M. Gebser and T. Janhunen and J. Rintanen},
  journal = jlc,
  number = {4},
  pages = {923-952},
  volume = {30},
  year = {2020}
}

@inproceedings{gejokaobsascsc13a,
  title = {Ricochet Robots: A transverse {ASP} benchmark},
  author = {M. Gebser and H. Jost and R. Kaminski and P. Obermeier and O. Sabuncu and T. Schaub and M. Schneider},
  crossref = {lpnmr13},
  pages = {348-360}
}

@article{gekakaluobosroscscwa18a,
  title = {The {P}otsdam Answer Set Solving Collection 5.0},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and P. L{\"u}hne and P. Obermeier and M. Ostrowski and J. Romero and T. Schaub and S. Schellhorn and P. Wanko},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {181-182},
  volume = {32},
  year = {2018}
}

@inproceedings{gekakalurosc16a,
  title = {Answer Set Solving with Generalized Learned Constraints},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and P. L{\"u}hne and J. Romero and T. Schaub},
  crossref = {iclp-lipics16},
  pages = {9:1-9:15}
}

@misc{gekakalurosc16b,
  title = {Answer Set Solving with Generalized Learned Constraints (Extended Version)},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and P. L{\"u}hne and J. Romero and T. Schaub},
  note = {Extended version of~\cite{gekakalurosc16a}},
  url = {http://www.cs.uni-potsdam.de/wv/publications/},
  year = {2016}
}

@article{gekakaosscsc11a,
  title = {Potassco: The {P}otsdam Answer Set Solving Collection},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Ostrowski and T. Schaub and M. Schneider},
  doi = {10.3233/AIC-2011-0491},
  journal = aicom,
  number = {2},
  pages = {107-124},
  volume = {24},
  year = {2011}
}

@inproceedings{gekakaosscth08a,
  title = {Engineering an Incremental {ASP} Solver},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Ostrowski and T. Schaub and S. Thiele},
  crossref = {iclp08},
  pages = {190-205}
}

@inproceedings{gekakaosscth08b,
  title = {Engineering an Incremental {ASP} Solver: Preliminary Report},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Ostrowski and T. Schaub and S. Thiele},
  crossref = {nmr08},
  pages = {160-169}
}

@inproceedings{gekakaosscwa16a,
  title = {Theory Solving Made Easy with Clingo~5},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Ostrowski and T. Schaub and P. Wanko},
  crossref = {iclp-lipics16},
  pages = {2:1-2:15}
}

@misc{gekakaosscwa16b,
  title = {Theory Solving made easy with Clingo~5 (Extended Version)},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Ostrowski and T. Schaub and P. Wanko},
  note = {Extended version of~\cite{gekakaosscwa16a}},
  url = {http://www.cs.uni-potsdam.de/wv/publications/},
  year = {2016}
}

@inproceedings{gekakarosc15a,
  title = {Progress in clasp Series 3},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and J. Romero and T. Schaub},
  crossref = {lpnmr15},
  pages = {368-383}
}

@inproceedings{gekakasc09a,
  title = {On the Implementation of Weight Constraint Rules in Conflict-Driven {ASP} Solvers},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  crossref = {iclp09},
  pages = {250-264}
}

@incollection{gekakasc11a,
  title = {Challenges in Answer Set Solving},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  crossref = {mg65},
  pages = {74-90}
}

@misc{gekakasc11b,
  title = {Multi-Criteria Optimization in {ASP} and its Application to {L}inux Package Configuration},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  url = {http://www.cs.uni-potsdam.de/wv/pdfformat/gekakasc11b.pdf},
  year = {2011}
}

@inproceedings{gekakasc11c,
  title = {Multi-Criteria Optimization in Answer Set Programming},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  crossref = {iclp-lipics11},
  pages = {1-10}
}

@inproceedings{gekakasc11d,
  title = {Multi-Criteria Optimization in {ASP} and its Application to {L}inux Package Configuration},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  crossref = {pos11}
}

@book{gekakasc12a,
  title = {Answer Set Solving in Practice},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  doi = {10.1007/978-3-031-01561-8},
  publisher = {Morgan and Claypool Publishers},
  series = {Synthesis Lectures on Artificial Intelligence and Machine Learning},
  year = {2012}
}

@techreport{gekakasc14a,
  title = {\textit{Clingo} = {ASP} + Control: Extended Report},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  institution = {Universit{\"a}t Potsdam},
  url = {http://www.cs.uni-potsdam.de/wv/pdfformat/gekakasc14a.pdf},
  year = {2014}
}

@inproceedings{gekakasc14b,
  title = {\textit{Clingo} = {ASP} + Control: Preliminary Report},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  annote = {USED v1 to indicate version one},
  crossref = {iclp-tc14},
  url = {http://arxiv.org/abs/1405.3694v1}
}

@article{gekakasc17a,
  title = {Multi-shot {ASP} solving with clingo},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  doi = {10.1017/S1471068418000054},
  journal = tplp,
  number = {1},
  pages = {27-82},
  volume = {19},
  year = {2019}
}

@inproceedings{gekakascsc11a,
  title = {Cluster-based {ASP} Solving with claspar},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub and B. Schnor},
  crossref = {lpnmr11},
  pages = {364-369}
}

@inproceedings{gekakascsczi11a,
  title = {A Portfolio Solver for Answer Set Programming: Preliminary Report},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub and M. Schneider and S. Ziller},
  crossref = {lpnmr11},
  pages = {352-357}
}

@inproceedings{gekaknsc11a,
  title = {plasp: A Prototype for {PDDL}-Based Planning in {ASP}},
  author = {M. Gebser and R. Kaminski and M. Knecht and T. Schaub},
  crossref = {lpnmr11},
  doi = {10.1007/978-3-642-20895-9\_41},
  pages = {358-363}
}

@inproceedings{gekakosc11a,
  title = {Advances in gringo Series 3},
  author = {M. Gebser and R. Kaminski and A. K{\"o}nig and T. Schaub},
  crossref = {lpnmr11},
  pages = {345-351}
}

@inproceedings{gekanesc07a,
  title = {Conflict-Driven Answer Set Solving},
  author = {M. Gebser and B. Kaufmann and A. Neumann and T. Schaub},
  crossref = {ijcai07},
  pages = {386-392}
}

@inproceedings{gekanesc07b,
  title = {clasp: A Conflict-Driven Answer Set Solver},
  author = {M. Gebser and B. Kaufmann and A. Neumann and T. Schaub},
  crossref = {lpnmr07},
  pages = {260-265}
}

@inproceedings{gekanesc07c,
  title = {Conflict-Driven Answer Set Enumeration},
  author = {M. Gebser and B. Kaufmann and A. Neumann and T. Schaub},
  crossref = {lpnmr07},
  pages = {136-148}
}

@inproceedings{gekanesc08a,
  title = {Advanced Preprocessing for Answer Set Solving},
  author = {M. Gebser and B. Kaufmann and A. Neumann and T. Schaub},
  crossref = {ecai08},
  pages = {15-19}
}

@inproceedings{gekaobsc15a,
  title = {Ricochet Robots Reloaded: A Case-study in Multi-shot {ASP} Solving},
  author = {M. Gebser and R. Kaminski and P. Obermeier and T. Schaub},
  crossref = {gb60},
  pages = {17-32}
}

@inproceedings{gekaosscth09a,
  title = {On the Input Language of {ASP} Grounder Gringo},
  author = {M. Gebser and R. Kaminski and M. Ostrowski and T. Schaub and S. Thiele},
  crossref = {lpnmr09},
  pages = {502-508}
}

@inproceedings{gekaotroscwa13a,
  title = {Domain-specific Heuristics in Answer Set Programming},
  author = {M. Gebser and B. Kaufmann and R. Otero and J. Romero and T. Schaub and P. Wanko},
  crossref = {aaai13},
  pages = {350-356}
}

@inproceedings{gekasc09a,
  title = {Solution Enumeration for Projected {B}oolean Search Problems},
  author = {M. Gebser and B. Kaufmann and T. Schaub},
  crossref = {cpaior09},
  pages = {71-86}
}

@inproceedings{gekasc09b,
  title = {The Conflict-Driven Answer Set Solver clasp: Progress Report},
  author = {M. Gebser and B. Kaufmann and T. Schaub},
  crossref = {lpnmr09},
  pages = {509-514}
}

@article{gekasc09c,
  title = {Conflict-Driven Answer Set Solving: From Theory to Practice},
  author = {M. Gebser and B. Kaufmann and T. Schaub},
  doi = {10.1016/j.artint.2012.04.001},
  journal = ai,
  pages = {52-89},
  volume = {187-188},
  year = {2012}
}

@article{gekasc11b,
  title = {Complex Optimization in Answer Set Programming},
  author = {M. Gebser and R. Kaminski and T. Schaub},
  journal = tplp,
  number = {4-5},
  pages = {821-839},
  volume = {11},
  year = {2011}
}

@inproceedings{gekasc11c,
  title = {aspcud: A {L}inux Package Configuration Tool Based on Answer Set Programming},
  author = {M. Gebser and R. Kaminski and T. Schaub},
  crossref = {lococo11},
  doi = {10.4204/eptcs.65.2},
  pages = {12-25}
}

@incollection{gekasc12a,
  title = {Gearing up for Effective {ASP} Planning},
  author = {M. Gebser and R. Kaminski and T. Schaub},
  crossref = {vl65},
  pages = {296-310}
}

@article{gekasc12b,
  title = {Multi-threaded {ASP} Solving with clasp},
  author = {M. Gebser and B. Kaufmann and T. Schaub},
  journal = tplp,
  number = {4-5},
  pages = {525-545},
  volume = {12},
  year = {2012}
}

@inproceedings{gekasc13a,
  title = {Advanced Conflict-Driven Disjunctive Answer Set Solving},
  author = {M. Gebser and B. Kaufmann and T. Schaub},
  crossref = {ijcai13},
  pages = {912-918}
}

@inproceedings{gekasc15a,
  title = {Grounding Recursive Aggregates: Preliminary Report},
  author = {M. Gebser and R. Kaminski and T. Schaub},
  crossref = {gttv15},
  url = {http://arxiv.org/abs/1603.03884}
}

@article{gekaza20a,
  title = {Complement for two-way alternating automata},
  author = {V. Geffert and C. Kapoutsis and M. Zakzok},
  journal = acta,
  number = {5},
  pages = {463-495},
  publisher = springer,
  volume = {58},
  year = {2021}
}

@inproceedings{gekoscthve10a,
  title = {The {BioASP} Library: {ASP} Solutions for Systems Biology},
  author = {M. Gebser and A. K{\"o}nig and T. Schaub and S. Thiele and P. Veber},
  crossref = {ictai10},
  pages = {383-389}
}

@inproceedings{gelaniscsc18a,
  title = {{ASP}-Based Time-Bounded Planning for Logistics Robots},
  author = {M. Gebser and G. Lakemeyer and T. Niemueller and T. Schaub and B. Sch{\"a}pers},
  crossref = {icaps18},
  pages = {509-517}
}

@inproceedings{gelder09a,
  title = {Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces},
  author = {A. {Van Gelder}},
  crossref = {sat09},
  pages = {141-146}
}

@inproceedings{gelder92a,
  title = {The Well-Founded Semantics of Aggregation},
  author = {A. {Van Gelder}},
  crossref = {pods92},
  pages = {127-138}
}

@inproceedings{geleli06a,
  title = {Elementary Sets for Logic Programs},
  author = {M. Gebser and J. Lee and Y. Lierler},
  crossref = {nmr06},
  pages = {68-75}
}

@inproceedings{geleli06b,
  title = {Elementary Sets for Logic Programs},
  author = {M. Gebser and J. Lee and Y. Lierler},
  crossref = {aaai06},
  pages = {244-249}
}

@inproceedings{geleli07a,
  title = {Head-Elementary-Set-Free Logic Programs},
  author = {M. Gebser and J. Lee and Y. Lierler},
  crossref = {lpnmr07},
  pages = {149-161}
}

@article{geleli11a,
  title = {On Elementary Loops of Logic Programs},
  author = {M. Gebser and J. Lee and Y. Lierler},
  journal = tplp,
  number = {6},
  pages = {953-988},
  volume = {11},
  year = {2011}
}

@inproceedings{gelemaperisc18a,
  title = {Evaluation Techniques and Systems for Answer Set Programming: A Survey},
  author = {M. Gebser and N. Leone and M. Maratea and S. Perri and F. Ricca and T. Schaub},
  crossref = {ijcai18},
  pages = {5450-5456}
}

@inproceedings{gelfond02a,
  title = {Representing Knowledge in {A}-Prolog},
  author = {M. Gelfond},
  crossref = {kowalski02},
  pages = {413-451}
}

@inproceedings{gelfond04a,
  title = {Answer Set Programming and the Design of Deliberative Agents},
  author = {M. Gelfond},
  crossref = {iclp04},
  pages = {19-26},
  year = {2004}
}

@incollection{gelfond08a,
  title = {Answer Sets},
  author = {M. Gelfond},
  chapter = {7},
  crossref = {KRHandbook},
  pages = {285-316}
}

@inproceedings{gelfond11a,
  title = {New Semantics for Epistemic Specifications},
  author = {M. Gelfond},
  crossref = {lpnmr11},
  pages = {260-265},
  year = {2011}
}

@inproceedings{gelfond87a,
  title = {On Stratified Autoepistemic Theories},
  author = {M. Gelfond},
  crossref = {aaai87},
  pages = {207-211}
}

@inproceedings{gelfond91a,
  title = {Strong Introspection},
  author = {M. Gelfond},
  crossref = {aaai91},
  pages = {386-391},
  year = {1991}
}

@article{gelfond94a,
  title = {Logic Programming and Reasoning with Incomplete Information},
  author = {M. Gelfond},
  journal = amai,
  number = {1-2},
  pages = {89-116},
  volume = {12},
  year = {1994}
}

@inproceedings{gelgab97a,
  title = {From Functional Specifications to Logic Programms},
  author = {M. Gelfond and A. Gabaldon},
  crossref = {slp97},
  pages = {355-369}
}

@inproceedings{gelgal01a,
  title = {Diagnosing Dynamic Systems in {A-Prolog}},
  author = {M. Gelfond and J. Galloway},
  crossref = {asp01},
  pages = {77-83},
  url = {http://www.cs.nmsu.edu/~tson/ASP2001/9.ps}
}

@article{gelinc13a,
  title = {Some properties of system descriptions of $\mathcal{AL}_d$},
  author = {M. Gelfond and D. Inclezan},
  journal = jancl,
  number = {1-2},
  pages = {259-285},
  volume = {23},
  year = {2013}
}

@inproceedings{geliprtr91,
  title = {Disjunctive Defaults},
  author = {M. Gelfond and V. Lifschitz and H. Przymusinska and M. Truszczy{\'n}ski},
  crossref = {kr91},
  pages = {230-237}
}

@book{gelkah14a,
  title = {Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach},
  author = {M. Gelfond and Y. Kahl},
  publisher = cup,
  year = {2014}
}

@article{gelleo02a,
  title = {Logic programming and knowledge representation --- the {A}-{P}rolog perspective},
  author = {M. Gelfond and N. Leone},
  journal = ai,
  number = {1-2},
  pages = {3-38},
  volume = {138},
  year = {2002}
}

@inproceedings{gellif88a,
  title = {Compiling Circumscriptive Theories into Logic Programs},
  author = {M. Gelfond and V. Lifschitz},
  crossref = {aaai88},
  pages = {455-459}
}

@inproceedings{gellif88b,
  title = {The Stable Model Semantics for Logic Programming},
  author = {M. Gelfond and V. Lifschitz},
  editor = {R. Kowalski and K. Bowen},
  booktitle = {Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP'88)},
  doi = {10.1201/b10397-6},
  pages = {1070-1080},
  publisher = {MIT Press},
  year = {1988}
}

@inproceedings{gellif90a,
  title = {Logic Programs with Classical Negation},
  author = {M. Gelfond and V. Lifschitz},
  crossref = {iclp90},
  pages = {579-597}
}

@article{gellif91a,
  title = {Classical Negation in Logic Programs and Disjunctive Databases},
  author = {M. Gelfond and V. Lifschitz},
  journal = ngc,
  pages = {365-385},
  volume = {9},
  year = {1991}
}

@article{gellif93a,
  title = {Representing Action and Change by Logic Programs},
  author = {M. Gelfond and V. Lifschitz},
  journal = jlp,
  number = {2-4},
  pages = {301-321},
  volume = {17},
  year = {1993}
}

@article{gellif98a,
  title = {Action languages},
  author = {M. Gelfond and V. Lifschitz},
  journal = etai,
  number = {6},
  pages = {193-210},
  url = {http://www.ep.liu.se/ej/etai/1998/007/},
  volume = {3},
  year = {1998}
}

@inproceedings{gellob08a,
  title = {Authorization and Obligation Policies in Dynamic Systems},
  author = {M. Gelfond and J. Lobo},
  crossref = {iclp08},
  pages = {22-36}
}

@article{gelope05a,
  title = {General Game Playing: Overview of the {AAAI} Competition},
  author = {M. Genesereth and N. Love and B. Pell},
  journal = aim,
  number = {2},
  pages = {62-72},
  volume = {26},
  year = {2005}
}

@inproceedings{gelpri93a,
  title = {Reasoning on Open Domains},
  author = {M. Gelfond and H. Przymusinska},
  crossref = {lpnmr93},
  pages = {397-413},
  year = {1993}
}

@article{gelprz86,
  title = {Negation as Failure: Careful Closure Procedure},
  author = {M. Gelfond and H. Przymusinska},
  journal = ai,
  volume = {30},
  year = {1986}
}

@inproceedings{gelprz90,
  title = {Formalization of Inheritance Reasoning in Autoepistemic Logic},
  author = {M. Gelfond and H. Przymusinska},
  crossref = {nmr90},
  pages = {73-107}
}

@article{gelprz96a,
  title = {Towards a Theory of Elaboration Tolerance: Logic Programming Approach},
  author = {M. Gelfond and H. Przymusinska},
  journal = {International Journal of Software Engineering and Knowledge Engineering},
  number = {1},
  pages = {89-112},
  volume = {6},
  year = {1996}
}

@inproceedings{gelson97a,
  title = {Reasoning with Prioritized Defaults.},
  author = {M. Gelfond and T. Son},
  editor = {J. Dix and L. Pereira and T. Przymusinski},
  booktitle = {Third International Workshop on Logic Programming and Knowledge Representation},
  pages = {164-223},
  publisher = springer,
  series = lncs,
  volume = {1471},
  year = {1997}
}

@article{gelzha14a,
  title = {Vicious Circle Principle and Logic Programs with Aggregates},
  author = {M. Gelfond and Y. Zhang},
  doi = {10.1017/S1471068414000222},
  journal = tplp,
  number = {4-5},
  pages = {587-601},
  volume = {14},
  year = {2014}
}

@article{gelzha19a,
  title = {Vicious Circle Principle, Aggregates, and Formation of Sets in {ASP} Based Languages},
  author = {M. Gelfond and Y. Zhang},
  doi = {10.1016/J.ARTINT.2019.04.004},
  journal = ai,
  pages = {28-77},
  volume = {275},
  year = {2019}
}

@inproceedings{gemari15a,
  title = {The Design of the Sixth Answer Set Programming Competition},
  author = {M. Gebser and M. Maratea and F. Ricca},
  crossref = {lpnmr15},
  pages = {531-544}
}

@inproceedings{gemari16a,
  title = {What's Hot in the Answer Set Programming Competition},
  author = {M. Gebser and M. Maratea and F. Ricca},
  crossref = {aaai16},
  pages = {4327-4329}
}

@inproceedings{gemari17a,
  title = {The Design of the Seventh Answer Set Programming Competition},
  author = {M. Gebser and M. Maratea and F. Ricca},
  crossref = {lpnmr17},
  pages = {3-9}
}

@article{gemari17b,
  title = {The Sixth Answer Set Programming Competition},
  author = {M. Gebser and M. Maratea and F. Ricca},
  journal = jair,
  pages = {41-95},
  volume = {60},
  year = {2017}
}

@article{gemari19a,
  title = {The Seventh Answer Set Programming Competition: Design and Results},
  author = {M. Gebser and M. Maratea and F. Ricca},
  journal = tplp,
  number = {2},
  pages = {176-204},
  volume = {20},
  year = {2020}
}

@article{gengin85,
  title = {Logic Programming},
  author = {M. Genesereth and M. Ginsberg},
  journal = cacm,
  number = {9},
  pages = {933-941},
  publisher = acm,
  volume = {28},
  year = {1985}
}

@book{gennil87,
  title = {Logical Foundations of Artificial Intelligence},
  author = {M. Genesereth and N. Nilsson},
  publisher = m-k,
  year = {1987}
}

@inproceedings{gent02a,
  title = {Arc Consistency in {SAT}},
  author = {I. Gent},
  crossref = {ecai02},
  pages = {121-125}
}

@article{gentzen35,
  title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
  author = {G. Gentzen},
  journal = {Mathematische Zeitschrift},
  note = {English translation in \cite{szabo69}},
  pages = {176-210},
  volume = {39},
  year = {1935}
}

@article{geobotscsangso18a,
  title = {Experimenting with robotic intra-logistics domains},
  author = {M. Gebser and P. Obermeier and T. Otto and T. Schaub and O. Sabuncu and V. Nguyen and T. Son},
  doi = {10.1017/S1471068418000200},
  journal = tplp,
  number = {3-4},
  pages = {502-519},
  volume = {18},
  year = {2018}
}

@inproceedings{geobsc13a,
  title = {A system for interactive query answering with answer set programming},
  author = {M. Gebser and P. Obermeier and T. Schaub},
  crossref = {aspocp13}
}

@inproceedings{geobsc15a,
  title = {Interactive Answer Set Programming: Preliminary Report},
  author = {M. Gebser and P. Obermeier and T. Schaub},
  crossref = {iulp15},
  doi = {10.48550/arXiv.1511.01261}
}

@article{geobscra18a,
  title = {Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming},
  author = {M. Gebser and P. Obermeier and T. Schaub and M. Ratsch-Heitmann and M. Runge},
  journal = tplp,
  number = {3-4},
  pages = {520-534},
  volume = {18},
  year = {2018}
}

@inproceedings{geossc09a,
  title = {Constraint Answer Set Solving},
  author = {M. Gebser and M. Ostrowski and T. Schaub},
  crossref = {iclp09},
  doi = {10.1007/978-3-642-02846-5\_22},
  pages = {235-249}
}

@inproceedings{gepevawo95a,
  title = {Simple on-the-fly automatic verification of linear temporal logic},
  author = {R. Gerth and D. Peled and M. Vardi and P. Wolper},
  editor = {P. Dembinski and M. Sredniawa},
  booktitle = {Proceedings of the Fifteenth {IFIP} International Symposium on Protocol Specification},
  pages = {3-18},
  publisher = {Chapman {\&} Hall},
  series = {{IFIP} Conference Proceedings},
  volume = {38},
  year = {1995}
}

@article{geprpr89,
  title = {On the Relationship between Circumscription and Negation as Failure},
  author = {M. Gelfond and H. Przymusinska and T. Przymusinski},
  journal = ai,
  number = {1},
  pages = {75-94},
  volume = {38},
  year = {1989}
}

@inproceedings{gepuscto08a,
  title = {A Meta-Programming Technique for Debugging Answer-Set Programs},
  author = {M. Gebser and J. P{\"u}hrer and T. Schaub and H. Tompits},
  crossref = {aaai08},
  pages = {448-453}
}

@inproceedings{gerlon06a,
  title = {Preferences and Soft Constraints in {PDDL3}},
  author = {A. Gerevini and D. Long},
  booktitle = {Proceedings of the ICAPS 2006 Workshop on Preferences and Soft Constraints in Planning},
  pages = {46-53},
  year = {2006}
}

@article{gerosc91a,
  title = {The Well-Founded Semantics for General Logic Programs},
  author = {A. {Van Gelder} and K. Ross and J. Schlipf},
  journal = jacm,
  number = {3},
  pages = {620-650},
  volume = {38},
  year = {1991}
}

@inproceedings{gerstr05a,
  title = {Haifa{S}at: A New Robust {SAT} Solver},
  author = {R. Gershman and O. Strichman},
  crossref = {hvc05},
  pages = {76-89}
}

@inproceedings{gerstr05b,
  title = {Cost-Effective Hyper-Resolution for Preprocessing {CNF} Formulas},
  author = {R. Gershman and O. Strichman},
  crossref = {sat05},
  pages = {423-429},
  url = {http://www.cs.technion.ac.il/{\textasciitilde}gershman/papers/sat05\_full.pdf}
}

@article{gerstr08a,
  title = {Haifa{S}at: A {SAT} Solver Based on an Abstraction/Refinement Model},
  author = {R. Gershman and O. Strichman},
  journal = jsat,
  number = {1-3},
  pages = {33-51},
  volume = {6},
  year = {2008}
}

@inproceedings{gerysc15a,
  title = {Combining Heuristics for Configuration Problems Using Answer Set Programming},
  author = {M. Gebser and A. Ryabokon and G. Schenner},
  crossref = {lpnmr15},
  pages = {384-397}
}

@inproceedings{gesasc10a,
  title = {An Incremental Answer Set Programming Based System for Finite Model Computation},
  author = {M. Gebser and O. Sabuncu and T. Schaub},
  crossref = {jelia10},
  pages = {169-181}
}

@article{gesasc11a,
  title = {An Incremental Answer Set Programming Based System for Finite Model Computation},
  author = {M. Gebser and O. Sabuncu and T. Schaub},
  journal = aicom,
  number = {2},
  pages = {195-212},
  volume = {24},
  year = {2011}
}

@inproceedings{gesasc11b,
  title = {Finite Model Computation via Answer Set Programming},
  author = {M. Gebser and O. Sabuncu and T. Schaub},
  editor = {T. Walsh},
  booktitle = {Proceedings of the Best Paper Track at the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI'11)},
  pages = {2626-2631},
  publisher = {{AAAI} Press},
  year = {2011}
}

@article{gesase08a,
  title = {An Approach to Efficient Planning with Numerical Fluents and Multi-Criteria Plan Quality},
  author = {A. Gerevini and A. Saetti and I. Serina},
  journal = ai,
  number = {8-9},
  pages = {899-944},
  publisher = elsevier,
  volume = {172},
  year = {2008}
}

@article{gescer19a,
  title = {Applications of non-monotonic reasoning to automotive product configuration using answer set programming},
  author = {E. Gen{\c{c}}ay and P. Sch{\"u}ller and E. Erdem},
  doi = {10.1007/s10845-017-1333-3},
  journal = jim,
  pages = {1407-1422},
  volume = {30},
  year = {2019}
}

@inproceedings{gescth07a,
  title = {Gringo: A New Grounder for Answer Set Programming},
  author = {M. Gebser and T. Schaub and S. Thiele},
  crossref = {lpnmr07},
  pages = {266-271}
}

@inproceedings{gescthusve08a,
  title = {Detecting Inconsistencies in Large Biological Networks with Answer Set Programming},
  author = {M. Gebser and T. Schaub and S. Thiele and B. Usadel and P. Veber},
  crossref = {wcb08}
}

@inproceedings{gescthusve08b,
  title = {Detecting Inconsistencies in Large Biological Networks with Answer Set Programming},
  author = {M. Gebser and T. Schaub and S. Thiele and B. Usadel and P. Veber},
  crossref = {iclp08},
  pages = {130-144}
}

@article{gescthve10a,
  title = {Detecting Inconsistencies in Large Biological Networks with Answer Set Programming},
  author = {M. Gebser and T. Schaub and S. Thiele and P. Veber},
  journal = tplp,
  number = {2-3},
  pages = {323-360},
  volume = {11},
  year = {2011}
}

@inproceedings{gesctowo07a,
  title = {Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report},
  author = {M. Gebser and T. Schaub and H. Tompits and S. Woltran},
  crossref = {cent07},
  pages = {37-48}
}

@inproceedings{gesctowo08a,
  title = {Alternative Characterizations for Program Equivalence under Answer-Set Semantics based on Unfounded Sets},
  author = {M. Gebser and T. Schaub and H. Tompits and S. Woltran},
  crossref = {foiks08},
  pages = {24-41}
}

@inproceedings{ghmesc07a,
  title = {Incremental Answer Set Programming: A Preliminary Report},
  author = {M. Gharib and R. Mercer and T. Schaub},
  crossref = {asp07},
  pages = {161-174}
}

@inproceedings{giafav21a,
  title = {Compositional Approach to Translate {LTLf}/{LDLf} into Deterministic Finite Automata},
  author = {G. {D}e Giacomo and M. Favorito},
  crossref = {icaps21},
  pages = {122-130},
  url = {https://ojs.aaai.org/index.php/ICAPS/article/view/15954}
}

@inproceedings{gialev99ai,
  title = {An Incremental Interpreter for High-Level Programs with Sensing},
  author = {G. {D}e Giacomo and H. Levesque},
  editor = {H. Levesque and F. Pirri},
  booktitle = {Logical Foundations for Cognitive Agents},
  pages = {86-102},
  publisher = springer,
  series = ai,
  year = {1999}
}

@inproceedings{giarub18a,
  title = {Automata-Theoretic Foundations of FOND Planning for {LTLf} and {LDLf} Goals},
  author = {G. {D}e Giacomo and S. Rubin},
  crossref = {ijcai18},
  doi = {10.24963/ijcai.2018/657},
  pages = {4729-4735}
}

@inproceedings{giavar13a,
  title = {Linear Temporal Logic and Linear Dynamic Logic on Finite Traces},
  author = {G. {D}e Giacomo and M. Vardi},
  crossref = {ijcai13},
  pages = {854-860}
}

@inproceedings{giavar15a,
  title = {Synthesis for {LTL} and {LDL} on Finite Traces},
  author = {G. {D}e Giacomo and M. Vardi},
  crossref = {ijcai15},
  pages = {1558-1564},
  url = {http://ijcai.org/Abstract/15/223}
}

@inproceedings{giavar16a,
  title = {{LTL}$_f$ and {LDL}$_f$ Synthesis under Partial Observability},
  author = {G. {D}e Giacomo and M. Vardi},
  crossref = {ijcai16},
  pages = {1044-1050},
  url = {http://www.ijcai.org/Abstract/16/152}
}

@article{gikali97a,
  title = {Representing Action: Indeterminacy and Ramifications},
  author = {E. Giunchiglia and G. Kartha and V. Lifschitz},
  journal = ai,
  number = {2},
  pages = {409-438},
  volume = {95},
  year = {1997}
}

@inproceedings{gilamesc03a,
  title = {Solving Max-{SAT} as Weighted {CSP}},
  author = {S. de Givry and J. Larrosa and P. Meseguer and T. Schiex},
  crossref = {cp03},
  pages = {363-376}
}

@article{gilele00a,
  title = {{ConGolog}, a concurrent programming language based on the situation calculus},
  author = {G. {D}e Giacomo and Y. Lesp{\'e}rance and H. Levesque},
  journal = ai,
  number = {1-2},
  pages = {109-169},
  volume = {121},
  year = {2000}
}

@article{gilelimctu03a,
  title = {Nonmonotonic causal theories},
  author = {E. Giunchiglia and J. Lee and V. Lifschitz and N. McCain and H. Turner},
  journal = ai,
  number = {1-2},
  pages = {49-104},
  volume = {153},
  year = {2004}
}

@article{gilema08a,
  title = {On the Relation among Answer Set Solvers},
  author = {E. Giunchiglia and N. Leone and M. Maratea},
  journal = amai,
  number = {1-4},
  pages = {169-204},
  volume = {53},
  year = {2008}
}

@inproceedings{gilima04a,
  title = {A {SAT}-Based Polynomial Space Algorithm for Answer Set Programming},
  author = {E. Giunchiglia and Y. Lierler and M. Maratea},
  crossref = {nmr04},
  pages = {189-196}
}

@inproceedings{gilima04b,
  title = {{SAT}-Based Answer Set Programming},
  author = {E. Giunchiglia and Y. Lierler and M. Maratea},
  crossref = {aaai04},
  pages = {61-66}
}

@article{gilima06a,
  title = {Answer Set Programming based on Propositional Satisfiability},
  author = {E. Giunchiglia and Y. Lierler and M. Maratea},
  journal = jar,
  number = {4},
  pages = {345-377},
  volume = {36},
  year = {2006}
}

@inproceedings{gimagrmamo14a,
  title = {Monitoring Business Metaconstraints Based on {LTL} and {LDL} for Finite Traces},
  author = {G. {D}e Giacomo and R. {D}e Masellis and M. Grasso and F. Maggi and M. Montali},
  crossref = {bpm14},
  pages = {1-17}
}

@article{gimagrmamo14b,
  title = {{LTLf} and {LDLf} Monitoring: {A} Technical Report},
  author = {G. {D}e Giacomo and R. {D}e Masellis and M. Grasso and F. Maggi and M. Montali},
  journal = {CoRR},
  volume = {abs/1405.0054},
  year = {2014}
}

@article{gimamamo20a,
  title = {Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces},
  author = {G. {D}e Giacomo and R. {D}e Masellis and F. Maggi and M. Montali},
  journal = {CoRR},
  volume = {abs/2004.01859},
  year = {2020}
}

@inproceedings{gimamo14a,
  title = {Reasoning on {LTL} on Finite Traces: Insensitivity to Infiniteness},
  author = {G. {D}e Giacomo and R. {D}e Masellis and M. Montali},
  crossref = {aaai14},
  pages = {1027-1033}
}

@incollection{gimana09a,
  title = {Reasoning with Quantified {B}oolean Formulas},
  author = {E. Giunchiglia and P. Marin and M. Narizzano},
  chapter = {24},
  crossref = {SATHandbook},
  pages = {761-780}
}

@article{gimasc00a,
  title = {Reasoning about Actions in Dynamic Linear Time Temporal Logic},
  author = {L. Giordano and A. Martelli and C. Schwind},
  journal = {Logic Journal of the {IGPL}},
  number = {2},
  pages = {273-288},
  volume = {9},
  year = {2001}
}

@inproceedings{gimata02a,
  title = {Dependent and Independent Variables in Propositional Satisfiability},
  author = {E. Giunchiglia and M. Maratea and A. Tacchella},
  crossref = {jelia02},
  pages = {296-307}
}

@inproceedings{gimath12a,
  title = {Achieving Completeness in Bounded Model Checking of Action Theories in {ASP}},
  author = {L. Giordano and A. Martelli and D. {Theseider Dupr{\'e}}},
  crossref = {kr12}
}

@article{gimath13a,
  title = {Reasoning about actions with Temporal Answer Sets},
  author = {L. Giordano and A. Martelli and D. {Theseider Dupr{\'e}}},
  journal = tplp,
  number = {2},
  pages = {201-225},
  volume = {13},
  year = {2013}
}

@inproceedings{gimupape21a,
  title = {Timed Trace Alignment with Metric Temporal Logic over Finite Traces},
  author = {G. {D}e Giacomo and A. Murano and F. Patrizi and G. Perelli},
  crossref = {kr21},
  doi = {10.24963/kr.2021/22},
  pages = {227-236}
}

@article{ginata06a,
  title = {Clause/Term Resolution and Learning in the Evaluation of Quantified {B}oolean Formulas},
  author = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  journal = jair,
  pages = {371-416},
  volume = {26},
  year = {2006}
}

@article{ginata07a,
  title = {Quantifier Structure in Search-Based Procedures for {QBF}s},
  author = {E. Giunchiglia and M. Narizzano and A. Tacchella},
  journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  number = {3},
  pages = {497-507},
  volume = {26},
  year = {2007}
}

@article{ginsberg86a,
  title = {Multi-Valued Logics},
  author = {M. Ginsberg},
  journal = {Proceedings of the 5th National Conference on Artificial Intelligence},
  pages = {234-247},
  year = {1986}
}

@article{ginsberg86b,
  title = {Counterfactuals},
  author = {M. Ginsberg},
  journal = ai,
  number = {1},
  pages = {35-79},
  volume = {30},
  year = {1986}
}

@book{ginsberg87a,
  title = {Readings in Nonmonotonic Reasoning},
  editor = {M. Ginsberg},
  publisher = m-k,
  year = {1987}
}

@inproceedings{ginsberg89a,
  title = {A Circumscriprive Theorem Prover},
  author = {M. Ginsberg},
  editor = {M. Reinfrank and J. de Kleer and M. Ginsberg and E. Sandewall},
  booktitle = {Proceedings of the Second International Workshop on Non-Monotonic Reasoning},
  pages = {100-114},
  publisher = springer,
  series = lnai,
  volume = {346},
  year = {1989}
}

@article{ginsberg89b,
  title = {A Circumscriprive Theorem Prover},
  author = {M. Ginsberg},
  journal = ai,
  pages = {209-230},
  volume = {39},
  year = {1989}
}

@inproceedings{ginsberg90a,
  title = {The Computational Value of Nonmonotonic Reasoning},
  author = {M. Ginsberg},
  crossref = {nmr90},
  pages = {108-118}
}

@inproceedings{ginsberg90b,
  title = {A Local Formalization of Inheritance: Preliminary Report},
  author = {M. Ginsberg},
  crossref = {nmr90},
  pages = {119-129}
}

@inproceedings{ginsberg91a,
  title = {Computational Considerations in Reasoning about Action},
  author = {M. Ginsberg},
  crossref = {kr91}
}

@inproceedings{ginsberg91b,
  title = {The Computational Value of Nonmonotonic Reasoning},
  author = {M. Ginsberg},
  crossref = {kr91}
}

@article{ginsmi88a,
  title = {Reasoning about Action {I}: A Possible Worlds Approach},
  author = {M. Ginsberg and D. Smith},
  journal = ai,
  number = {2},
  pages = {165-195},
  volume = {35},
  year = {1988}
}

@article{ginsmi88b,
  title = {Reasoning about Action {II}: The Qualification Problem},
  author = {M. Ginsberg and D. Smith},
  journal = ai,
  number = {3},
  pages = {311-342},
  volume = {35},
  year = {1988}
}

@article{giomar94a,
  title = {On cumulative default logics},
  author = {L. Giordano and A. Martinelli},
  journal = ai,
  number = {1},
  pages = {161-179},
  volume = {66},
  year = {1994}
}

@inproceedings{giordano93,
  title = {Defining Variants of Default logic: A Modal Approach},
  author = {L. Giordano},
  booktitle = {Seventh International Symposium on Methodologies for Intelligent Systems (ISMIS'93)},
  pages = {59-68},
  publisher = springer,
  year = {1993}
}

@article{girard87,
  title = {Linear Logic},
  author = {J. Girard},
  journal = tcs,
  pages = {1-102},
  volume = {50},
  year = {1987}
}

@inproceedings{giulif98a,
  title = {An Action Language Based on Causal Explanation: Preliminary Report},
  author = {E. Giunchiglia and V. Lifschitz},
  booktitle = aaai,
  pages = {623-630},
  url = {citeseer.nj.nec.com/article/giunchiglia98action.html},
  year = {1998}
}

@inproceedings{giulif99a,
  title = {Action Languages, Temporal Action Logics and the Situation Calculus},
  author = {E. Giunchiglia and V. Lifschitz},
  booktitle = {Working Notes of the IJCAI-99 Workshop on Nonmonotonic Reasoning, Action, and Change},
  year = {1999}
}

@inproceedings{giumar05a,
  title = {On the Relation Between Answer Set and {SAT} Procedures (or, Between cmodels and smodels).},
  author = {E. Giunchiglia and M. Maratea},
  crossref = {iclp05},
  pages = {37-51}
}

@inproceedings{giumar06a,
  title = {Solving Optimization Problems with {DLL}},
  author = {E. Giunchiglia and M. Maratea},
  crossref = {ecai06},
  pages = {377-381}
}

@inproceedings{giumar07a,
  title = {Planning as Satisfiability with Preferences},
  author = {E. Giunchiglia and M. Maratea},
  crossref = {aaai07},
  pages = {987-992}
}

@article{giumar11a,
  title = {Introducing Preferences in Planning as Satisfiability},
  author = {E. Giunchiglia and M. Maratea},
  journal = jlc,
  number = {2},
  pages = {205-229},
  volume = {21},
  year = {2011}
}

@incollection{giumar12a,
  title = {Algorithms for Solving Satisfiability Problems with Qualitative Preferences},
  author = {E. Giunchiglia and M. Maratea},
  crossref = {vl65},
  pages = {327-344}
}

@article{gmydos05a,
  title = {A Framework for Sequential Planning in Multi-Agent Settings},
  author = {P. Gmytrasiewicz and P. Doshi},
  journal = jair,
  pages = {49-79},
  volume = {24},
  year = {2005}
}

@article{goedel32a,
  title = {Zum intuitionistischen {A}ussagenkalk{\"u}l},
  author = {K. G{\"o}del},
  journal = {Anzeiger der Akademie der Wissenschaften in Wien},
  pages = {65-66},
  year = {1932}
}

@article{gofestshsthosc14a,
  title = {Enhanced Partial Expansion {A*}},
  author = {M. Goldenberg and A. Felner and R. Stern and G. Sharon and N. Sturtevant and R. Holte and J. Schaeffer},
  journal = jair,
  pages = {141-187},
  volume = {50},
  year = {2014}
}

@article{gogrve02a,
  title = {Datalog {LITE}: A Deductive Query Language with Linear Time Model Checking},
  author = {G. Gottlob and E. Gr{\"a}del and H. Veith},
  doi = {10.1145/504077.504079},
  journal = tocl,
  number = {1},
  pages = {42-79},
  publisher = acm,
  volume = {3},
  year = {2002}
}

@inproceedings{goheba20a,
  title = {Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming},
  author = {R. G{\'o}mez and C. Hern{\'a}ndez and J. Baier},
  crossref = {aaai20},
  pages = {9867-9874}
}

@article{goheba21a,
  title = {A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding},
  author = {R. G{\'o}mez and C. Hern{\'a}ndez and J. Baier},
  journal = {{IEEE} Access},
  pages = {26886-26901},
  volume = {9},
  year = {2021}
}

@inproceedings{gohosase07a,
  title = {From Sampling to Model Counting},
  author = {C. Gomes and J. Hoffmann and A. Sabharwal and B. Selman},
  crossref = {ijcai07},
  pages = {2293-2299}
}

@inproceedings{gohosase07b,
  title = {Short {XOR}s for model counting: from theory to practice},
  author = {C. Gomes and J. Hoffmann and A. Sabharwal and B. Selman},
  crossref = {sat07},
  pages = {100-106}
}

@inproceedings{gokapase95a,
  title = {The Comparative Linguistics of Knowledge Representation},
  author = {G. Gogic and H. Kautz and C. Papadimitriou and B. Selman},
  crossref = {ijcai95},
  pages = {862-869}
}

@incollection{gokasase08a,
  title = {Satisfiability Solvers},
  author = {C. Gomes and H. Kautz and A. Sabharwal and B. Selman},
  chapter = {2},
  crossref = {KRHandbook},
  pages = {89-134}
}

@article{goldberg91a,
  title = {What every computer scientist should know about floating-point arithmetic},
  author = {D. Goldberg},
  journal = acmcs,
  number = {1},
  pages = {5-48},
  publisher = acm,
  volume = {23},
  year = {1991}
}

@book{goldblatt92a,
  title = {Logics of Time and Computation},
  author = {R. Goldblatt},
  number = {7},
  publisher = {Center for the Study of Language and Information},
  series = {{CSLI} Lecture Notes},
  year = {1992}
}

@inproceedings{golden98a,
  title = {Leap Before You Look: Information Gathering in the {PUCCINI} Planner},
  author = {K. Golden},
  crossref = {aips98},
  pages = {70-77}
}

@inproceedings{golemasc94,
  title = {{SETHEO V3.2:} {R}ecent {D}evelopments},
  author = {C. Goller and R. Letz and K. Mayr and J. Schumann},
  editor = {A. Bundy},
  booktitle = cade,
  note = {System abstract},
  pages = {778-782},
  publisher = springer,
  series = lnai,
  volume = {814},
  year = {1994}
}

@inproceedings{golnov02a,
  title = {{BerkMin}: A Fast and Robust {SAT} Solver},
  author = {E. Goldberg and Y. Novikov},
  booktitle = {Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATE'02)},
  pages = {142-149},
  publisher = ieee,
  year = {2002}
}

@article{golozs03a,
  title = {Issues in data stream management},
  author = {L. Golab and M. {\"o}zsu},
  journal = {ACM SIGMOD Record},
  number = {2},
  pages = {5-14},
  volume = {32},
  year = {2003}
}

@book{golozs10a,
  title = {Data Stream Management},
  author = {L. Golab and M. {\"o}zsu},
  publisher = {Morgan and Claypool Publishers},
  series = {Synthesis Lectures on Data Management},
  year = {2010}
}

@inproceedings{golpea90,
  title = {On the Relation Between Rational Closure and System-$Z^*$},
  author = {M. Goldszmith and J. Pearl},
  editor = {K. Konolige},
  booktitle = {Third International Workshop on Nonmonotonic Reasoning},
  pages = {130-140},
  year = {1990}
}

@book{golrob84,
  title = {Smalltalk-80. The language \& its implementation},
  author = {A. Goldberg and D. Robson},
  publisher = {Addison Wesley},
  year = {1984}
}

@article{golzil04a,
  title = {Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis},
  author = {C. Goldman and S. Zilberstein},
  journal = jair,
  pages = {143-174},
  volume = {22},
  year = {2004}
}

@article{gomsel01a,
  title = {Algorithm portfolios},
  author = {C. Gomes and B. Selman},
  journal = ai,
  number = {1-2},
  pages = {43-62},
  volume = {126},
  year = {2001}
}

@article{goprwa07a,
  title = {The Carneades model of argument and burden of proof},
  author = {T. Gordon and H. Prakken and D. Walton},
  journal = ai,
  number = {10-15},
  pages = {875-896},
  volume = {171},
  year = {2007}
}

@phdthesis{gordon93a,
  title = {The pleading game: An Artificial Intelligence Model of Procedural Justice},
  author = {T. Gordon},
  address = iki:adr,
  school = {Technische Hochschule Darmstadt},
  type = {Dissertation},
  year = {1993}
}

@inproceedings{gosase06a,
  title = {Model Counting: A New Strategy for Obtaining Good Bounds},
  author = {C. Gomes and A. Sabharwal and B. Selman},
  crossref = {aaai06}
}

@inproceedings{gosase06b,
  title = {Near-Uniform Sampling of Combinatorial Spaces Using {XOR} Constraints},
  author = {C. Gomes and A. Sabharwal and B. Selman},
  editor = {B. Sch{\"o}lkopf and J. Platt and T. Hoffman},
  booktitle = {Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems (NIPS'06)},
  pages = {481-488},
  publisher = {MIT Press},
  year = {2006}
}

@inproceedings{gosase07a,
  title = {Near-Uniform Sampling of Combinatorial Spaces Using {XOR} Constraints},
  author = {C. Gomes and A. Sabharwal and B. Selman},
  crossref = {nips06},
  pages = {481-488}
}

@incollection{gosase09a,
  title = {Model Counting},
  author = {C. Gomes and A. Sabharwal and B. Selman},
  chapter = {20},
  crossref = {SATHandbook},
  pages = {633-654}
}

@article{gosecrka00a,
  title = {Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems},
  author = {C. Gomes and B. Selman and N. Crato and H. Kautz},
  journal = jar,
  number = {1-2},
  pages = {67-100},
  volume = {24},
  year = {2000}
}

@inproceedings{goseka98a,
  title = {Boosting Combinatorial Search Through Randomization},
  author = {C. Gomes and B. Selman and H. Kautz},
  crossref = {aaai98},
  pages = {431-437}
}

@article{gotmin94a,
  title = {Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity},
  author = {G. Gottlob and Z. Mingyi},
  journal = ai,
  number = {1-2},
  pages = {329-345},
  volume = {69},
  year = {1994}
}

@article{gottlob92,
  title = {Complexity results for Nonmonotonic Logics},
  author = {G. Gottlob},
  journal = jlc,
  number = {3},
  pages = {397-425},
  volume = {2},
  year = {1992}
}

@article{graanb13a,
  title = {Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: {A} Theoretical and Empirical Study},
  author = {A. Grastien and Anbulagan},
  journal = {{IEEE} Transactions on Automatic Control},
  number = {12},
  pages = {3070-3083},
  volume = {58},
  year = {2013}
}

@article{grasca20a,
  title = {{CPCES}: {A} planning framework to solve conformant planning problems through a counterexample guided refinement},
  author = {A. Grastien and E. Scala},
  journal = ai,
  pages = {103271},
  volume = {284},
  year = {2020}
}

@article{grasub95a,
  title = {Reasoning in inconsistent knowledge bases},
  author = {J. Grant and V. Subrahmanian},
  journal = tkde,
  number = {1},
  pages = {177-189},
  volume = {7},
  year = {1995}
}

@inproceedings{green69a,
  title = {Application of Theorem Proving to Problem Solving},
  author = {C. Green},
  crossref = {ijcai69},
  pages = {219-240}
}

@book{grhoru95a,
  title = {Limits to Parallel Computation: P-Completeness Theory},
  editor = {R. Greenlaw and H. Hoover and W. Ruzzo},
  publisher = {Oxford University Press},
  year = {1995}
}

@article{gries04a,
  title = {Methods for evaluating and covering the design space during early design development},
  author = {M. Gries},
  journal = {Integration},
  number = {2},
  pages = {131-183},
  volume = {38},
  year = {2004}
}

@inproceedings{griilelirisc10a,
  title = {An {ASP}-Based System for Team-Building in the {G}ioia-{T}auro Seaport},
  author = {G. Grasso and S. Iiritano and N. Leone and V. Lio and F. Ricca and F. Scalise},
  crossref = {padl10},
  pages = {40-42}
}

@inproceedings{griileri09a,
  title = {Some {DLV} Applications for Knowledge Management},
  author = {G. Grasso and S. Iiritano and N. Leone and F. Ricca},
  crossref = {lpnmr09},
  pages = {591-597}
}

@inproceedings{grjamescthti05a,
  title = {Platypus: A platform for distributed answer set solving},
  author = {J. Gressmann and T. Janhunen and R. Mercer and T. Schaub and S. Thiele and R. Tichy},
  crossref = {lpnmr05},
  pages = {227-239}
}

@inproceedings{grjamescthti06a,
  title = {On Probing and Multi-Threading in Platypus},
  author = {J. Gressmann and T. Janhunen and R. Mercer and T. Schaub and S. Thiele and R. Tichy},
  crossref = {nmr06},
  note = {(Extended version of~\cite{grjamescthti06b}).},
  pages = {30-38}
}

@inproceedings{grjamescthti06b,
  title = {On Probing and Multi-Threading in Platypus},
  author = {J. Gressmann and T. Janhunen and R. Mercer and T. Schaub and S. Thiele and R. Tichy},
  crossref = {ecai06},
  pages = {392-396}
}

@inproceedings{grkosc05,
  title = {nomore$^<$: A System for Computing Preferred Answer Sets},
  author = {S. Grell and K. Konczak and T. Schaub},
  crossref = {lpnmr05},
  pages = {394-398}
}

@book{grluth99a,
  title = {Using MPI-2: Advanced Features of the Message-Passing Interface},
  author = {W. Gropp and E. Lusk and R. Thakur},
  publisher = {MIT Press},
  year = {1999}
}

@inproceedings{grmalyol07a,
  title = {Efficient Haplotype Inference with Pseudo-{B}oolean Optimization},
  author = {A. Gra{\c{c}}a and J. Marques-Silva and I. Lynce and A. Oliveira},
  crossref = {ab07},
  pages = {125-139}
}

@inproceedings{grmalyol08a,
  title = {Efficient Haplotype Inference with Combined {CP} and {OR} Techniques},
  author = {A. Gra{\c{c}}a and J. Marques-Silva and I. Lynce and A. Oliveira},
  crossref = {cpaior08},
  pages = {308-312}
}

@inproceedings{grmapi08a,
  title = {On Approaches to Explaining Infeasibility of Sets of {B}oolean Clauses},
  author = {{\'E}. Gr{\'e}goire and B. Mazure and C. Piette},
  crossref = {ictai08},
  pages = {74-83}
}

@inproceedings{groeto17a,
  title = {Harvey: A System for Random Testing in {ASP}},
  author = {A. Gre{\ss}ler and J. Oetsch and H. Tompits},
  crossref = {lpnmr17},
  pages = {229-235}
}

@inproceedings{grosof84,
  title = {Default Reasoning as Circumscription},
  author = {B. Grosof},
  crossref = {nmr84}
}

@inproceedings{grosof91,
  title = {Generalizing Prioritization},
  author = {B. Grosof},
  crossref = {kr91}
}

@inproceedings{grosof97,
  title = {Prioritized Conflict Handling for Logic Programs},
  author = {B. Grosof},
  editor = {J. Maluszynsk},
  booktitle = {Logic Programming: Proceedings of the 1997 International Symposium},
  pages = {197-211},
  publisher = {MIT Press},
  year = {1997}
}

@misc{grosof99a,
  title = {Business Rules for Electronic Commerce},
  author = {B. Grosof},
  howpublished = {IBM Research},
  url = {http://www.research.ibm.com/rules},
  year = {1999}
}

@article{grsaza01a,
  title = {Extending stratified datalog to capture complexity classes ranging from {P} to {QH}},
  author = {S. Greco and D. Sacc{\`{a}} and C. Zaniolo},
  journal = acta,
  number = {10},
  pages = {699-725},
  volume = {37},
  year = {2001}
}

@inproceedings{grscse06a,
  title = {Modelling biological networks by action languages via answer set programming},
  author = {S. Grell and T. Schaub and J. Selbig},
  crossref = {nmr06},
  pages = {275-283}
}

@inproceedings{grscse06b,
  title = {Modelling biological networks by action languages via answer set programming},
  author = {S. Grell and T. Schaub and J. Selbig},
  crossref = {iclp06},
  pages = {285-299}
}

@inproceedings{grscya04a,
  title = {Memory Efficient All-Solutions {SAT} Solver and Its Application for Reachability Analysis},
  author = {O. Grumberg and A. Schuster and A. Yadgar},
  crossref = {fmcad04},
  pages = {275-289}
}

@article{gspirest13a,
  title = {Maintaining consistency in a robot's knowledge-base via diagnostic reasoning},
  author = {S. Gspandl and I. Pill and M. Reip and G. Steinbauer},
  journal = aicom,
  number = {1},
  pages = {29-38},
  volume = {26},
  year = {2013}
}

@inproceedings{gucahe90b,
  title = {Contributions to a Proof Theory for Generic Defaults},
  author = {R. de {T. Guerreiro} and M. Casanova and A. Hermerly},
  booktitle = ecai,
  pages = {213-218},
  year = {1990}
}

@inproceedings{guecan95a,
  title = {Solving Crew Scheduling Problems by Constraint Programming},
  author = {N. Guerinik and M. {V}an Caneghem},
  crossref = {cp95},
  pages = {481-498}
}

@inproceedings{guecas90a,
  title = {An Alternative Semantics for Default Logic},
  author = {R. de {T. Guerreiro} and M. Casanova},
  crossref = {nmr90},
  pages = {141-157}
}

@inproceedings{guemil04a,
  title = {Learning Techniques for Automatic Algorithm Portfolio Selection},
  author = {A. Guerri and M. Milano},
  crossref = {ecai04},
  pages = {475-479}
}

@article{gufoanaf03a,
  title = {On temporal logic versus datalog},
  author = {I. Guessarian and E. Foustoucos and T. Andronikos and F. Afrati},
  doi = {10.1016/S0304-3975(02)00447-4},
  journal = tcs,
  number = {1},
  pages = {103-133},
  volume = {303},
  year = {2003}
}

@inproceedings{guhmcg06a,
  title = {Approximate quantiles and the order of the stream},
  author = {S. Guha and A. McGregor},
  crossref = {pods06},
  pages = {273-279}
}

@inproceedings{gukopa01a,
  title = {Multiagent Planning with Factored MDPs},
  author = {C. Guestrin and D. Koller and R. Parr},
  editor = {T. Dietterich and S. Becker and Z. Ghahramani},
  booktitle = {Proceedings of the Fourteenth Annual Conference on Neural Information Processing Systems (NIPS'01)},
  pages = {1523-1530},
  publisher = {MIT Press},
  year = {2001}
}

@inproceedings{guloosscsi15a,
  title = {Boolean Network Identification from Multiplex Time Series Data},
  author = {C. Guziolowski and L. Paulev{\'e} and M. Ostrowski and T. Schaub and A. Siegel},
  crossref = {cmsb15},
  pages = {170-181}
}

@inproceedings{gumoqusc16a,
  title = {Fouille de motifs s{\'e}quentiels avec {ASP}},
  author = {T. Guyet and Y. Moinard and R. Quiniou and T. Schaub},
  editor = {C. de Runz and B. Cr{\'e}milleux},
  booktitle = {Seizi{\`e}me Journ{\'e}es Francophones Extraction et Gestion des Connaissances (EGC'16)},
  pages = {39-50},
  publisher = {Hermann {\'E}ditions},
  series = {{RNTI}},
  volume = {{E-30}},
  year = {2016}
}

@incollection{gumoqusc17a,
  title = {Efficiency Analysis of {ASP} Encodings for Sequential Pattern Mining Tasks},
  author = {T. Guyet and Y. Moinard and R. Quiniou and T. Schaub},
  editor = {B. Pinaud and F. Guillet and B. Cremilleux and C. de Runz},
  booktitle = {Advances in Knowledge Discovery and Management},
  publisher = springer,
  series = {Studies in Computational Intelligence},
  volume = {732},
  year = {2018}
}

@article{gunide11a,
  title = {Itemset mining: {A} constraint programming perspective},
  author = {T. Guns and S. Nijssen and L. {D}e Raedt},
  journal = ai,
  number = {12-13},
  pages = {1951-1983},
  volume = {175},
  year = {2011}
}

@inproceedings{guohsu04a,
  title = {A Learning-Based algorithm selection meta-reasoner for the real-Time {MPE} problem},
  author = {H. Guo and W. Hsu},
  booktitle = {Proceedings of the Seventeenth Australian Joint Conference on Artificial Intelligence},
  pages = {307-318},
  publisher = springer,
  year = {2004}
}

@article{gupnau92a,
  title = {On the Complexity of Blocks-World Planning},
  author = {N. Gupta and D. Nau},
  journal = ai,
  number = {2-3},
  pages = {223-254},
  volume = {56},
  year = {1992}
}

@article{gupoalcahe01a,
  title = {Parallel execution of {P}rolog programs: a survey.},
  author = {G. Gupta and E. Pontelli and K. Ali and M. Carlsson and M. Hermenegildo},
  journal = toplas,
  number = {4},
  pages = {472-602},
  volume = {23},
  year = {2001}
}

@article{guviedthcosisr13a,
  title = {Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming},
  author = {C. Guziolowski and S. Videla and F. Eduati and S. Thiele and T. Cokelaer and A. Siegel and J. Saez-Rodriguez},
  doi = {10.1093/bioinformatics/btt393},
  journal = {Bioinformatics},
  number = {18},
  pages = {2320-2326},
  volume = {29},
  year = {2013}
}

@inproceedings{guyqui11a,
  title = {Extracting Temporal Patterns from Interval-Based Sequences},
  author = {T. Guyet and R. Quiniou},
  crossref = {ijcai11},
  pages = {1306-1311}
}

@article{habawi06a,
  title = {The CQL continuous query language: semantic foundations and query execution},
  author = {A. Arasu and S. Babu and J. Widom},
  journal = {Journal on Very Large Data Bases},
  number = {2},
  pages = {121-142},
  volume = {15},
  year = {2006}
}

@inproceedings{habula98a,
  title = {{GOLEX} - Bridging the Gap between Logic ({GOLOG}) and a Real Robot},
  author = {D. H{\"a}hnel and W. Burgard and G. Lakemeyer},
  crossref = {ki98},
  pages = {165-176}
}

@inproceedings{hacamepo16a,
  title = {Resource Allocation with Dependencies in Business Process Management Systems},
  author = {G. Havur and C. Cabanillas and J. Mendling and A. Polleres},
  crossref = {bpm16},
  pages = {3-19}
}

@article{hachebka08a,
  title = {An environmental perspective on metabolism},
  author = {T. Handorf and O. Ebenh{\"o}h and R. Heinrich},
  journal = {Journal of Theoretical Biology},
  number = {3},
  pages = {498-512},
  volume = {252},
  year = {2008}
}

@inproceedings{hacjue04a,
  title = {Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm},
  author = {S. Hachul and M. J{\"u}nger},
  crossref = {gd04},
  pages = {285-295}
}

@article{haebhe05a,
  title = {Expanding Metabolic Networks: Scopes of Compounds, Robustness, and Evolution},
  author = {T. Handorf and O. Ebenh{\"o}h and R. Heinrich},
  journal = {Journal of Molecular Evolution},
  number = {4},
  pages = {498-512},
  volume = {61},
  year = {2005}
}

@techreport{haehnle90,
  title = {Spezifikation eines Theorembeweisers f{\"u}r dreiwertige First-Order Logik},
  author = {R. H{\"a}hnle},
  address = {Universit{\"a}t Karlsruhe, Institut f{\"u}r Logik, Komplexit{\"a}t und Deduktionssysteme, Postfach 6980, D-7500 Karlsruhe},
  institution = {Universit{\"a}t Karlsruhe},
  year = {1990}
}

@incollection{hahnle01a,
  title = {Tableaux and Related Methods.},
  author = {R. H{\"a}hnle},
  crossref = {ARHandbook},
  pages = {100-178}
}

@inproceedings{haivel97a,
  title = {High-level planning and low-level execution: Towards a complete robotic agent},
  author = {K. Haigh and M. Veloso},
  booktitle = {Proceedings of the First International Conference on Autonomous Agents},
  pages = {363-370},
  publisher = acm,
  year = {1997}
}

@inproceedings{haiwal08a,
  title = {Online Estimation of {SAT} Solving Runtime},
  author = {S. Haim and T. Walsh},
  crossref = {sat08},
  pages = {133-138}
}

@article{hajakani06a,
  title = {Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques},
  author = {H. Haanp{\"a}{\"a} and M. J{\"a}rvisalo and P. Kaski and I. Niemel{\"a}},
  journal = jsat,
  number = {1-4},
  pages = {27-46},
  volume = {2},
  year = {2006}
}

@inproceedings{hajakarorusc22a,
  title = {Plingo: {A} System for Probabilistic Reasoning in Clingo Based on {LP}$^{\mathit{MLN}}$},
  author = {S. Hahn and T. Janhunen and R. Kaminski and J. Romero and N. R{\"u}hling and T. Schaub},
  crossref = {ruleml22},
  doi = {10.1007/978-3-031-21541-4_4},
  pages = {54-62}
}

@inproceedings{hajasa09a,
  title = {Learning for Dynamic Subsumption},
  author = {Y. Hamadi and S. Jabbour and L. Sais},
  crossref = {ictai09}
}

@inproceedings{hajasa09b,
  title = {Control-Based Clause Sharing in Parallel {SAT} Solving},
  author = {Y. Hamadi and S. Jabbour and L. Sais},
  crossref = {ijcai09},
  pages = {499-504}
}

@article{hajasa09c,
  title = {Many{SAT}: a Parallel {SAT} Solver},
  author = {Y. Hamadi and S. Jabbour and L. Sais},
  journal = jsat,
  pages = {245-262},
  volume = {6},
  year = {2009}
}

@article{haken85a,
  title = {The Intractability of Resolution},
  author = {A. Haken},
  journal = tcs,
  pages = {297-308},
  volume = {39},
  year = {1985}
}

@incollection{hakoti01a,
  title = {Dynamic logic},
  author = {D. Harel and D. Kozen and J. Tiuryn},
  crossref = {PHandbook},
  pages = {99-107},
  volume = {4}
}

@article{halipeva17a,
  title = {Infinitary Equilibrium Logic and Strongly Equivalent Logic Programs},
  author = {A. Harrison and V. Lifschitz and D. Pearce and A. Valverde},
  journal = ai,
  pages = {22-33},
  volume = {246},
  year = {2017}
}

@article{halira17a,
  title = {Program completion in the input language of {GRINGO}},
  author = {A. Harrison and V. Lifschitz and D. Raju},
  journal = tplp,
  number = {5-6},
  pages = {855-871},
  volume = {17},
  year = {2017}
}

@inproceedings{haliya14a,
  title = {The Semantics of Gringo and Infinitary Propositional Formulas},
  author = {A. Harrison and V. Lifschitz and F. Yang},
  crossref = {kr14},
  url = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7966}
}

@inproceedings{halmos85,
  title = {A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft},
  author = {J. Halpern and Y. Moses},
  booktitle = ijcai,
  pages = {480-490},
  year = {1985}
}

@article{halsho96a,
  title = {A Propositional Modal Logic of Time Intervals},
  author = {J. Halpern and Y. Shoham},
  journal = jacm,
  pages = {279-292},
  volume = {38},
  year = {1996}
}

@inproceedings{hamaneotroscsc23a,
  title = {Reasoning about Study Regulations in Answer Set Programming (Preliminary Report)},
  author = {S. Hahn and C. Martens and A. Nemes and H. Otunuya and J. Romero and T. Schaub and S. Schellhorn},
  crossref = {iclp-ws23},
  url = {https://ceur-ws.org/Vol-3437/paper5ASPOCP.pdf}
}

@article{hamunescwa23a,
  title = {Evolutionary System Design with Answer Set Programming},
  author = {C. Haubelt and L. M{\"u}ller and K. Neubauer and T. Schaub and P. Wanko},
  article-number = {179},
  doi = {10.3390/a16040179},
  issn = {1999-4893},
  journal = {Algorithms},
  number = {4},
  url = {https://www.mdpi.com/1999-4893/16/4/179},
  volume = {16},
  year = {2023}
}

@article{hanescwa18a,
  title = {Design Space Exploration with Answer Set Programming},
  author = {C. Haubelt and K. Neubauer and T. Schaub and P. Wanko},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {205-206},
  volume = {32},
  year = {2018}
}

@techreport{hanf89,
  title = {Spezifikation eines {THEORIST}-Konnektionsbeweisers},
  author = {N. Hanf},
  address = iki:adr,
  institution = iki:long,
  year = {1989}
}

@inproceedings{hanjia12a,
  title = {When boolean satisfiability meets gaussian elimination in a simplex way},
  author = {C. Han and J. Jiang},
  crossref = {cav12},
  pages = {410-426}
}

@inproceedings{hanlir22a,
  title = {Semantics for Conditional Literals via the {SM} Operator},
  author = {Z. Hansen and Y. Lierler},
  editor = {G. Gottlob and D. Inclezan and M. Maratea},
  crossref = {lpnmr22},
  pages = {259-272}
}

@article{hanmcd87a,
  title = {Nonmonotonic logic and temporal projection},
  author = {S. Hanks and D. McDermott},
  journal = ai,
  number = {3},
  pages = {379-412},
  volume = {33},
  year = {1987}
}

@inproceedings{hansom07a,
  title = {Alembic: An Efficient Algorithm for {CNF} Preprocessing},
  author = {H. Han and F. Somenzi},
  crossref = {dac07},
  pages = {582-587}
}

@inproceedings{hansom09a,
  title = {On-the-Fly Clause Improvement},
  author = {H. Han and F. Somenzi},
  crossref = {sat09},
  pages = {209-222}
}

@book{hansson99a,
  title = {A Textbook of Belief Dynamics},
  author = {S. {O}ve Hansson},
  publisher = kluwer,
  series = {Applied Logic Series},
  year = {1999}
}

@article{hanzil01a,
  title = {LAO*: {A} heuristic search algorithm that finds solutions with loops},
  author = {E. Hansen and S. Zilberstein},
  journal = ai,
  number = {1-2},
  pages = {35-62},
  volume = {129},
  year = {2001}
}

@article{harlif16a,
  title = {Stable models for infinitary formulas with extensional atoms},
  author = {A. Harrison and V. Lifschitz},
  journal = tplp,
  number = {5-6},
  pages = {771-786},
  publisher = cup,
  volume = {16},
  year = {2016}
}

@inproceedings{harlif18a,
  title = {Relating Two Dialects of Answer Set Programming},
  author = {A. Harrison and V. Lifschitz},
  crossref = {nmr18},
  pages = {99-108}
}

@article{harlif19a,
  title = {Relating Two Dialects of Answer Set Programming},
  author = {A. Harrison and V. Lifschitz},
  journal = tplp,
  number = {5-6},
  pages = {1006-1020},
  volume = {19},
  year = {2019}
}

@inproceedings{hasascst22a,
  title = {clingraph: {ASP}-based Visualization},
  author = {S. Hahn and O. Sabuncu and T. Schaub and T. Stolzmann},
  crossref = {lpnmr22},
  doi = {10.1007/978-3-031-15707-3\_31},
  pages = {401-414}
}

@article{hasascst24a,
  title = {Clingraph: A System for {ASP}-based Visualization},
  author = {S. Hahn and O. Sabuncu and T. Schaub and T. Stolzmann},
  doi = {10.1017/S147106842400005X},
  journal = tplp,
  optannote = {},
  optkey = {},
  optmonth = {},
  optnote = {To appear},
  optnumber = {},
  optpages = {},
  optvolume = {},
  year = {2024}
}

@inproceedings{hasc15a,
  title = {A Heuristic, Replay-Based Approach for Reconfiguration},
  author = {A. Haselb{\"o}ck and G. Schenner},
  crossref = {conf15},
  pages = {73-80}
}

@article{hascmaneotrosc24a,
  title = {Reasoning About Study Regulations in Answer Set Programming},
  author = {S. Hahn and T. Schaub and C. Martens and A. Nemes and H. Otunuya and J. Romero and S. Schellhorn},
  doi = {10.1017/S1471068424000383},
  journal = tplp,
  number = {4},
  pages = {790-804},
  volume = {24},
  year = {2024}
}

@article{hascth12a,
  title = {Automated Verification of State Sequence Invariants in General Game Playing},
  author = {S. Haufe and S. Schiffel and M. Thielscher},
  journal = ai,
  pages = {1-30},
  volume = {187-188},
  year = {2012}
}

@inproceedings{hasjon99a,
  title = {Some Results on the Complexity of Planning with Incomplete Information},
  author = {P. Haslum and P. Jonsson},
  crossref = {ecp99},
  pages = {308-318}
}

@book{hatiko00a,
  title = {Dynamic Logic},
  author = {D. Harel and J. Tiuryn and D. Kozen},
  doi = {10.1145/568438.568456},
  publisher = {MIT Press},
  year = {2000}
}

@incollection{hayes73,
  title = {The Frame Problem and Related Problems in Artificial Intelligence},
  author = {P. Hayes},
  editor = {A. Elithorn and D. Jones},
  address = {San Francisco},
  booktitle = {Artificial and Human Thinking},
  pages = {45-49},
  publisher = {Jossey-Bass},
  year = {1973}
}

@inproceedings{hebasasc22a,
  title = {Conflict Handling in Product Configuration using Answer Set Programming},
  author = {K. Herud and J. Baumeister and O. Sabuncu and T. Schaub},
  crossref = {aspocp22},
  url = {https://ceur-ws.org/Vol-3193/paper2ASPOCP.pdf}
}

@article{hedajade17a,
  title = {The {KB} paradigm and its application to interactive configuration},
  author = {P. Hertum and I. Dasseville and G. Janssens and M. Denecker},
  doi = {10.1007/978-3-319-28228-2\_2},
  journal = tplp,
  number = {1},
  pages = {91-117},
  volume = {17},
  year = {2017}
}

@inproceedings{hehnocwa05a,
  title = {Finding Diverse and Similar Solutions in Constraint Programming},
  author = {E. Hebrard and B. Hnich and B. {O}'\relax Sullivan and T. Walsh},
  crossref = {aaai05},
  pages = {372-377},
  year = {2005}
}

@misc{heinpo89,
  title = {Extracting Answers in Circumscription},
  author = {N. Helft and K. Inoue and D. Poole},
  howpublished = {ICOT Research Center, 1-4-28 Mita, Minato-ku, Tokyo 108, Japan; University of British Columbia, Vancouver, B.C., Canada V6T 1W5},
  note = {ICOT Technical Memorandum No. 855},
  origin = {wb_5/90},
  year = {1989}
}

@inproceedings{hejejoklparasa95a,
  title = {Mona: Monadic Second-Order Logic in Practice},
  author = {J. Henriksen and J. Jensen and M. J{\o}rgensen and N. Klarlund and R. Paige and T. Rauhe and A. Sandholm},
  crossref = {tacas95},
  doi = {10.1007/3-540-60630-0\_5},
  pages = {89-110}
}

@inproceedings{helaol07a,
  title = {Mini{M}ax{S}at: A New Weighted Max-{SAT} Solver},
  author = {F. Heras and J. Larrosa and A. Oliveras},
  crossref = {sat07},
  pages = {41-55}
}

@article{helaol08a,
  title = {Mini{M}ax{SAT}: An Efficient Weighted {M}ax-{SAT} Solver},
  author = {F. Heras and J. Larrosa and A. Oliveras},
  journal = jair,
  pages = {1-32},
  volume = {31},
  year = {2008}
}

@inproceedings{heldom09a,
  title = {Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?},
  author = {M. Helmert and C. Domshlak},
  crossref = {icaps09}
}

@inproceedings{helgef08a,
  title = {Unifying the Causal Graph and Additive Heuristics},
  author = {M. Helmert and H. Geffner},
  crossref = {icaps08},
  pages = {140-147}
}

@inproceedings{helmat08a,
  title = {Accuracy of Admissible Heuristic Functions in Selected Planning Domains},
  author = {M. Helmert and R. Mattm{\"u}ller},
  crossref = {aaai08},
  pages = {938-943}
}

@article{helmert06a,
  title = {The Fast Downward Planning System},
  author = {M. Helmert},
  journal = jair,
  pages = {191-246},
  volume = {26},
  year = {2006}
}

@article{helmert09a,
  title = {Concise Finite-Domain Representations for {PDDL} Planning Tasks},
  author = {M. Helmert},
  journal = ai,
  number = {5-6},
  pages = {503-535},
  volume = {173},
  year = {2009}
}

@inproceedings{helmertrs+11,
  title = {Fast Downward Stone Soup},
  author = {M. Helmert and G. R{\"o}ger and J. Seipp and E. Karpas and J. Hoffmann and E. Keyder and R. Nissim and S. Richter and M. Westphal},
  booktitle = {{IPC'11}},
  pages = {38-45},
  url = {http://www.plg.inf.uc3m.es/ipc2011-deterministic/Results?action=AttachFile&do=get&target=ipc2011-booklet.pdf},
  year = {2011}
}

@article{helnie03a,
  title = {Bounded {LTL} Model Checking with Stable Models},
  author = {K. Heljanko and I. Niemel{\"a}},
  journal = tplp,
  number = {4-5},
  pages = {519-550},
  volume = {3},
  year = {2003}
}

@inproceedings{hensch09a,
  title = {A Transport Reaction Language: Preliminary Report},
  author = {T. Henin and T. Schaub},
  editor = {A. Herzig and B. Johnston},
  booktitle = {Proceedings of the Eighth Workshop on Nonmonotonic Reasoning, Action and Change (NRAC'09)},
  pages = {41-46},
  publisher = {ePress, University of Technology, Sydney, Australia},
  year = {2009}
}

@phdthesis{hentenryck87,
  title = {Consistency Techniques in Logic Programming},
  author = {P. {V}an Hentenryck},
  school = {University Namur, Belgium},
  year = {1987}
}

@article{henthi99a,
  title = {Dynamic Linear Time Temporal Logic},
  author = {J. Henriksen and P. Thiagarajan},
  journal = {Annals of Pure and Applied Logic},
  number = {1-3},
  pages = {187-207},
  volume = {96},
  year = {1999}
}

@inproceedings{henzinger98a,
  title = {It's About Time: Real-Time Logics Reviewed},
  author = {T. Henzinger},
  editor = {D. Sangiorgi and R. de Simone},
  booktitle = {Proceedings of the Ninth International Conference on Concurrency Theory (CONCUR'98)},
  doi = {10.1007/BFb0055640},
  pages = {439-454},
  publisher = springer,
  series = lncs,
  volume = {1466},
  year = {1998}
}

@inproceedings{herbau22a,
  title = {Testing Product Configuration Knowledge Bases Declaratively},
  author = {K. Herud and J. Baumeister},
  crossref = {lwda22},
  pages = {173-186},
  url = {https://ceur-ws.org/Vol-3341/WM-LWDA_2022_CRC_4316.pdf}
}

@article{herlihy93a,
  title = {A Methodology for Implementing Highly Concurrent Objects},
  author = {M. Herlihy},
  journal = toplas,
  number = {5},
  pages = {745-770},
  volume = {15},
  year = {1993}
}

@book{hersha08a,
  title = {The Art of Multiprocessor Programming},
  author = {M. Herlihy and N. Shavit},
  publisher = m-k,
  year = {2008}
}

@book{hertzberg89a,
  title = {Planen. Einf{\"u}hrung in die Planerstellungsmethoden der K{\"u}stlichen Intelligenz},
  author = {J. Hertzberg},
  publisher = bi,
  series = {Reihe Informatik},
  volume = {65},
  year = {1989}
}

@article{hetadr90a,
  title = {{AI} Planning: Systems and Techniques},
  author = {J. Hendler and A. Tate and M. Drummond},
  journal = aim,
  number = {2},
  pages = {61-77},
  volume = {11},
  year = {1990}
}

@incollection{heumaa09a,
  title = {Look-Ahead Based {SAT} Solvers},
  author = {M. Heule and H. van Maaren},
  chapter = {5},
  crossref = {SATHandbook},
  pages = {155-184}
}

@inproceedings{heusch15a,
  title = {What's Hot in the {SAT} and {ASP} Competitions?},
  author = {M. Heule and T. Schaub},
  crossref = {aaai15},
  pages = {4322-4323}
}

@inproceedings{hewitt69,
  title = {{PLANNER}: A Language for Proving Theorems in Robots},
  author = {C. Hewitt},
  editor = {D. Walker},
  booktitle = ijcai,
  pages = {295-301},
  publisher = m-k,
  year = {1969}
}

@inproceedings{hewitt71,
  title = {Procedural Embedding of Knowledge in {PLANNER}},
  author = {C. Hewitt},
  booktitle = ijcai,
  pages = {167-182},
  year = {1971}
}

@phdthesis{hewitt72,
  title = {Description and theoretical analysis (using schemata) of {PLANNER}: A language for proving theorems and manipulating models in a robot},
  author = {C. Hewitt},
  note = {AI Lab Report AI-TR-258},
  school = {MIT, Department of Mathematics},
  year = {1972}
}

@incollection{heyting30a,
  title = {Die formalen {R}egeln der intuitionistischen {L}ogik},
  author = {A. Heyting},
  booktitle = {Sitzungsberichte der Preussischen Akademie der Wissenschaften},
  pages = {42-56},
  publisher = {Deutsche Akademie der Wissenschaften zu Berlin},
  year = {1930}
}

@article{himani00a,
  title = {{DES}: a Challenge Problem for Nonmonotonic Reasoning Systems},
  author = {M. Hietalahti and F. Massacci and I. Niemel{\"a}},
  journal = {CoRR},
  volume = {cs.AI/0003039},
  year = {2000}
}

@book{hintikka62,
  title = {Knowledge and Belief: An Introduction to the Logic of the Two Notions},
  author = {J. Hintikka},
  address = {Ithaca, NY},
  publisher = {Cornell University Press},
  year = {1962}
}

@article{hintikka88,
  title = {Model Minimization --- An Alternative to Circumscription},
  author = {J. Hintikka},
  journal = jar,
  pages = {1-13},
  volume = {4},
  year = {1988}
}

@techreport{hirsimaki01a,
  title = {Distributing backtracking search trees},
  author = {T. Hirsim{\"a}ki},
  institution = {Helsinki University of Technology},
  pages = {14},
  year = {2001}
}

@incollection{hodges93a,
  title = {Logical Features of {H}orn Clauses},
  author = {W. Hodges},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  booktitle = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  pages = {449-503},
  publisher = {Oxford University Press},
  volume = {1},
  year = {1993}
}

@article{hoesch90,
  title = {A New Deductive Approach to Planning},
  author = {S. H{\"o}lldobler and J. Schneeberger},
  journal = ngc,
  number = {3},
  pages = {225-244},
  volume = {8},
  year = {1990}
}

@inproceedings{hoewit00a,
  title = {Classical and General Frameworks for Recovery},
  author = {W. van der Hoek and C. Witteveen},
  editor = {W. Horn},
  address = {Amsterdam},
  booktitle = ecai,
  pages = {33-37},
  publisher = ios,
  year = {2000}
}

@inproceedings{hoewoo02a,
  title = {Tractable multiagent planning for epistemic goals},
  author = {W. van der Hoek and M. Wooldridge},
  crossref = {aamas02},
  pages = {1167-1174}
}

@article{hofbra06a,
  title = {Conformant planning via heuristic forward search: {A} new approach},
  author = {J. Hoffmann and R. Brafman},
  journal = ai,
  number = {6-7},
  pages = {507-541},
  volume = {170},
  year = {2006}
}

@incollection{hofestrybawo14a,
  title = {Configuration Knowledge Representation and Reasoning},
  author = {L. Hotz and A. Felfernig and M. Stumptner and A. Ryabokon and C. Bagley and K. Wolter},
  chapter = {6},
  crossref = {kbc14},
  doi = {10.1016/b978-0-12-415817-7.00006-2},
  pages = {41-72}
}

@article{hoffmann05a,
  title = {Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks},
  author = {J. Hoffmann},
  journal = jair,
  pages = {685-758},
  volume = {24},
  year = {2005}
}

@inproceedings{hoflak18a,
  title = {A Logic for Specifying Metric Temporal Constraints for Golog Programs},
  author = {T. Hofmann and G. Lakemeyer},
  crossref = {cogrob18},
  pages = {36-46}
}

@article{hofneb01a,
  title = {The {FF} Planning System: Fast Plan Generation Through Heuristic Search},
  author = {J. Hoffmann and B. Nebel},
  journal = jair,
  pages = {253-302},
  volume = {14},
  year = {2001}
}

@article{hokalisc14a,
  title = {aspeed: Solver Scheduling via Answer Set Programming},
  author = {H. Hoos and R. Kaminski and M. Lindauer and T. Schaub},
  journal = tplp,
  number = {1},
  pages = {117-142},
  volume = {15},
  year = {2015}
}

@inproceedings{hokascsc12a,
  title = {aspeed: {ASP}-based Solver Scheduling},
  author = {H. Hoos and R. Kaminski and T. Schaub and M. Schneider},
  crossref = {iclp-lipics12},
  pages = {176-187}
}

@inproceedings{hokascsc13a,
  title = {Robust Benchmark Set Selection for Boolean Constraint Solvers},
  author = {H. Hoos and B. Kaufmann and T. Schaub and M. Schneider},
  crossref = {lion13},
  pages = {138-152}
}

@inproceedings{hokucomaxuayko16a,
  title = {Multi-Agent Path Finding with Kinematic Constraints},
  author = {W. H{\"o}nig and T. Kumar and L. Cohen and H. Ma and H. Xu and N. Ayanian and S. Koenig},
  crossref = {icaps16},
  pages = {477-485}
}

@inproceedings{holescsc12a,
  title = {Algorithm Configuration for Portfolio-based Parallel {SAT}-Solving},
  author = {H. Hoos and K. Leyton-Brown and T. Schaub and M. Schneider},
  crossref = {cocomile12},
  pages = {7-12}
}

@article{holisc14a,
  title = {claspfolio 2: Advances in Algorithm Selection for Answer Set Programming},
  author = {H. Hoos and M. Lindauer and T. Schaub},
  journal = tplp,
  number = {4-5},
  pages = {569-585},
  volume = {14},
  year = {2014}
}

@article{holthaus97a,
  title = {Efficient Dispatching Rules for Scheduling in a Job Shop},
  author = {O. Holthaus},
  journal = {International Journal of Production Economics},
  number = {1},
  pages = {87-105},
  volume = {48},
  year = {1997}
}

@inproceedings{homast12a,
  title = {A Compact Encoding of Pseudo-{B}oolean Constraints into {SAT}},
  author = {S. H{\"o}lldobler and N. Manthey and P. Steinke},
  crossref = {ki12},
  pages = {107-118}
}

@inproceedings{honiclla16a,
  title = {Continual Planning in Golog},
  author = {T. Hofmann and T. Niemueller and J. Cla{\ss}en and G. Lakemeyer},
  crossref = {aaai16},
  pages = {3346-3353}
}

@article{hoos12a,
  title = {Programming by Optimisation},
  author = {H. Hoos},
  journal = cacm,
  pages = {70-80},
  volume = {55},
  year = {2012}
}

@inproceedings{hoosch11a,
  title = {Quantifying Homogeneity of Instance Sets for Algorithm Configuration},
  author = {M. Schneider and H. Hoos},
  crossref = {lion12},
  pages = {190-204}
}

@book{hoostu04a,
  title = {Stochastic Local Search: Foundations and Applications},
  author = {H. Hoos and T. St{\"u}tzle},
  publisher = {Elsevier/Morgan Kaufmann},
  year = {2004}
}

@article{hoowo19a,
  title = {On the Expressiveness and Monitoring of Metric Temporal Logic},
  author = {H. Ho and J. Ouaknine and J. Worrell},
  doi = {10.23638/LMCS-15(2:13)2019},
  journal = {Logical Methods in Computer Science},
  number = {2},
  volume = {15},
  year = {2019}
}

@article{hopose04a,
  title = {Ordered Landmarks in Planning},
  author = {J. Hoffmann and J. Porteous and L. Sebastia},
  journal = jair,
  pages = {215-278},
  volume = {22},
  year = {2004}
}

@book{hoppe95a,
  title = {Incremental Partial Deduction},
  author = {T. Hoppe},
  publisher = {Infix},
  series = {Dissertationen zur K{\"u}nstlichen Intelligenz},
  volume = {Diski 97},
  year = {1995}
}

@book{hopull79a,
  title = {Introduction to Automata Theory, Languages, and Computation},
  author = {J. Hopcroft and J Ullman},
  publisher = addison,
  year = {1979}
}

@inproceedings{horty94a,
  title = {Some Direct Theories of Nonmonotonic Inheritance},
  author = {J. Horty},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  booktitle = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  pages = {111-187},
  year = {1994}
}

@article{hosoi66a,
  title = {The Axiomatization of the Intermediate Propositional Systems $S_2$ of {G}{\"o}del},
  author = {T. Hosoi},
  journal = {Journal of the Faculty of Science of the University of Tokyo},
  number = {2},
  pages = {183-187},
  volume = {13},
  year = {1966}
}

@techreport{hothto87,
  title = {A Skeptical Theory of Inheritance in Nonmonotonic Semantic Nets},
  author = {J. Horty and R. Thomason and D. Touretzky},
  institution = {Carnegie-Mellon University},
  number = {CMU-CS-87-175},
  year = {1987}
}

@article{hothto90,
  title = {A skeptical theory of inheritance in nonmonotonic semantic networks},
  author = {J. Horty and R. Thomason and D. Touretzky},
  journal = ai,
  pages = {311-348},
  volume = {42},
  year = {1990}
}

@inproceedings{hrycej88a,
  title = {Temporal {P}rolog},
  author = {T. Hrycej},
  crossref = {ecai88},
  pages = {296-301}
}

@article{hrycej93a,
  title = {A Temporal Extension of {P}rolog},
  author = {T. Hrycej},
  journal = jlp,
  number = {1-2},
  pages = {113-145},
  volume = {15},
  year = {1993}
}

@inproceedings{hswahuch07a,
  title = {Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences},
  author = {C. Hsu and B. Wah and R. Huang and Y. Chen},
  crossref = {ijcai07},
  pages = {1924-1929}
}

@inproceedings{huang07a,
  title = {The Effect of Restarts on the Efficiency of Clause Learning},
  author = {J. Huang},
  crossref = {ijcai07},
  pages = {2318-2323}
}

@inproceedings{huang07b,
  title = {A Case for Simple {SAT} Solvers},
  author = {J. Huang},
  crossref = {cp07},
  pages = {839-846}
}

@inproceedings{huang08a,
  title = {Universal {B}ooleanization of Constraint Models},
  author = {J. Huang},
  crossref = {cp08},
  pages = {144-158}
}

@article{huang10a,
  title = {Extended Clause Learning},
  author = {J. Huang},
  journal = ai,
  number = {15},
  pages = {1277-1284},
  volume = {174},
  year = {2010}
}

@inproceedings{hubahohu07a,
  title = {Boosting Verification by Automatic Tuning of Decision Procedures},
  author = {F. Hutter and D. Babi{\'c} and H. Hoos and A. Hu},
  booktitle = {Proceedings of the Seventh Conference on Formal Methods in Computer-Aided Design (FMCAD'07)},
  pages = {27-34},
  publisher = ieee,
  year = {2007}
}

@inproceedings{huchzh10a,
  title = {A Novel Transition Based Encoding Scheme for Planning as Satisfiability},
  author = {R. Huang and Y. Chen and W. Zhang},
  crossref = {aaai10},
  pages = {89-94}
}

@inproceedings{hufawali17a,
  title = {A General Multi-agent Epistemic Planner Based on Higher-order Belief Change},
  author = {X. Huang and B. Fang and H. Wan and Y. Liu},
  crossref = {ijcai17},
  pages = {1093-1101}
}

@book{hugcre68,
  title = {An Introduction to Modal Logic},
  author = {G. Hughes and M. Creswell},
  publisher = {Methuen},
  year = {1968}
}

@inproceedings{huhahole06b,
  title = {Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms},
  author = {F. Hutter and Y. Hamadi and H. Hoos and K. Leyton-Brown},
  crossref = {cp06},
  pages = {213-228}
}

@inproceedings{huhole10a,
  title = {Automated Configuration of Mixed Integer Programming Solvers},
  author = {F. Hutter and H. Hoos and K. Leyton-Brown},
  crossref = {cpaior10},
  pages = {186-202}
}

@article{huhole11a,
  title = {Tradeoffs in the Empirical Evaluation of Competing Algorithm Designs},
  author = {F. Hutter and H. Hoos and K. Leyton-Brown},
  journal = amai,
  number = {1},
  pages = {65-89},
  volume = {60},
  year = {2011}
}

@inproceedings{huhole11b,
  title = {Sequential Model-Based Optimization for General Algorithm Configuration},
  author = {F. Hutter and H. Hoos and K. Leyton-Brown},
  crossref = {lion11},
  pages = {507-523}
}

@inproceedings{huholemu09a,
  title = {An Experimental Investigation of Model-Based Parameter Optimisation: {SPO} and Beyond},
  author = {F. Hutter and H. Hoos and K. Leyton-Brown and K. Murphy},
  crossref = {gecco09},
  pages = {271-278}
}

@inproceedings{huholemu10a,
  title = {Time-Bounded Sequential Parameter Optimization},
  author = {F. Hutter and H. Hoos and K. Leyton-Brown and K. Murphy},
  crossref = {lion10},
  pages = {281-298}
}

@article{huholest09a,
  title = {Param{ILS}: An Automatic Algorithm Configuration Framework},
  author = {F. Hutter and H. Hoos and K. Leyton-Brown and T. St{\"u}tzle},
  journal = jair,
  pages = {267-306},
  volume = {36},
  year = {2009}
}

@inproceedings{huhost07a,
  title = {Automatic Algorithm Configuration based on Local Search},
  author = {F. Hutter and H. Hoos and T. St{\"u}tzle},
  crossref = {aaai07},
  pages = {1152-1157},
  year = {2007}
}

@inproceedings{hulofaliholest14a,
  title = {{AC}lib: A Benchmark Library for Algorithm Configuration},
  author = {F. Hutter and M. Lopez-Ibanez and C. Fawcett and M. Lindauer and H. Hoos and K. Leyton-Brown and T. St{\"u}tzle},
  crossref = {lion14},
  pages = {36-40}
}

@article{huluho97a,
  title = {An economic approach to hard computational problems},
  author = {B. Huberman and R. Lukose and T. Hogg},
  journal = {Science},
  pages = {51-54},
  volume = {275},
  year = {1997}
}

@article{hunmcb98a,
  title = {Default databases: Extending the approach of deductive databases using default logic},
  author = {A. Hunter and P. McBrien},
  journal = {Data and Knowledge Engineering},
  pages = {135-160},
  volume = {26},
  year = {1998}
}

@inproceedings{hunter95a,
  title = {Using Default Logic in Information Retrieval},
  author = {A Hunter},
  crossref = {ecsqaru95},
  pages = {235-242}
}

@inproceedings{hunter96a,
  title = {Intelligent text handling using default logic},
  author = {A. Hunter},
  booktitle = {Proceedings of the Eighth {IEEE} International Conference on Tools with Artificial Intelligence (TAI'96)},
  pages = {34-40},
  publisher = ieee,
  year = {1996}
}

@incollection{hunter98a,
  title = {Paraconsistent Logics},
  author = {A. Hunter},
  editor = {D. Gabbay and P. Smets},
  booktitle = {Handbook of Defeasible Reasoning and Uncertainty Management Systems},
  pages = {11-36},
  publisher = kluwer,
  volume = {2},
  year = {1998}
}

@inproceedings{huouwa13a,
  title = {Expressive Completeness for Metric Temporal Logic},
  author = {P. Hunter and J. Ouaknine and J. Worrell},
  crossref = {lics13},
  doi = {10.1109/LICS.2013.41},
  pages = {349-357}
}

@article{huozdi20a,
  title = {Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations},
  author = {U. Hustadt and A. Ozaki and C. Dixon},
  doi = {10.1007/s10817-020-09541-4},
  journal = jar,
  number = {8},
  pages = {1553-1610},
  volume = {64},
  year = {2020}
}

@inproceedings{huseka99a,
  title = {Control Knowledge in Planning: Benefits and Tradeoffs},
  author = {Y. Huang and B. Selman and H. Kautz},
  crossref = {aaai99},
  pages = {511-517}
}

@inproceedings{husotalizhwaga14a,
  title = {Motion Planning with Satisfiability Modulo Theories},
  author = {W. Hung and X. Song and J. Tan and X. Li and J. Zhang and R. Wang and P. Gao},
  crossref = {icra14},
  pages = {113-118}
}

@inproceedings{husvobbass22a,
  title = {Reduction-based Solving of Multi-agent Pathfinding on Large Maps Using Graph Pruning},
  author = {M. Hus{\'a}r and J. Svancara and P. Obermeier and R. Bart{\'a}k and T. Schaub},
  crossref = {aamas22},
  doi = {10.5555/3535850.3535921},
  pages = {624-632}
}

@inproceedings{hyjuni06a,
  title = {A Distribution Method for Solving {SAT} in Grids},
  author = {A. Hyv{\"a}rinen and T. Junttila and I. Niemel{\"a}},
  crossref = {sat06},
  pages = {430-435}
}

@article{hyjuni09a,
  title = {Incorporating Clause Learning in Grid-Based Randomized {SAT} Solving},
  author = {A. Hyv{\"a}rinen and T. Junttila and I. Niemel{\"a}},
  journal = jsat,
  pages = {223-244},
  volume = {6},
  year = {2009}
}

@article{hyjuni11a,
  title = {Partitioning Search Spaces of a Randomized Search},
  author = {A. Hyv{\"a}rinen and T. Junttila and I. Niemel{\"a}},
  journal = {Fundamenta Informaticae},
  number = {2-3},
  pages = {289-311},
  volume = {107},
  year = {2011}
}

@techreport{hyvarinen06a,
  title = {{SATU}: A System for Distributed Propositional Satisfiability Checking in Computational Grids},
  author = {A. Hyv{\"a}rinen},
  institution = {Helsinki University of Technology},
  number = {HUT-TCS-A100},
  type = {Research Report},
  year = {2006}
}

@inproceedings{ieiileri09a,
  title = {An {ASP}-Based System for e-Tourism},
  author = {S. Ielpa and S. Iiritano and N. Leone and F. Ricca},
  crossref = {lpnmr09},
  pages = {368-381}
}

@book{ilfp92,
  title = {Intensional Logics for Programming},
  editor = {L. {Fari{\~n}as del Cerro} and M. Penttonen},
  publisher = {Clarendon Press},
  year = {1992}
}

@article{imilip84,
  title = {Incomplete Information in Relational Databases},
  author = {T. Imieli{\'n}ski and W. Lipski},
  journal = jacm,
  number = {4},
  pages = {761-791},
  volume = {31},
  year = {1984}
}

@inproceedings{infomix05,
  title = {The {INFOMIX} system for advanced integration of incomplete and inconsistent data},
  author = {N. Leone and G. Greco and G. Ianni and V. Lio and G. Terracina and T. Eiter and W. Faber and M. Fink and G. Gottlob and R. Rosati and D. Lembo and M. Lenzerini and M. Ruzzi and E. Kalka and B. Nowicki and W. Staniszkis},
  crossref = {sigmod05},
  pages = {915-917},
  year = {2005}
}

@inproceedings{inkoha92a,
  title = {Embedding Negation as Failure into a Model Generation Theorem Prover},
  author = {K. Inoue and M. Koshimura and R. Hasegawa},
  editor = {D. Kapur},
  booktitle = {Proceedings of the Eleventh International Conference on Automated Deduction},
  pages = {400-415},
  publisher = springer,
  series = lnai,
  volume = {607},
  year = {1992}
}

@article{inlugekiwo04a,
  title = {The {dMARS} architecture: A specification of the distributed multi-agent reasoning system},
  author = {M. d'Inverno and M. Luck and M. Georgeff and D. Kinny and M. Wooldridge},
  journal = {Autonomous Agents and Multi-Agent Systems},
  number = {1-2},
  pages = {5-53},
  publisher = springer,
  volume = {9},
  year = {2004}
}

@misc{inohel89,
  title = {On Theorem Provers for Circumscription},
  author = {K. Inoue and N. Helft},
  howpublished = {ICOT Research Center, 1-4-28 Mita, Minato-ku, Tokyo 108, Japan},
  keywords = {circumscription, theorem proving, linear resolution},
  note = {ICOT Technical Report No. 527},
  origin = {wb_5/90},
  year = {1989}
}

@incollection{inosak12a,
  title = {Oscillating Behavior of Logic Programs},
  author = {K. Inoue and C. Sakama},
  crossref = {vl65},
  pages = {345-362}
}

@article{inosak98a,
  title = {Negation as Failure in the Head},
  author = {K. Inoue and C. Sakama},
  journal = jlp,
  number = {1},
  pages = {39-78},
  volume = {35},
  year = {1998}
}

@inproceedings{inoue11a,
  title = {Logic Programming for Boolean Networks},
  author = {K. Inoue},
  crossref = {ijcai11},
  pages = {924-930}
}

@article{ishbob09a,
  title = {Automated Architecture Synthesis for Parallel Programs on {FPGA} Multiprocessor Systems},
  author = {H. Ishebabi and C. Bobda},
  journal = {Microprocessors and Microsystems},
  pages = {63-71},
  volume = {33},
  year = {2009}
}

@article{ismabogesc09a,
  title = {Answer Set vs Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems From Real-Time Parallel Programs},
  author = {H. Ishebabi and P. Mahr and C. Bobda and M. Gebser and T. Schaub},
  journal = {Journal of Reconfigurable Computing},
  note = {Article ID 863630},
  url = {http://www.hindawi.com/journals/ijrc/2009/863630.html},
  year = {2009}
}

@inproceedings{ismabogesc09b,
  title = {Application of {ASP} for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs},
  author = {H. Ishebabi and P. Mahr and C. Bobda and M. Gebser and T. Schaub},
  crossref = {lpnmr09},
  pages = {598-603}
}

@inproceedings{issar90a,
  title = {Path-Focused Duplication: A Search Procedure for General Matings},
  author = {S. Issar},
  booktitle = aaai,
  pages = {221-226},
  year = {1990}
}

@inproceedings{jabihe10a,
  title = {Blocked Clause Elimination},
  author = {M. J{\"a}rvisalo and A. Biere and M. Heule},
  crossref = {tacas10},
  pages = {129-144}
}

@book{jackson06a,
  title = {Software Abstractions: Logic, Language, and Analysis},
  author = {D. Jackson},
  publisher = {MIT Press},
  year = {2006}
}

@inproceedings{jacpai90a,
  title = {Computing Prime Implicants},
  author = {P. Jackson and J. Pais},
  editor = {M. Stickel},
  booktitle = {10th International Conference on Automated Deduction},
  pages = {543-557},
  publisher = springer,
  year = {1990}
}

@inproceedings{jacrei87,
  title = {A General Proof Method for First-Order Modal Logic},
  author = {P. Jackson and H. Reichgelt},
  booktitle = ijcai,
  pages = {942-944},
  publisher = m-k,
  year = {1987}
}

@inproceedings{jacrei88a,
  title = {A General Proof Method for Modal Predicate Logic without the Barcan Formula},
  author = {P. Jackson and H. Reichgelt},
  booktitle = aaai,
  pages = {177-181},
  publisher = m-k,
  year = {1988}
}

@inproceedings{jacrei88b,
  title = {A Modal Proof Method for Doxastic Reasoning in Incomplete Theories},
  author = {P. Jackson and H. Reichgelt},
  booktitle = ecai,
  pages = {480-485},
  publisher = pitman,
  year = {1988}
}

@article{jacwal07a,
  title = {Comparing Instance Generation Methods for Automated Reasoning},
  author = {S. Jacobs and U. Waldmann},
  journal = jar,
  number = {1-3},
  pages = {57-78},
  volume = {38},
  year = {2007}
}

@inproceedings{jadadeja14a,
  title = {Experimental Evaluation of a State-Of-The-Art Grounder},
  author = {J. Jansen and I. Dasseville and J. Devriendt and G. Janssens},
  crossref = {ppdp14},
  pages = {249-258}
}

@inproceedings{jafmah94,
  title = {Constraint Logic Programming: A Survey},
  author = {J. Jaffar and M. Maher},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  booktitle = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  pages = {591-696},
  year = {1994}
}

@article{jagerinypeco15a,
  title = {Learning Discrete Decomposable Graphical Models via Constraint Optimization},
  author = {T. Janhunen and M. Gebser and J. Rintanen and H. Nyman and J. Pensar and J. Corander},
  journal = {Statistics and Computing},
  number = {1},
  pages = {115-130},
  volume = {27},
  year = {2017}
}

@inproceedings{jajuni04a,
  title = {Unrestricted vs Restricted Cut in a Tableau Method for {B}oolean Circuits.},
  author = {M. J{\"a}rvisalo and T. Junttila and I. Niemel{\"a}},
  crossref = {amai04},
  year = {2004}
}

@article{jajuni05a,
  title = {Unrestricted vs Restricted Cut in a Tableau Method for {B}oolean Circuits},
  author = {M. J{\"a}rvisalo and T. Junttila and I. Niemel{\"a}},
  journal = amai,
  number = {4},
  pages = {373-399},
  volume = {44},
  year = {2005}
}

@article{jakaosscscwa17a,
  title = {Clingo goes Linear Constraints over Reals and Integers},
  author = {T. Janhunen and R. Kaminski and M. Ostrowski and S. Schellhorn and P. Wanko and T. Schaub},
  doi = {10.1017/S1471068417000242},
  journal = tplp,
  number = {5-6},
  pages = {872-888},
  volume = {17},
  year = {2017}
}

@inproceedings{jalini11a,
  title = {Tight Integration of Non-Ground Answer Set Programming and Satisfiability Modulo Theories},
  author = {T. Janhunen and G. Liu and I. Niemel{\"a}},
  crossref = {gttv11},
  pages = {1-13}
}

@inproceedings{jaluma96a,
  title = {Reasoning about Action and Change: Defeasible Observations and Actions with Abnormal Effects},
  author = {J. Jab{\l}onowski and W. {\L}ukaszewicz and E. Madali{\'n}ska-Bugaj},
  editor = {G. G{\"o}rz and S. H{\"o}lldobler},
  booktitle = {Proceedings of the Twentieth Annual German Conference on Artificial Intelligence (KI'96)},
  pages = {135-148},
  publisher = springer,
  series = lnai,
  volume = {1137},
  year = {1996}
}

@inproceedings{jalymama11a,
  title = {{PackUp}: Tools for Package Upgradability Solving},
  author = {M. Janota and I. Lynce and J. Marques-Silva and V. Manquinho},
  crossref = {pos11}
}

@inproceedings{janese08a,
  title = {Computing Stable Models via Reductions to {B}oolean Circuits and Difference Logic},
  author = {T. Janhunen and I. Niemel{\"a} and M. Sevalnev},
  crossref = {lash08},
  doi = {10.1007/978-3-642-04238-6_14},
  pages = {16-30}
}

@inproceedings{janhunen00a,
  title = {Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs},
  author = {T. Janhunen},
  crossref = {cl00},
  pages = {852-866}
}

@inproceedings{janhunen01a,
  title = {On the Effect of Default Negation on the Expressiveness of Disjunctive Rules},
  author = {T. Janhunen},
  crossref = {lpnmr01},
  pages = {93-106}
}

@techreport{janhunen03a,
  title = {Translatability and Intranslatability Results for Certain Classes of Logic Programs},
  author = {T. Janhunen},
  institution = {Helsinki University of Technology},
  number = {HUT-TCS-A82},
  type = {Research Report},
  year = {2003}
}

@inproceedings{janhunen04a,
  title = {Representing Normal Programs with Clauses},
  author = {T. Janhunen},
  crossref = {ecai04},
  pages = {358-362}
}

@article{janhunen06a,
  title = {Some (in)translatability results for normal logic programs and propositional theories},
  author = {T. Janhunen},
  journal = jancl,
  number = {1-2},
  pages = {35-86},
  volume = {16},
  year = {2006}
}

@inproceedings{janhunen07a,
  title = {Intermediate Languages of {ASP} Systems and Tools},
  author = {T. Janhunen},
  crossref = {sea07},
  pages = {12-25}
}

@inproceedings{janhunen22a,
  title = {Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo},
  author = {T. Janhunen},
  crossref = {padl22},
  pages = {135-153}
}

@inproceedings{janhunen99a,
  title = {Classifying Semi-Normal Default Logic on the Basis of its Expressive Power},
  author = {T. Janhunen},
  crossref = {lpnmr99},
  pages = {19-33}
}

@inproceedings{janise09a,
  title = {Computing Stable Models via Reductions to Difference Logic},
  author = {T. Janhunen and I. Niemel{\"a} and M. Sevalnev},
  crossref = {lpnmr09},
  pages = {142-154}
}

@article{janisesiyo06a,
  title = {Unfolding Partiality and Disjunctions in Stable Model Semantics},
  author = {T. Janhunen and I. Niemel{\"a} and D. Seipel and P. Simons and J. You},
  journal = tocl,
  number = {1},
  pages = {1-37},
  volume = {7},
  year = {2006}
}

@inproceedings{janisiyo00a,
  title = {Unfolding Partiality and Disjunctions in Stable Model Semantics},
  author = {T. Janhunen and I. Niemel{\"a} and P. Simons and J. You},
  crossref = {kr00},
  pages = {411-419}
}

@inproceedings{janmar11a,
  title = {On Deciding {MUS} Membership with {QBF}},
  author = {M. Janota and J. Marques-Silva},
  crossref = {cp11},
  pages = {414-428}
}

@inproceedings{janmar15a,
  title = {Solving {QBF} by Clause Selection},
  author = {M. Janota and J. Marques-Silva},
  crossref = {ijcai15},
  pages = {325-331}
}

@incollection{jannie11a,
  title = {Compact Translations of Non-Disjunctive Answer Set Programs to Propositional Clauses},
  author = {T. Janhunen and I. Niemel{\"a}},
  crossref = {mg65},
  pages = {111-130}
}

@incollection{jannie12a,
  title = {Applying Visible Strong Equivalence in Answer-Set Program Transformations},
  author = {T. Janhunen and I. Niemel{\"a}},
  crossref = {vl65},
  pages = {363-379}
}

@article{jannie16a,
  title = {The Answer Set Programming Paradigm},
  author = {T. Janhunen and I. Niemel{\"a}},
  journal = aim,
  number = {3},
  pages = {13-24},
  volume = {37},
  year = {2016}
}

@inproceedings{janoik04a,
  title = {Capturing Parallel Circumscription with Disjunctive Logic Programs},
  author = {T. Janhunen and E. Oikarinen},
  crossref = {jelia04},
  pages = {134-146}
}

@inproceedings{janoik04b,
  title = {{LPEQ} and {DLPEQ} --- Translators for Automated Equivalence Testing of Logic Programs},
  author = {T. Janhunen and E. Oikarinen},
  crossref = {lpnmr04},
  pages = {336-340}
}

@inproceedings{jaoitowo07a,
  title = {Modularity Aspects of Disjunctive Stable Models},
  author = {T. Janhunen and E. Oikarinen and H. Tompits and S. Woltran},
  crossref = {lpnmr07},
  pages = {175-187}
}

@article{jaoitowo09a,
  title = {Modularity Aspects of Disjunctive Stable Models},
  author = {T. Janhunen and E. Oikarinen and H. Tompits and S. Woltran},
  journal = jair,
  pages = {813-857},
  volume = {35},
  year = {2009}
}

@book{jareha89,
  title = {Logic-Based Knowledge Representation},
  author = {P. Jackson and H. Reichgelt and F. van Harmelen},
  publisher = {MIT Press},
  year = {1989}
}

@inproceedings{jarjun07a,
  title = {Limitations of Restricted Branching in Clause Learning},
  author = {M. J{\"a}rvisalo and T. Junttila},
  crossref = {cp07},
  pages = {348-363}
}

@article{jarjun08a,
  title = {Limitations of Restricted Branching in Clause Learning},
  author = {M. J{\"a}rvisalo and T. Junttila},
  journal = {Constraints},
  pages = {325-356},
  volume = {14},
  year = {2009}
}

@article{jarjun09a,
  title = {Limitations of Restricted Branching in Clause Learning},
  author = {M. J{\"a}rvisalo and T. Junttila},
  journal = {Constraints},
  number = {3},
  pages = {325-356},
  volume = {14},
  year = {2009}
}

@inproceedings{jaroik07a,
  title = {Extended {ASP} Tableaux and Rule Redundancy in Normal Logic Programs},
  author = {M. J{\"a}rvisalo and E. Oikarinen},
  crossref = {iclp07},
  pages = {134-148},
  year = {2007}
}

@article{jaroik08a,
  title = {Extended {ASP} Tableaux and Rule Redundancy in Normal Logic Programs},
  author = {M. J{\"a}rvisalo and E. Oikarinen},
  journal = tplp,
  number = {5-6},
  pages = {691-716},
  volume = {8},
  year = {2008}
}

@inproceedings{jarvisalo11a,
  title = {Itemset Mining as a Challenge Application for Answer Set Enumeration},
  author = {M. J{\"a}rvisalo},
  crossref = {lpnmr11},
  pages = {304-310}
}

@inproceedings{jasasa13a,
  title = {Boolean satisfiability for sequence mining},
  author = {S. Jabbour and L. Sais and Y. Salhi},
  crossref = {cikm13},
  pages = {649-658}
}

@inproceedings{jashsr01a,
  title = {A micromodularity mechanism},
  author = {D. Jackson and I. Shlyakhter and M. Sridharan},
  booktitle = {Proceedings of the Eighth European Software Engineering Conference/9th ACM SIGSOFT International Symposium on Foundations of Software Engineering (ESEC/FSE'01)},
  pages = {62-73},
  publisher = acm,
  year = {2001}
}

@article{jenand06a,
  title = {Tools and Algorithms for the Construction and Analysis of Systems},
  author = {K. Jensen and P. Andreas},
  journal = jsttt,
  number = {3},
  pages = {177-179},
  publisher = springer,
  volume = {8},
  year = {2006}
}

@article{jennings00a,
  title = {On agent-based software engineering},
  author = {N. Jennings},
  journal = ai,
  number = {2},
  pages = {277-296},
  publisher = elsevier,
  volume = {117},
  year = {2000}
}

@article{jerwan90a,
  title = {Solving Propositional Satisfiability Problems},
  author = {R. Jeroslow and J. Wang},
  journal = amai,
  pages = {167-187},
  volume = {1},
  year = {1990}
}

@inproceedings{jihaso05a,
  title = {Efficient Conflict Analysis for Finding All Satisfying Assignments of a {B}oolean Circuit},
  author = {H. Jin and H. Han and F. Somenzi},
  crossref = {tacas05},
  pages = {287-300}
}

@inproceedings{jinsom06a,
  title = {Strong conflict analysis for propositional satisfiability},
  author = {H. Jin and F. Somenzi},
  crossref = {date06},
  pages = {818-823}
}

@article{jizhkhst19a,
  title = {Task planning in robotics: an empirical comparison of {PDDL}- and {ASP}-based systems},
  author = {Y. Jiang and S. Zhang and P. Khandelwal and P. Stone},
  journal = {Frontiers of Information Technology and Electronic Engineering},
  number = {3},
  pages = {363-373},
  volume = {20},
  year = {2019}
}

@book{johnson-laird83,
  title = {Mental Models --- Towards a Cognitive Science of Language, Inference, and Consciousness},
  author = {P. Johnson-Laird},
  address = {Cambridge, MA},
  publisher = {Harvard University Press},
  year = {1983}
}

@article{jonlaa76a,
  title = {Complete Problems For Deterministic Polynomial Time},
  author = {N. Jones and W. Laaser},
  journal = tcs,
  number = {1},
  pages = {105-117},
  volume = {3},
  year = {1976}
}

@inproceedings{josasc12a,
  title = {Suggesting New Interactions Related to Events in a Social Network for Elderly},
  author = {H. Jost and O. Sabuncu and T. Schaub},
  booktitle = {Proceedings of the Second International Workshop on Design and Implementation of Independent and Assisted Living Technology},
  year = {2012}
}

@article{joypal06a,
  title = {The model organism as a system: Integrating `omics' data sets},
  author = {A. Joyce and B. Palsson},
  journal = {Nature Reviews Molecular Cell Biology},
  number = {3},
  pages = {198-210},
  volume = {7},
  year = {2006}
}

@inproceedings{juhsmc12a,
  title = {Preference-Based Planning via {M}ax{SAT}},
  author = {F. Juma and E. Hsu and S. McIlraith},
  crossref = {ai12},
  pages = {109-120}
}

@inproceedings{juliut01a,
  title = {Parallelizing {S}ATZ Using Dynamic Workload Balancing},
  author = {B. Jurkowiak and C. Li and G. Utard},
  crossref = {sat01},
  pages = {174-189}
}

@article{juliut05a,
  title = {A Parallelization Scheme Based on Work Stealing for a Class of {SAT} Solvers},
  author = {B. Jurkowiak and C. Li and G. Utard},
  journal = jar,
  number = {1},
  pages = {73-101},
  volume = {34},
  year = {2005}
}

@inproceedings{junkas10a,
  title = {Exact Cover via Satisfiability: An Empirical Study},
  author = {T. Junttila and P. Kaski},
  crossref = {cp10},
  pages = {297-304}
}

@inproceedings{junker04a,
  title = {{QUICKXPLAIN:} Preferred Explanations and Relaxations for Over-Constrained Problems},
  author = {U. Junker},
  crossref = {aaai04},
  pages = {167-172}
}

@incollection{junker06a,
  title = {Configuration},
  author = {U. Junker},
  chapter = {24},
  crossref = {CPHandbook},
  doi = {10.1016/s1574-6526(06)80028-3},
  pages = {837-873}
}

@techreport{junker88,
  title = {Reasoning in Multiple Contexts},
  author = {U. Junker},
  address = gmd-adr,
  institution = gmd,
  number = {334},
  type = {Diplomarbeit},
  year = {1988}
}

@inproceedings{junker89a,
  title = {Nicht-monotone Beweiser f{\"u}r Autoepistemische Logik und Defaultlogik},
  author = {U. Junker},
  editor = {D. Metzing},
  booktitle = gwai,
  organization = gi,
  pages = {7-16},
  publisher = springer,
  year = {1989}
}

@inproceedings{junker89b,
  title = {A Correct Non-Monotonic {ATMS}},
  author = {U. Junker},
  booktitle = ijcai,
  pages = {1049-1054},
  publisher = m-k,
  year = {1989}
}

@techreport{junker89c,
  title = {{EXCEPT}: A Rule-Based System for Multiple Contexts, Inconsistencies, and Exceptions},
  author = {U. Junker},
  address = gmd-adr,
  institution = gmd,
  number = {371},
  type = {Arbeitspapiere der {GMD}},
  year = {1989}
}

@inproceedings{junker90a,
  title = {Variations on Backtracking for {TMS}},
  author = {U. Junker},
  editor = {J. Martins and M. Reinfrank},
  booktitle = {Proceedings of {TMS}-Workshop},
  organization = ecai,
  year = {1990}
}

@incollection{junker90b,
  title = {Non-Monotonic Proof Procedures for Autoepistemic and Default Logics},
  author = {U. Junker},
  editor = {G. Brewka and U. Junker},
  address = gmd-adr,
  booktitle = {Aspects of Non-Monotonic Reasoning},
  publisher = gmd,
  type = {{TASSO} Report No 1},
  year = {1990}
}

@techreport{junker91a,
  title = {{The EXCEPT II} Default Reasoning System.},
  author = {U. Junker},
  address = gmd-adr,
  institution = gmd,
  note = {Preliminary Report},
  number = {23},
  type = {{TASSO} Report},
  year = {1991}
}

@inproceedings{junker91b,
  title = {Prioritized Defaults: Implementation by {TMS} and Application to Diagnosis},
  author = {U. Junker},
  booktitle = ijcai,
  year = {1991}
}

@phdthesis{junker93a,
  title = {Relationships between assumptions},
  author = {U. Junker},
  school = {University of Kaiserslautern},
  type = {Dissertation},
  year = {1992}
}

@inproceedings{junker97a,
  title = {A Cumulative Model Semantics for Dynamic Preferences on Assumptions},
  author = {U. Junker},
  editor = {M. Pollack},
  booktitle = ijcai,
  pages = {162-167},
  publisher = m-k,
  year = {1997}
}

@inproceedings{junkon90,
  title = {Computing the Extensions of Autoepistemic and Default Logic with a {TMS}},
  author = {U. Junker and K. Konolige},
  booktitle = aaai,
  pages = {278-283},
  publisher = aaaimit,
  year = {1990}
}

@inproceedings{junnie00a,
  title = {Towards an Efficient Tableau Method for {B}oolean Circuit Satisfiability Checking.},
  author = {T. Junttila and I. Niemel{\"a}},
  crossref = {cl00},
  pages = {553-567}
}

@unpublished{junpau92,
  title = {Logic-Based Methods for Design},
  author = {U. Junker and J. Paulokat},
  note = {Unpublished manuscript.},
  year = {1992}
}

@article{kabascsota24a,
  title = {Dominating Set Reconfiguration with Answer Set Programming},
  author = {M. Kato and M. Banbara and T. Schaub and T. Soh and N. Tamura},
  doi = {10.1017/S1471068424000292},
  journal = tplp,
  number = {4},
  pages = {755-771},
  volume = {24},
  year = {2024}
}

@inproceedings{kabost21,
  title = {Experimental Evaluation of Classical Multi Agent Path Finding Algorithms},
  author = {O. Kaduri and E. Boyarski and R. Stern},
  crossref = {socs21},
  doi = {10.1609/SOCS.V12I1.18560},
  pages = {126-130}
}

@book{kager99,
  title = {Optimality Theory: A Textbook},
  author = {R. Kager},
  publisher = cup,
  year = {1999}
}

@inproceedings{kahorugose02a,
  title = {Dynamic Restart Policies},
  author = {H. Kautz and E. Horvitz and Y. Ruan and C. Gomes and B. Selman},
  crossref = {aaai02},
  pages = {674-681}
}

@inproceedings{kakman90,
  title = {On the relation between Truth Maintenance and Abduction},
  author = {A. Kakas and P. Mancarella},
  crossref = {nmr90},
  pages = {158-176}
}

@article{kakmil97a,
  title = {A simple declarative language for describing narratives with actions},
  author = {A. Kakas and R. Miller},
  doi = {https://doi.org/10.1016/S0743-1066(96)00138-0},
  journal = jlp,
  number = {1},
  pages = {157-200},
  volume = {31},
  year = {1997}
}

@article{kakton99a,
  title = {Computing Argumentation in Logic Programming},
  author = {A. Kakas and F. Toni},
  journal = jlc,
  pages = {515-562},
  volume = {9},
  year = {1999}
}

@article{kalepesc16a,
  title = {Grounding and Solving in Answer Set Programming},
  author = {B. Kaufmann and N. Leone and S. Perri and T. Schaub},
  journal = aim,
  number = {3},
  pages = {25-32},
  volume = {37},
  year = {2016}
}

@inproceedings{kaleso16a,
  title = {A Parallel Memory-efficient Epistemic Logic Program Solver: Harder, Better, Faster},
  author = {P. Kahl and A. Leclerc and T. Son},
  crossref = {aspocp16}
}

@article{kalica98a,
  title = {Planning and Acting in Partially Observable Stochastic Domains},
  author = {L. Kaelbling and M. Littman and A. Cassandra},
  journal = ai,
  number = {1-2},
  pages = {99-134},
  volume = {101},
  year = {1998}
}

@inproceedings{kamasasase11a,
  title = {Algorithm Selection and Scheduling},
  author = {S. Kadioglu and Y. Malitsky and A. Sabharwal and H. Samulowitz and M. Sellmann},
  crossref = {cp11},
  pages = {454-469}
}

@inproceedings{kamaseti10a,
  title = {{ISAC} --- Instance-Specific Algorithm Configuration},
  author = {S. Kadioglu and Y. Malitsky and M. Sellmann and K. Tierney},
  crossref = {ecai10},
  pages = {751-756}
}

@inproceedings{kamcse96a,
  title = {Encoding Plans in Propositional Logic},
  author = {H. Kautz and D. McAllester and B. Selman},
  crossref = {kr96},
  pages = {374-384}
}

@inproceedings{kamitemazhgu06a,
  title = {Constructing {C}amin-{S}okal Phylogenies Via Answer Set Programming},
  author = {J. Kavanagh and D. Mitchell and E. Ternovska and J. Manuch and X. Zhao and A. Gupta},
  crossref = {lpar06},
  pages = {452-466},
  year = {2006}
}

@inproceedings{kamito01a,
  title = {{E}-RES: Reasoning about Actions, Events and Observations},
  author = {A. Kakas and R. Miller and F. Toni},
  crossref = {lpnmr01},
  pages = {254-267}
}

@phdthesis{kamp68a,
  title = {Tense Logic and the Theory of Linear Order},
  author = {J. Kamp},
  school = {University of California at Los Angeles},
  year = {1968}
}

@article{kamsch21a,
  title = {On the Foundations of Grounding in Answer Set Programming},
  author = {R. Kaminski and T. Schaub},
  doi = {10.1017/S1471068422000308},
  journal = tplp,
  number = {6},
  pages = {1138-1197},
  publisher = cup,
  volume = {23},
  year = {2023}
}

@inproceedings{kapala97a,
  title = {Understanding and Extending Graphplan},
  author = {S. Kambhampati and E. Parker and E. Lambrecht},
  crossref = {ecp97},
  pages = {260-272}
}

@article{kapzak20a,
  title = {Alternation in two-way finite automata},
  author = {C. Kapoutsis and M. Zakzok},
  doi = {10.1016/j.tcs.2020.12.011},
  journal = tcs,
  pages = {75-102},
  publisher = elsevier,
  volume = {870},
  year = {2021}
}

@article{karoscwa21a,
  title = {How to Build Your Own {ASP}-based System?!},
  author = {R. Kaminski and J. Romero and T. Schaub and P. Wanko},
  doi = {10.1017/S1471068421000508},
  journal = tplp,
  number = {1},
  pages = {299-361},
  publisher = cup,
  volume = {23},
  year = {2023}
}

@inproceedings{kartha93a,
  title = {Soundness and Completeness Theorems for Three Formalizations of Action},
  author = {G. Kartha},
  booktitle = ijcai,
  pages = {724-729},
  publisher = m-k,
  year = {1993}
}

@phdthesis{kartha95a,
  title = {A Mathematical Investigation of Reasoning About Actions},
  author = {G. Kartha},
  school = {Department of Computer Science, UT Austin},
  year = {1995}
}

@inproceedings{kascsc12a,
  title = {clasp, claspfolio, aspeed: Three Solvers from the Answer Set Solving Collection {P}otassco},
  author = {B. Kaufmann and T. Schaub and M. Schneider},
  crossref = {satchallenge12},
  pages = {17-19}
}

@article{kascsivi13a,
  title = {Minimal Intervention Strategies in Logical Signaling Networks with Answer Set Programming},
  author = {R. Kaminski and T. Schaub and A. Siegel and S. Videla},
  journal = tplp,
  number = {4-5},
  pages = {675-690},
  volume = {13},
  year = {2013}
}

@inproceedings{kascstsv24a,
  title = {Improving the Sum-of-Cost Methods for Reduction-Based Multi-Agent Pathfinding Solvers},
  author = {R. Kaminski and T. Schaub and K. Strauch and J. Svancara},
  crossref = {icaart24},
  doi = {10.5220/0012353500003636},
  pages = {264-271}
}

@inproceedings{kascwa17a,
  title = {A Tutorial on Hybrid Answer Set Solving with clingo},
  author = {R. Kaminski and T. Schaub and P. Wanko},
  crossref = {rw17},
  doi = {10.1007/978-3-319-61033-7\_6},
  pages = {167-203}
}

@inproceedings{katbac05a,
  title = {Generalized NoGoods in {CSP}s},
  author = {G. Katsirelos and F. Bacchus},
  crossref = {aaai05},
  pages = {390-396}
}

@inproceedings{katmen91a,
  title = {On the Difference Between Updating a Knowledge Database and Revising It},
  author = {H. Katsuno and A. Mendelzon},
  crossref = {kr91},
  pages = {387-394}
}

@article{katmen91b,
  title = {Propositional knowledge base revision and minimal change},
  author = {H. Katsuno and A. Mendelzon},
  journal = ai,
  number = {3},
  pages = {263-294},
  volume = {52},
  year = {1991}
}

@phdthesis{katsirelos08a,
  title = {Nogood Processing in {CSP}s},
  author = {G. Katsirelos},
  school = {University of Toronto},
  year = {2008}
}

@inproceedings{kausel89,
  title = {Hard Problems for Simple Default Logics},
  author = {H. Kautz and B. Selman},
  crossref = {kr89},
  pages = {189-197}
}

@article{kausel91,
  title = {Hard Problems for Simple Default Logics},
  author = {H. Kautz and B. Selman},
  journal = ai,
  pages = {243-179},
  volume = {49},
  year = {1991}
}

@inproceedings{kausel92a,
  title = {Forming Concepts for Fast Inference},
  author = {H. Kautz and B. Selman},
  booktitle = aaai,
  pages = {786-793},
  publisher = aaaimit,
  year = {1992}
}

@inproceedings{kausel92b,
  title = {Planning as Satisfiability},
  author = {H. Kautz and B. Selman},
  crossref = {ecai92},
  pages = {359-363}
}

@inproceedings{kausel94,
  title = {An Empirical Evaluation of Knowledge Compilation},
  author = {H. Kautz and B. Selman},
  booktitle = aaai,
  pages = {155-161},
  publisher = aaaimit,
  year = {1994}
}

@inproceedings{kausel96a,
  title = {Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search},
  author = {H. Kautz and B. Selman},
  editor = {H. Shrobe and T. Senator},
  booktitle = aaai,
  pages = {1194-1201},
  publisher = {{AAAI} Press},
  url = {citeseer.nj.nec.com/kautz96pushing.html},
  year = {1996}
}

@inproceedings{kausel99a,
  title = {Unifying {SAT}-based and Graph-based Planning},
  author = {H. Kautz and B. Selman},
  crossref = {ijcai99},
  pages = {318-325}
}

@inproceedings{kautz06a,
  title = {Deconstructing Planning as Satisfiability},
  author = {H. Kautz},
  crossref = {aaai06}
}

@inproceedings{kauwal99a,
  title = {State-space Planning by Integer Optimization},
  author = {H. Kautz and J. Walser},
  crossref = {aaai99},
  pages = {526-533}
}

@article{kawabagezh15a,
  title = {The language of epistemic specifications (refined) including a prototype solver},
  author = {P. Kahl and R. Watson and E. Balai and M. Gelfond and Y. Zhang},
  journal = jlc,
  year = {2015}
}

@article{kawabagezh20a,
  title = {The language of epistemic specifications (refined) including a prototype solver},
  author = {P. Kahl and R. Watson and E. Balai and M. Gelfond and Y. Zhang},
  journal = jlc,
  number = {4},
  pages = {953-989},
  volume = {30},
  year = {2020}
}

@book{keene89,
  title = {Object-Oriented Programming in Common Lisp: A Programmer's Guide to CLOS},
  author = {S. Keene},
  address = {Reading, MA},
  publisher = addison,
  year = {1989}
}

@inproceedings{keloleboch15a,
  title = {{PREFIX-PROJECTION} Global Constraint for Sequential Pattern Mining},
  author = {A. Kemmar and S. Loudni and Y. Lebbah and P. Boizumault and T. Charnois},
  crossref = {cp15},
  pages = {226-243}
}

@inproceedings{kemstu91a,
  title = {Semantics of Logic Programs with Aggregates},
  author = {D. Kemp and P. Stuckey},
  editor = {V. Saraswat and K. Ueda},
  booktitle = {Proceedings of the 1991 International Symposium on Logic Programming (ISLP'91)},
  pages = {387-401},
  publisher = {MIT Press},
  year = {1991}
}

@article{kercod94a,
  title = {Parallel Logic Programming Systems.},
  author = {J. {Chassin de Kergommeaux} and P. Codognet},
  journal = acmcs,
  number = {3},
  pages = {295-336},
  volume = {26},
  year = {1994}
}

@inproceedings{kestsr91a,
  title = {Magic Sets and Bottom-up Evaluation of Well-Founded Models},
  author = {D. Kemp and P. Stuckey and D. Srivastava},
  booktitle = {Logic Programming, Proceedings of the 1991 International Symposium},
  pages = {337-351},
  publisher = {{MIT} Press},
  year = {1991}
}

@inproceedings{ketonen44,
  title = {Untersuchungen zum {P}r{\"a}dikatenkalk{\"u}l},
  author = {G. Ketonen},
  booktitle = {Mathematica-physica},
  pages = {71 pp},
  series = {Annales Academiae Scientiarum Fennicae},
  volume = {A},
  year = {1944}
}

@inproceedings{khmashja03a,
  title = {A Case for Efficient Solution Enumeration},
  author = {S. Khurshid and D. Marinov and I. Shlyakhter and D. Jackson},
  crossref = {sat03},
  pages = {272-286}
}

@inproceedings{khrosa16a,
  title = {A modular design space exploration framework for multiprocessor real-time systems},
  author = {N. Khalilzad and K. Rosvall and I. Sander},
  booktitle = {Proceedings of Forum on Specification and Design Languages (FDL'16)},
  doi = {10.1109/FDL.2016.7880377},
  pages = {1-7},
  year = {2016}
}

@inproceedings{khxuhole09a,
  title = {{SAT}enstein: Automatically Building Local Search {SAT} Solvers from Components},
  author = {A. KhudaBukhsh and L. Xu and F. Hutter and H. Hoos and K. Leyton-Brown},
  crossref = {ijcai09},
  pages = {517-524}
}

@inproceedings{khyalelist14a,
  title = {Planning in Action Language {BC} while Learning Action Costs for Mobile Robots},
  author = {P. Khandelwal and F. Yang and M. Leonetti and V. Lifschitz and P. Stone},
  crossref = {icaps14}
}

@inproceedings{kifloz89,
  title = {{RI}: A logic for reasoning with inconsistency},
  author = {M. Kifer and E. Lozinskii},
  crossref = {lics89},
  pages = {253-262}
}

@inproceedings{kilepa09a,
  title = {Circumscriptive Event Calculus as Answer Set Programming},
  author = {T. Kim and J. Lee and R. Palla},
  crossref = {ijcai09},
  pages = {823-829}
}

@inproceedings{kislthwa06a,
  title = {Estimating Search Tree Size},
  author = {P. Kilby and J. Slaney and S. Thi{\'e}baux and T. Walsh},
  crossref = {aaai06}
}

@article{kitano02a,
  title = {Systems biology: a brief overview.},
  author = {H. Kitano},
  journal = {Science},
  number = {5560},
  pages = {1662-1664},
  volume = {295},
  year = {2002}
}

@incollection{klebub09a,
  title = {Theory of Quantified {B}oolean Formulas},
  author = {H. {Kleine B{\"u}ning} and U. Bubeck},
  chapter = {23},
  crossref = {SATHandbook},
  pages = {735-760}
}

@inproceedings{kleene38a,
  title = {On Notation for Ordinal Numbers},
  author = {S. Kleene},
  issue = {4},
  journal = jsl,
  pages = {150-155},
  volume = {3},
  year = {1938}
}

@inproceedings{klikwo07a,
  title = {Efficient {CNF} Encoding for Selecting $1$ from $N$ Objects},
  author = {W. Klieber and G. Kwon},
  crossref = {cfv07}
}

@inproceedings{kloeputo11a,
  title = {Kara: {A} System for Visualising and Visual Editing of Interpretations for Answer-Set Programs},
  author = {C. Kloim{\"u}llner and J. Oetsch and J. P{\"u}hrer and H. Tompits},
  crossref = {inap11},
  doi = {10.1007/978-3-642-41524-1\_20},
  pages = {325-344}
}

@article{klug82a,
  title = {Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions},
  author = {A. Klug},
  journal = jacm,
  number = {3},
  pages = {699-717},
  volume = {29},
  year = {1982}
}

@book{knuth93,
  title = {The Stanford GraphBase: A platform for combinatorial computing},
  author = {D. Knuth},
  publisher = addison,
  year = {1993}
}

@inproceedings{kocito01a,
  title = {Specification of Workflow Process Using the Action Description Language {C}},
  author = {P. Koksal and N. Cicekli and I. Toroslu},
  crossref = {asp01},
  pages = {103-109}
}

@inproceedings{kocsze06a,
  title = {Bandit Based Monte-Carlo Planning},
  author = {L. Kocsis and C. Szepesv{\'a}ri},
  editor = {J. F{\"u}rnkranz and T. Scheffer and M. Spiliopoulou},
  booktitle = {Proceedings of the Seventeenth European Conference on Machine Learning (ECML'06)},
  pages = {282-293},
  publisher = springer,
  series = lncs,
  volume = {4212},
  year = {2006}
}

@inproceedings{koesch13a,
  title = {Monitoring and Visualizing Answer Set Solving},
  author = {A. K{\"o}nig and T. Schaub},
  crossref = {iclp-tc13}
}

@inproceedings{kogemi11a,
  title = {A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems},
  author = {L. Kotthoff and I. Gent and I. Miguel},
  crossref = {socs11},
  pages = {84-91}
}

@article{kohakamo20a,
  title = {{SMT}2020---A Semiconductor Manufacturing Testbed},
  author = {D. Kopp and M. Hassoun and A. Kalir and L. M{\"o}nch},
  journal = {IEEE Transactions on Semiconductor Manufacturing},
  number = {4},
  pages = {522-531},
  volume = {33},
  year = {2020}
}

@article{kolepf03a,
  title = {Enhancing disjunctive logic programming systems by {SAT} checkers},
  author = {C. Koch and N. Leone and G. Pfeifer},
  journal = ai,
  number = {1-2},
  pages = {177-212},
  volume = {151},
  year = {2003}
}

@inproceedings{kolisc03a,
  title = {Graphs and colorings for answer set programming: Abridged report},
  author = {K. Konczak and T. Linke and T. Schaub},
  crossref = {asp03},
  pages = {137-150}
}

@inproceedings{kolisc03b,
  title = {Graphs and colorings for answer set programming: Abridged Report},
  author = {K. Konczak and T. Linke and T. Schaub},
  crossref = {lpnmr04},
  pages = {127-140}
}

@article{kolisc05a,
  title = {Graphs and colorings for answer set programming},
  author = {K. Konczak and T. Linke and T. Schaub},
  journal = tplp,
  number = {1-2},
  pages = {61-106},
  volume = {6},
  year = {2006}
}

@incollection{kolisc05b,
  title = {Graphs and colorings for answer set programming},
  author = {K. Konczak and T. Linke and T. Schaub},
  booktitle = {Computing Research Repository (CoRR)},
  note = {Extended version of~\cite{kolisc05a}},
  url = {http://arxiv.org/abs/cs.AI/0502082},
  year = {2005}
}

@inproceedings{komgef15a,
  title = {Beliefs In Multiagent Planning: From One Agent to Many},
  author = {F. Kominis and H. Geffner},
  crossref = {icaps15},
  pages = {147-155}
}

@inproceedings{komgef17a,
  title = {Multiagent Online Planning with Nested Beliefs and Dialogue},
  author = {F. Kominis and H. Geffner},
  crossref = {icaps17},
  pages = {186-194}
}

@inproceedings{konczak06a,
  title = {Weak Order Equivalence for Logic Programs with Preferences},
  author = {K. Konczak},
  crossref = {wlp06},
  pages = {154-163}
}

@inproceedings{konczak06b,
  title = {Voting Theory in Answer Set Programming},
  author = {K. Konczak},
  crossref = {wlp06},
  pages = {45-53}
}

@phdthesis{konczak06z,
  title = {Preferences in Answer Set Programming},
  author = {K. Konczak},
  note = {Submitted.},
  school = uofp,
  type = {Dissertation},
  year = {2006}
}

@inproceedings{konlan05a,
  title = {Voting procedures with incomplete preferences},
  author = {K. Konczak and J. Lang},
  editor = {R. Brafman and U. Junker},
  booktitle = {Workshop on Advances in Preference Handling},
  pages = {124-129},
  year = {2005}
}

@inproceedings{konmar02a,
  title = {Three-valued Logics for Inconsistency Handling},
  author = {S. Konieczny and P. Marquis},
  crossref = {jelia02},
  pages = {332-344}
}

@article{konmye89,
  title = {Representing Defaults with eoistemic concepts},
  author = {K. Konolige and K. Myers},
  journal = ci,
  pages = {32-44},
  volume = {5},
  year = {1989}
}

@inproceedings{konolige87,
  title = {On the Relation between Default and Autoepistemic Logic},
  author = {K. Konolige},
  booktitle = ijcai,
  year = {1987}
}

@article{konolige88a,
  title = {On the Relation between Default and Autoepistemic Logic},
  author = {K. Konolige},
  journal = ai,
  number = {2},
  pages = {343-382},
  volume = {35},
  year = {1988}
}

@inproceedings{konolige88b,
  title = {Hierarchic Autoepistemic Theories for Nonmonotonic Reasoning},
  author = {K. Konolige},
  booktitle = aaai,
  pages = {439-443},
  publisher = m-k,
  year = {1988}
}

@inproceedings{konolige89,
  title = {On the Relation between Autoepistemic Logic and Circumscription},
  author = {K. Konolige},
  booktitle = ijcai,
  note = {Preliminary Report.},
  pages = {1213-1218},
  year = {1989}
}

@article{konpin02a,
  title = {Merging Information under Constraints: A Logical Framework},
  author = {S. Konieczny and R. {Pino P{\'e}rez}},
  journal = jlc,
  number = {5},
  pages = {773-808},
  volume = {12},
  year = {2002}
}

@article{konur13a,
  title = {A survey on temporal logics for specifying and verifying real-time systems},
  author = {S. Konur},
  journal = {Frontiers of Computer Science},
  number = {3},
  pages = {370-403},
  volume = {7},
  year = {2013}
}

@inproceedings{konvog05a,
  title = {Abduction and Preferences in Linguistics},
  author = {K. Konczak and R. Vogel},
  crossref = {asp05},
  pages = {263-276}
}

@inproceedings{konvog05b,
  title = {Abduction and Preferences in Linguistics: Extended Abstract},
  author = {K. Konczak and R. Vogel},
  crossref = {lpnmr05},
  pages = {384-388}
}

@article{kooijasa15a,
  title = {Optimizing Phylogenetic Supertrees Using Answer Set Programming},
  author = {L. Koponen and E. Oikarinen and T. Janhunen and L. S{\"a}il{\"a}},
  journal = tplp,
  number = {4-5},
  pages = {604-619},
  volume = {15},
  year = {2015}
}

@article{korf85a,
  title = {Depth-First Iterative-Deepening: An Optimal Admissible Tree Search},
  author = {R. Korf},
  journal = ai,
  number = {1},
  pages = {97-109},
  volume = {27},
  year = {1985}
}

@inproceedings{korovin09a,
  title = {Instantiation-Based Automated Reasoning: From Theory to Practice},
  author = {K. Korovin},
  crossref = {cade09},
  pages = {163-166}
}

@inproceedings{korsti10a,
  title = {i{P}rover-{E}q: An Instantiation-Based Theorem Prover with Equality},
  author = {K. Korovin and C. Sticksel},
  crossref = {ijcar10},
  pages = {196-202}
}

@inproceedings{koscli03a,
  title = {Graphs and colorings for answer set programming with preferences: Preliminary Report},
  author = {K. Konczak and T. Schaub and T. Linke},
  crossref = {asp03},
  pages = {43-56}
}

@article{koscli03b,
  title = {Graphs and colorings for answer set programming with preferences},
  author = {K. Konczak and T. Schaub and T. Linke},
  journal = {Fundamenta Informaticae},
  number = {2-4},
  pages = {393-421},
  volume = {57},
  year = {2003}
}

@inproceedings{kotaalelgese22a,
  title = {A Customizable Simulator for Artificial Intelligence Research to Schedule Semiconductor Fabs},
  author = {B. Kov{\'a}cs and P. Tassel and R. Ali and M. El-Kholany and M. Gebser and G. Seidel},
  crossref = {asmc22},
  pages = {106-111}
}

@inproceedings{kotage23a,
  title = {Optimizing Dispatching Strategies for Semiconductor Manufacturing Facilities with Genetic Programming},
  author = {B. Kov{\'a}cs and P. Tassel and M. Gebser},
  crossref = {gecco23},
  pages = {1374-1382}
}

@inproceedings{kotagese22a,
  title = {A Customizable Reinforcement Learning Environment for Semiconductor Fab Simulation},
  author = {B. Kov{\'a}cs and P. Tassel and M. Gebser and G. Seidel},
  crossref = {wsc22},
  pages = {2663-2674}
}

@inproceedings{kotakoscge21a,
  title = {Utilizing Constraint Optimization for Industrial Machine Workload Balancing},
  author = {B. Kov{\'a}cs and P. Tassel and W. Kohlenbrein and P. Schrott-Kostwein and M. Gebser},
  crossref = {cp21},
  pages = {36:1-36:17}
}

@inproceedings{kovvor13a,
  title = {First-Order Theorem Proving and {V}ampire},
  author = {L. Kov{\'a}cs and A. Voronkov},
  crossref = {cav13},
  pages = {1-35}
}

@inproceedings{kowalski74a,
  title = {Predicate Logic as Programming Language},
  author = {R. Kowalski},
  booktitle = {Proceedings {IFIP} Congress},
  pages = {569-574},
  publisher = n-h,
  year = {1974}
}

@incollection{kowalski78,
  title = {Logic for data description},
  author = {R. Kowalski},
  editor = {H. Gallaire and J. Minker},
  booktitle = {Logic and Data Bases},
  pages = {77-103},
  publisher = {Plenum Press},
  year = {1978}
}

@article{kowalski79a,
  title = {Algorithm = Logic + Control},
  author = {R. Kowalski},
  journal = cacm,
  number = {7},
  pages = {424-436},
  volume = {22},
  year = {1979}
}

@article{kowkue71,
  title = {Linear Resolution with Selection Function},
  author = {R. Kowalski and D. Kuehner},
  journal = ai,
  pages = {227-260},
  volume = {2},
  year = {1971}
}

@inproceedings{kowsad12a,
  title = {A Logic-Based Framework for Reactive Systems},
  author = {R. Kowalski and F. Sadri},
  crossref = {ruleml12},
  pages = {1-15}
}

@article{kowsad99a,
  title = {From Logic Programming Towards Multi-Agent Systems},
  author = {R. Kowalski and F. Sadri},
  journal = amai,
  number = {3-4},
  pages = {391-419},
  volume = {25},
  year = {1999}
}

@article{kowser86a,
  title = {A Logic-based Calculus of Events},
  author = {R. Kowalski and M. Sergot},
  journal = ngc,
  number = {1},
  pages = {67-95},
  volume = {4},
  year = {1986}
}

@article{koymans90a,
  title = {Specifying Real-Time Properties with Metric Temporal Logic},
  author = {R. Koymans},
  doi = {10.1007/BF01995674},
  journal = {Real-Time Systems},
  number = {4},
  pages = {255-299},
  volume = {2},
  year = {1990}
}

@article{krajewski86,
  title = {Relatedness Logic},
  author = {S. Krajewski},
  journal = {Report on Mathematical Logic},
  pages = {7-14},
  volume = {20},
  year = {1986}
}

@inproceedings{kramosil75,
  title = {A note on deduction rules with negative premises},
  author = {I. Kramosil},
  booktitle = ijcai,
  pages = {53-56},
  year = {1975}
}

@article{krentel88a,
  title = {The Complexity of Optimization Problems},
  author = {M. Krentel},
  journal = jcss,
  number = {3},
  pages = {490-509},
  volume = {36},
  year = {1988}
}

@article{krhuabfifimascsty09a,
  title = {The new Dutch timetable: The {OR} revolution},
  author = {L. Kroon and D. Huisman and E. Abbink and P. Fioole and M. Fischetti and G. Mar{\'o}ti and A. Schrijver and A. Steenbeek and R. Ybema},
  journal = {Interfaces},
  number = {1},
  pages = {6-17},
  publisher = {INFORMS},
  volume = {39},
  year = {2009}
}

@article{krlema90,
  title = {Nonmonotonic Reasoning, Preferential Models and Macro Generations},
  author = {S. Kraus and D. Lehmann and M. Magidor},
  journal = ai,
  number = {1-2},
  pages = {167-208},
  volume = {44},
  year = {1990}
}

@incollection{kroening09a,
  title = {Software Verification},
  author = {D. Kroening},
  chapter = {16},
  crossref = {SATHandbook},
  pages = {505-532}
}

@article{kroysa97a,
  title = {Monotonic Aggregation in Deductive Databases},
  author = {K. Ross and Y. Sagiv},
  journal = jcss,
  number = {1},
  pages = {79-97},
  volume = {54},
  year = {1997}
}

@article{kubec19a,
  title = {Mixed Integer Programming Models for Job Shop Scheduling: A Computational Analysis},
  author = {W. Ku and J. Beck},
  journal = {Computers \& Operations Research},
  pages = {165-173},
  volume = {73},
  year = {2016}
}

@inproceedings{kugapa01a,
  title = {Circuit-based {B}oolean Reasoning},
  author = {A. Kuehlmann and M. Ganai and V. Paruthi},
  crossref = {dac01},
  pages = {232-237}
}

@book{kuipers94a,
  title = {Qualitative reasoning. Modeling and simulation with incomplete knowledge},
  author = {B. Kuipers},
  publisher = {MIT Press},
  year = {1994}
}

@article{kumar92,
  title = {Algorithms for Constraint-Satisfaction Problems: A Survey},
  author = {V. Kumar},
  journal = aim,
  number = {1},
  pages = {32-44},
  volume = {13},
  year = {1992}
}

@inproceedings{kumdel09a,
  title = {Optimal Multicore Scheduling: An Application of {ASP} Techniques},
  author = {V. Kumar and J. Delgrande},
  crossref = {lpnmr09},
  pages = {604-609}
}

@phdthesis{kurfess89,
  title = {Parallelism in Logic. Its Potential for Performance and Program Development},
  author = {F. Kurfe{\ss}.},
  keywords = {Parallelism},
  school = tum,
  year = {1989}
}

@article{kurrij97a,
  title = {Bisimulations for Temporal Logic},
  author = {N. Kurtonina and M. de Rijke},
  journal = {Journal of Logic, Language and Information},
  number = {4},
  pages = {403-425},
  volume = {6},
  year = {1997}
}

@article{kuthzi05a,
  title = {Modular Design Space Exploration Framework for Embedded Systems},
  author = {S. K{\"u}nzli and L. Thiele and E. Zitzler},
  journal = {IEEE Proceedings Computers and Digital Techniques},
  number = {2},
  pages = {183-192},
  volume = {152},
  year = {2005}
}

@inproceedings{kuxuhole09a,
  title = {{SATenstein}: Automatically Building Local Search {SAT} Solvers from Components},
  author = {A. KhudaBukhsh and L. Xu and H. Hoos and K. Leyton-Brown},
  crossref = {ijcai09},
  pages = {517-524}
}

@article{kuxuhole16a,
  title = {{SATenstein}: Automatically Building Local Search {SAT} Solvers from Components},
  author = {A. KhudaBukhsh and L. Xu and H. Hoos and K. Leyton-Brown},
  journal = ai,
  pages = {20-42},
  volume = {232},
  year = {2016}
}

@inproceedings{kvhedo08a,
  title = {A Temporal Logic-Based Planning and Execution Monitoring System},
  author = {J. Kvarnstr{\"o}m and F. Heintz and P. Doherty},
  crossref = {icaps08},
  pages = {198-205}
}

@inproceedings{lagesc24a,
  title = {Equipment Condition-Integrated Predictive Modeling for Optimized Scheduling of Ion Implantation in Semiconductor Manufacturing},
  author = {A. Laber and M. Gebser and K. Schekotihin},
  crossref = {ecai24},
  pages = {4508-4515}
}

@inproceedings{lagescya22a,
  title = {Predicting Ion Beam Tuning Success in Semiconductor Manufacturing},
  author = {A. Laber and M. Gebser and K. Schekotihin and Y. Yang},
  editor = {J. Marek and D. Donoval and E. Vavrinsky},
  booktitle = {Proceedings of the Fourteenth International Conference on Advanced Semiconductor Devices and Microsystems (ASDAM'22)},
  optpages = {},
  publisher = ieee,
  year = {2022}
}

@article{lahegi08a,
  title = {A logical approach to efficient {M}ax-{SAT} solving},
  author = {J. Larrosa and F. Heras and S. de Givry},
  journal = ai,
  number = {2-3},
  pages = {204-233},
  volume = {172},
  year = {2008}
}

@phdthesis{laitinen14a,
  title = {Extending {SAT} Solver with Parity Reasoning},
  author = {T. Laitinen},
  month = nov,
  school = {Aalto University},
  type = {Dissertation},
  year = {2014}
}

@inproceedings{lajuni12a,
  title = {Conflict-driven {XOR}-clause learning},
  author = {T. Laitinen and T. Junttila and I. Niemel{\"a}},
  crossref = {sat12},
  pages = {383-396}
}

@inproceedings{lajuni12b,
  title = {Extending Clause Learning {SAT} Solvers with Complete Parity Reasoning},
  author = {T. Laitinen and T. Junttila and I. Niemel{\"a}},
  crossref = {ictai12},
  pages = {65-72},
  year = {2012}
}

@inproceedings{lajuni13,
  title = {Simulating Parity Reasoning},
  author = {T. Laitinen and T. Junttila and I. Niemel{\"a}},
  crossref = {lpar13},
  pages = {568-583}
}

@inproceedings{lakemeyer91,
  title = {On the Relation between Explicit and Implicit Belief},
  author = {G. Lakemeyer},
  crossref = {kr91}
}

@article{laliso84a,
  title = {Alternating pushdown and stack automata},
  author = {R. Ladner and R. Lipton and L Stockmeyer},
  doi = {10.1137/0213010},
  journal = sicomp,
  number = {1},
  pages = {135-155},
  publisher = {SIAM},
  volume = {13},
  year = {1984}
}

@article{lang04a,
  title = {Logical Preference Representation and Combinatorial Vote},
  author = {J. Lang},
  journal = amai,
  number = {1-3},
  pages = {37-71},
  volume = {42},
  year = {2004}
}

@article{lange05a,
  title = {A quick axiomatisation of {LTL} with past},
  author = {M. Lange},
  journal = {Mathematical Logic Quarterly},
  number = {1},
  pages = {83-88},
  volume = {51},
  year = {2005}
}

@inproceedings{laniol06a,
  title = {{SMT} Techniques for Fast Predicate Abstraction},
  author = {S. Lahiri and R. Nieuwenhuis and A. Oliveras},
  crossref = {cav06},
  pages = {424-437}
}

@inproceedings{lanmar02a,
  title = {Resolving inconsistencies by variable forgetting},
  author = {J. Lang and P. Marquis},
  crossref = {kr02},
  pages = {239-250}
}

@article{laroshvi18a,
  title = {{IBM} {ILOG} {CP} Optimizer for Scheduling -- 20+ Years of Scheduling with Constraints at {IBM/ILOG}},
  author = {P. Laborie and J. Rogerie and P. Shaw and P. Vil{\'\i}m},
  journal = {Constraints},
  number = {2},
  pages = {210-250},
  volume = {23},
  year = {2018}
}

@inproceedings{larubr14a,
  title = {Inductive Learning of Answer Set Programs},
  author = {M. Law and A. Russo and K. Broda},
  crossref = {jelia14},
  pages = {311-325}
}

@article{lasctrwi12a,
  title = {{SWI-Prolog}},
  author = {T. Lager and T. Schrijvers and M .Triska and J. Wielemaker},
  journal = tplp,
  number = {1-2},
  pages = {67-96},
  volume = {12},
  year = {2012}
}

@article{laubsch89,
  title = {Einf{\"u}hrung: Zum Gegenstand einer Theorie der Wissensdarstellung},
  author = {J. Laubsch},
  journal = {Informationstechnik},
  number = {2},
  pages = {95-101},
  volume = {31},
  year = {1989}
}

@inproceedings{lealmi09a,
  title = {Resource allocation with answer-set programming},
  author = {J. Leite and J. Alferes and B. Mito},
  crossref = {aamas09},
  pages = {649-656}
}

@book{leasombe90,
  title = {Reasoning about incomplete information in Artificial Intelligence},
  author = {L. Somb{\'e}},
  address = {New York},
  publisher = wiley,
  year = {1990}
}

@article{lebascbi92,
  title = {{\sc Setheo}: A High-Performance Theorem Prover},
  author = {R. Letz and S. Bayerl and J. Schumann and W. Bibel},
  journal = jar,
  number = {2},
  pages = {183-212},
  volume = {8},
  year = {1992}
}

@article{lebestga17a,
  title = {{ASPeRiX}, a First-Order Forward Chaining Approach for Answer Set Computing},
  author = {C. Lef{\`e}vre and C. B{\'e}atrix and I. St{\'e}phan and L. Garcia},
  journal = tplp,
  number = {3},
  pages = {266-310},
  volume = {17},
  year = {2017}
}

@misc{leckah18a,
  title = {A survey of advances in epistemic logic program solvers},
  author = {A. Leclerc and P. Kahl},
  archiveprefix = {arXiv},
  eprint = {1809.07141},
  primaryclass = {cs.AI},
  year = {2018}
}

@inproceedings{lee05a,
  title = {A Model-Theoretic Counterpart of Loop Formulas},
  author = {J. Lee},
  crossref = {ijcai05},
  pages = {503-508}
}

@phdthesis{lee05b,
  title = {Automated reasoning about actions},
  author = {J. Lee},
  school = {Department of Computer Sciences, University of Texas at Austin},
  year = {2005}
}

@inproceedings{lee08a,
  title = {A Reductive Semantics for Counting and Choice in Answer Set Programming},
  author = {J. Lee and V. Lifschitz and R. Palla},
  crossref = {aaai08},
  pages = {472-479}
}

@inproceedings{leelif03a,
  title = {Loop Formulas for Disjunctive Logic Programs},
  author = {J. Lee and V. Lifschitz},
  crossref = {iclp03},
  pages = {451-465}
}

@inproceedings{leelif03b,
  title = {Describing Additive Fluents in Action Language {C}+},
  author = {J. Lee and V. Lifschitz},
  crossref = {ijcai03},
  pages = {1079-1084}
}

@inproceedings{leemen08a,
  title = {On Loop Formulas with Variables},
  author = {J. Lee and Y. Meng},
  crossref = {kr08},
  pages = {444-453}
}

@inproceedings{leemen09a,
  title = {On Reductive Semantics of Aggregates in Answer Set Programming},
  author = {J. Lee and Y. Meng},
  crossref = {lpnmr09},
  pages = {182-195}
}

@article{leemen11a,
  title = {First-Order Stable Model Semantics and First-Order Loop Formulas},
  author = {J. Lee and Y. Meng},
  journal = jair,
  pages = {125-180},
  volume = {42},
  year = {2011}
}

@inproceedings{leemen12a,
  title = {Stable Models of Formulas with Generalized Quantifiers (Preliminary Report)},
  author = {J. Lee and Y. Meng},
  crossref = {iclp-lipics12},
  pages = {61-71}
}

@inproceedings{leemen13a,
  title = {Answer Set Programming Modulo Theories and Reasoning about Continuous Changes},
  author = {J. Lee and Y. Meng},
  crossref = {ijcai13},
  pages = {990-996}
}

@inproceedings{leepal09a,
  title = {System f2lp - Computing Answer Sets of First-Order Formulas},
  author = {J. Lee and R. Palla},
  crossref = {lpnmr09},
  pages = {515-521}
}

@article{leepal12a,
  title = {Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming},
  author = {J. Lee and R. Palla},
  journal = jair,
  pages = {571-620},
  volume = {43},
  year = {2012}
}

@inproceedings{lefasopo18a,
  title = {{EFP} and {PG-EFP:} Epistemic Forward Search Planners in Multi-Agent Domains},
  author = {T. Le and F. Fabiano and T. Son and E. Pontelli},
  crossref = {icaps18},
  pages = {161-170}
}

@inproceedings{lefnic09a,
  title = {The First Version of a New {ASP} Solver : {ASPeRiX}},
  author = {C. Lef{\`e}vre and P. Nicolas},
  crossref = {lpnmr09},
  pages = {522-527}
}

@book{leite03a,
  title = {Evolving Knowledge Bases},
  author = {J. Leite},
  publisher = ios,
  series = {Frontiers of Artificial Intelligence and Applications},
  volume = {81},
  year = {2003}
}

@inproceedings{lelipa08a,
  title = {Safe Formulas in the General Theory of Stable Models (Preliminary Report)},
  author = {J. Lee and V. Lifschitz and R. Palla},
  crossref = {iclp08},
  pages = {672-676}
}

@inproceedings{lelipa08b,
  title = {A Reductive Semantics for Counting and Choice in Answer Set Programming},
  author = {J. Lee and V. Lifschitz and R. Palla},
  crossref = {aaai08},
  pages = {472-479}
}

@inproceedings{leliya13a,
  title = {Action Language {BC}: Preliminary Report},
  author = {J. Lee and V. Lifschitz and F. Yang},
  crossref = {ijcai13},
  pages = {983-989}
}

@article{lemago94a,
  title = {Controlled Integrations of the Cut Rule into Connection Tableau Calculi},
  author = {R. Letz and K. Mayr and C. Goller},
  journal = jar,
  number = {3},
  pages = {297-338},
  volume = {13},
  year = {1994}
}

@inproceedings{leme12a,
  title = {Stable Models of Formulas with Generalized Quantifiers (Preliminary Report)},
  author = {J. Lee and Y. Meng},
  crossref = {iclp-lipics12},
  pages = {61-71}
}

@article{lenush09a,
  title = {Empirical hardness models: Methodology and a case study on combinatorial auctions},
  author = {K. Leyton-Brown and E. Nudelman and Y. Shoham},
  journal = jacm,
  number = {4},
  pages = {1-52},
  publisher = acm,
  volume = {56},
  year = {2009}
}

@inproceedings{lepesc01a,
  title = {Improving {ASP} Instantiators by Join-Ordering Methods},
  author = {N. Leone and S. Perri and F. Scarcello},
  crossref = {lpnmr01},
  pages = {280-294}
}

@inproceedings{lepesc04a,
  title = {Backjumping techniques for rules instantiation in the {DLV} system},
  author = {N. Leone and S. Perri and F. Scarcello},
  crossref = {nmr04},
  pages = {258-266}
}

@article{lepire98a,
  title = {Foundations for the Situation Calculus},
  author = {H. Levesque and F. Pirri and R. Reiter},
  journal = etai,
  pages = {159-178},
  volume = {2},
  year = {1998}
}

@inproceedings{lepon05a,
  title = {An Investigation of Sharing Strategies for Answer Set Solvers and {SAT} Solvers},
  author = {H. Le and E. Pontelli},
  editor = {J. Cunha and P. Medeiros},
  booktitle = {Proceedings of the Eleventh International Euro-Par Conference},
  pages = {750-760},
  publisher = springer,
  series = lncs,
  volume = {3648},
  year = {2005}
}

@article{lereleli97a,
  title = {{GOLOG}: A Logic Programming Language for Dynamic Domains.},
  author = {H. Levesque and R. Reiter and Y. Lesp{\'e}rance and F. Lin and R. Scherl},
  doi = {10.1016/S0743-1066(96)00121-5},
  journal = jlp,
  number = {1-3},
  pages = {59-83},
  volume = {31},
  year = {1997}
}

@article{lerusc97a,
  title = {Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation},
  author = {N. Leone and P. Rullo and F. Scarcello},
  journal = {Information and Computation},
  number = {2},
  pages = {69-112},
  volume = {135},
  year = {1997}
}

@techreport{lescba89,
  title = {SETHEO --- A Sequential Theorem Prover for First-Order Logic},
  author = {R. Letz and J. Schumann and S. Bayerl},
  institution = {Technische Universit{\"a}t M{\"u}nchen},
  number = {FKI-97-89},
  type = {Report},
  year = {1989}
}

@inproceedings{lescbe05a,
  title = {Speedup Techniques Utilized in Modern {SAT} Solvers},
  author = {M. Lewis and T. Schubert and B. Becker},
  crossref = {sat05},
  pages = {437-443}
}

@inproceedings{lescbe07a,
  title = {Multithreaded {SAT} Solving},
  author = {M. Lewis and T. Schubert and B. Becker},
  booktitle = {Proceedings of the Twelfth Asia and South Pacific Design Automation Conference (ASP-DAC'07)},
  pages = {926-931},
  year = {2007}
}

@inproceedings{lesopoye15a,
  title = {Solving Distributed Constraint Optimization Problems Using Logic Programming},
  author = {T. Le and T. Son and E. Pontelli and W. Yeoh},
  crossref = {aaai15},
  pages = {1174-1181}
}

@article{lesopoye17a,
  title = {Solving distributed constraint optimization problems using logic programming},
  author = {T. Le and T. Son and E. Pontelli and W. Yeoh},
  journal = tplp,
  number = {4},
  pages = {634-683},
  volume = {17},
  year = {2017}
}

@article{letmar12a,
  title = {Hybrid Incremental Algorithms for Boolean Satisfiability},
  author = {F. Letombe and J. Marques-Silva},
  journal = {International Journal on Artificial Intelligence Tools},
  number = {6},
  volume = {21},
  year = {2012}
}

@article{letste07a,
  title = {The Disconnection Tableau Calculus},
  author = {R. Letz and G. Stenz},
  journal = jar,
  number = {1-3},
  pages = {79-126},
  volume = {38},
  year = {2007}
}

@inproceedings{letz02a,
  title = {Lemma and Model Caching in Decision Procedures for Quantified {B}oolean Formulas},
  author = {R. Letz},
  crossref = {tableaux02},
  pages = {160-175}
}

@techreport{letz89,
  title = {Classical Negation in Logic Programming},
  author = {R. Letz},
  address = tum-adr,
  institution = tum,
  number = {123-89},
  type = {FKI},
  year = {1989}
}

@phdthesis{letz93,
  title = {First-Order Calculi and Proof Procedures for Automated Deduction},
  author = {R. Letz},
  school = {TH Darmstadt},
  year = {1993}
}

@phdthesis{letz93a,
  title = {First-Order Calculi and Proof Procedures for Automated Deduction},
  author = {R. Letz},
  school = thd,
  year = {1993}
}

@phdthesis{levesque81a,
  title = {A Formal Treatment of Incomplete Knowledge Bases},
  author = {H. Levesque},
  school = {Department of Computer Science, Univerity of Toronto},
  year = {1981}
}

@inproceedings{levesque81b,
  title = {The Interaction with Incomplete Knowledge Bases: A Formal Treatment},
  author = {H. Levesque},
  booktitle = ijcai,
  pages = {240-245},
  year = {1981}
}

@article{levesque84a,
  title = {Foundations of a Functional Approach to Knowledge Representation},
  author = {H. Levesque},
  journal = ai,
  pages = {155-212},
  volume = {23},
  year = {1984}
}

@inproceedings{levesque84b,
  title = {A Logic of Implicit and Explicit Belief},
  author = {H. Levesque},
  booktitle = {Proceedings of the National Conference on Artificial Intelligence},
  pages = {198-202},
  publisher = {Morgan Kaufman},
  year = {1984}
}

@article{levesque86,
  title = {Knowledge Representation and Reasoning},
  author = {H. Levesque},
  journal = {Annual Review of Computer Science},
  pages = {255-288},
  volume = {1},
  year = {1986}
}

@article{levesque88,
  title = {Logic and the Complexity of Reasoning},
  author = {H. Levesque},
  journal = {Journal of Philosophical Logic},
  pages = {355-389},
  volume = {17},
  year = {1988}
}

@inproceedings{levesque89a,
  title = {A Knowledge-Level Account of Abduction},
  author = {H. Levesque},
  booktitle = ijcai,
  pages = {1061-1067},
  publisher = m-k,
  year = {1989}
}

@techreport{levesque89b,
  title = {All {I} Know: A Study in Autoepistemic Logic},
  author = {H. Levesque},
  address = {Toronto, Canada},
  institution = {University of Toronto},
  type = {Technical Report},
  year = {1989}
}

@article{levesque90,
  title = {All {I} Know: A Study in Autoepistemic Logic},
  author = {H. Levesque},
  journal = ai,
  number = {2-3},
  pages = {213-261},
  volume = {42},
  year = {1990}
}

@inproceedings{levesque96a,
  title = {What Is Planning in the Presence of Sensing?},
  author = {H. Levesque},
  crossref = {aaai96},
  pages = {1139-1146}
}

@incollection{levlak08a,
  title = {Cognitive robotics},
  author = {H. Levesque and G. Lakemeyer},
  crossref = {KRHandbook},
  pages = {869-886}
}

@inproceedings{levy91,
  title = {Computing Extensions of Default Theories},
  author = {F. L{\'e}vy},
  editor = {R. Kruse and P. Siegel},
  booktitle = {Proceedings of the European Conference on Symbolic and Quantitative Approaches for Uncertainty},
  pages = {219-226},
  publisher = springer,
  series = lncs,
  volume = {548},
  year = {1991}
}

@inproceedings{lewalja20a,
  title = {An Answer Set Programming Approach to Argumentative Reasoning in the {ASPIC+} Framework},
  author = {T. Lehtonen and J. Wallner and M. J{\"a}rvisalo},
  crossref = {kr20},
  pages = {636-646}
}

@inproceedings{li12a,
  title = {Qualitative Spatial and Temporal Reasoning with Answer Set Programming},
  author = {J. Li},
  crossref = {ictai12},
  doi = {10.1109/ICTAI.2012.87},
  pages = {603-609}
}

@inproceedings{lian97a,
  title = {Heuristics Based on Unit Propagation for Satisfiability Problems},
  author = {C. Li and Anbulagan},
  crossref = {ijcai97},
  pages = {366-371}
}

@inproceedings{lianko02a,
  title = {More on \texttt{nomore}},
  author = {T. Linke and C. Anger and K. Konczak},
  crossref = {jelia02},
  pages = {468-480}
}

@article{libsch97b,
  title = {Arbitration (or how to merge knowledge bases)},
  author = {P. Liberatore and M. Schaerf},
  journal = tkde,
  number = {1},
  pages = {76-90},
  volume = {10},
  year = {1998}
}

@misc{lichmann13a,
  title = {{UCI} Machine Learning Repository},
  author = {M. Lichman},
  url = {http://archive.ics.uci.edu/ml},
  year = {2013}
}

@inproceedings{liehip19a,
  title = {Automatic Program Rewriting in Non-Ground Answer Set Programs},
  author = {Y. Lierler and N. Hippen},
  crossref = {padl19},
  pages = {19-36}
}

@inproceedings{lielif09a,
  title = {One More Decidable Class of Finitely Ground Programs},
  author = {Y. Lierler and V. Lifschitz},
  crossref = {iclp09},
  pages = {489-493}
}

@inproceedings{liemar04a,
  title = {Cmodels-2: {SAT}-based Answer Sets Solver Enhanced to Non-tight Programs},
  author = {Y. Lierler and M. Maratea},
  crossref = {lpnmr04},
  pages = {346-350}
}

@inproceedings{lierler05a,
  title = {cmodels - {SAT}-Based Disjunctive Answer Set Solver},
  author = {Y. Lierler},
  crossref = {lpnmr05},
  pages = {447-451}
}

@article{lierler10a,
  title = {Abstract Answer Set Solvers with Learning},
  author = {Y. Lierler},
  journal = tplp,
  number = {2-3},
  pages = {135-169},
  volume = {11},
  year = {2011}
}

@article{lierler14a,
  title = {Relating constraint answer set programming languages and algorithms},
  author = {Y. Lierler},
  doi = {10.1016/j.artint.2013.10.004},
  journal = ai,
  pages = {1-22},
  volume = {207},
  year = {2014}
}

@article{lierler23a,
  title = {Constraint Answer Set Programming: Integrational and Translational (or {SMT}-based) Approaches},
  author = {Y. Lierler},
  doi = {10.1017/S1471068421000478},
  journal = tplp,
  number = {1},
  pages = {195-225},
  volume = {23},
  year = {2023}
}

@inproceedings{liesus16a,
  title = {{SMT}-Based Constraint Answer Set Solver {EZSMT} (System Description)},
  author = {Y. Lierler and B. Susman},
  crossref = {iclp-lipics16},
  doi = {10.4230/OASICS.ICLP.2016.1},
  pages = {1:1-1:15}
}

@article{liesus17a,
  title = {On Relation Between Constraint Answer Set Programming and Satisfiability Modulo Theories},
  author = {Y. Lierler and B. Susman},
  journal = tplp,
  number = {4},
  pages = {559-590},
  volume = {17},
  year = {2017}
}

@inproceedings{lifali13a,
  title = {Reasoning about State Constraints in the Situation Calculus},
  author = {N. Li and Y. Fan and Y. Liu},
  crossref = {ijcai13},
  pages = {997-1003}
}

@inproceedings{lifran06a,
  title = {A Modular Action Description Language},
  author = {V. Lifschitz and W. Ren},
  crossref = {aaai06},
  pages = {853-859}
}

@article{lifraz04a,
  title = {Why Are There So Many Loop Formulas?},
  author = {V. Lifschitz and A. Razborov},
  journal = tocl,
  number = {2},
  pages = {261-268},
  volume = {7},
  year = {2006}
}

@article{lifschitz02a,
  title = {Answer set programming and plan generation},
  author = {V. Lifschitz},
  journal = ai,
  number = {1-2},
  pages = {39-54},
  volume = {138},
  year = {2002}
}

@unpublished{lifschitz04a,
  title = {Introduction to answer set programming},
  author = {V. Lifschitz},
  note = {Unpublished draft},
  url = {http://www.cs.utexas.edu/users/vl/papers/esslli.ps},
  year = {2004}
}

@inproceedings{lifschitz08a,
  title = {Twelve Definitions of a Stable Model},
  author = {V. Lifschitz},
  crossref = {iclp08},
  pages = {37-51}
}

@inproceedings{lifschitz08b,
  title = {What Is Answer Set Programming?},
  author = {V. Lifschitz},
  crossref = {aaai08},
  pages = {1594-1597}
}

@inproceedings{lifschitz10a,
  title = {Thirteen Definitions of a Stable Model},
  author = {V. Lifschitz},
  crossref = {gurevich70},
  doi = {10.1007/978-3-642-15025-8\_24},
  pages = {488-503}
}

@inproceedings{lifschitz12a,
  title = {Logic Programs with Intensional Functions},
  author = {V. Lifschitz},
  crossref = {kr12},
  year = {2012}
}

@article{lifschitz16a,
  title = {Answer Sets and the Language of Answer Set Programming},
  author = {V. Lifschitz},
  journal = aim,
  number = {3},
  pages = {7-12},
  volume = {37},
  year = {2016}
}

@article{lifschitz17a,
  title = {Achievements in Answer Set Programming},
  author = {V. Lifschitz},
  journal = tplp,
  number = {5-6},
  pages = {961-973},
  volume = {17},
  year = {2017}
}

@book{lifschitz19a,
  title = {Answer Set Programming},
  author = {V. Lifschitz},
  doi = {10.1007/978-3-030-24658-7},
  publisher = springer,
  year = {2019}
}

@inproceedings{lifschitz21a,
  title = {Transforming Gringo Rules into Formulas in a Natural Way},
  author = {V. Lifschitz},
  crossref = {jelia21},
  pages = {421-434},
  year = {2021}
}

@article{lifschitz21b,
  title = {Here and There with Arithmetic},
  author = {V. Lifschitz},
  journal = tplp,
  number = {6},
  pages = {735-749},
  volume = {21},
  year = {2021}
}

@article{lifschitz22a,
  title = {Strong Equivalence of Logic Programs with Counting},
  author = {V. Lifschitz},
  journal = tplp,
  number = {4},
  pages = {573-588},
  volume = {22},
  year = {2022}
}

@inproceedings{lifschitz84,
  title = {Some Results on Circumscription},
  author = {V. Lifschitz},
  booktitle = {Proceedings of the First International Workshop on Nonmonotonic Reasoning (NMR'84)},
  year = {1984}
}

@article{lifschitz85a,
  title = {Closed-World Databases and Circumscription},
  author = {V. Lifschitz},
  journal = ai,
  pages = {229-235},
  volume = {27},
  year = {1985}
}

@inproceedings{lifschitz85b,
  title = {Computing Circumscription},
  author = {V. Lifschitz},
  editor = {A. Joshi},
  booktitle = ijcai,
  pages = {121-127},
  publisher = m-k,
  year = {1985}
}

@article{lifschitz86,
  title = {On the Satisfiabiltity of Circumscription},
  author = {V. Lifschitz},
  journal = ai,
  pages = {17-27},
  volume = {28},
  year = {1986}
}

@incollection{lifschitz87,
  title = {Pointwise Circumscription},
  author = {V. Lifschitz},
  editor = {M. Ginsberg},
  booktitle = {Readings in Nonmonotonic Reasoning},
  chapter = {3.3},
  pages = {179-193},
  publisher = {Morgan Kaufman},
  year = {1987}
}

@misc{lifschitz88,
  title = {Between Circumscription and Autoepistemic Logic},
  author = {V. Lifschitz},
  howpublished = {Stanford University},
  keywords = {modification of circumscription, autoepistemic logic, nonmonotonic reasoning},
  note = {Draft},
  origin = {wb_1/90},
  year = {1988}
}

@inproceedings{lifschitz89,
  title = {Between Circumscription and Autoepitemic Logic},
  author = {V. Lifschitz},
  crossref = {kr89},
  pages = {235-244}
}

@inproceedings{lifschitz90,
  title = {On Open Defaults},
  author = {V. Lifschitz},
  editor = {J. Lloyd},
  booktitle = {Computational Logic},
  pages = {80-95},
  publisher = springer,
  year = {1990}
}

@inproceedings{lifschitz91a,
  title = {Toward a Metatheory of Action},
  author = {V. Lifschitz},
  crossref = {kr91}
}

@inproceedings{lifschitz91b,
  title = {Nonmonotonic Databases and Epistemic Queries},
  author = {V. Lifschitz},
  editor = {J. Myopoulos and R. Reiter},
  booktitle = ijcai,
  pages = {381-386},
  publisher = m-k,
  year = {1991}
}

@article{lifschitz94a,
  title = {Minimal Belief and Negation as Failure},
  author = {V. Lifschitz},
  journal = ai,
  pages = {53-72},
  volume = {70},
  year = {1994}
}

@incollection{lifschitz94b,
  title = {Circumscription},
  author = {V. Lifschitz},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  booktitle = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  pages = {298-352},
  publisher = {Oxford University Press},
  volume = {3},
  year = {1994}
}

@incollection{lifschitz96a,
  title = {Foundations of logic programming},
  author = {V. Lifschitz},
  editor = {G. Brewka},
  booktitle = {Principles of Knowledge Representation},
  pages = {69-127},
  publisher = {CSLI Publications},
  year = {1996}
}

@inproceedings{lifschitz98a,
  title = {Situation calculus and causal logic},
  author = {V. Lifschitz},
  crossref = {kr98},
  pages = {536-646}
}

@incollection{lifschitz99a,
  title = {Action languages, answer sets, and planning},
  author = {V. Lifschitz},
  editor = {K. Apt and V. Marek and M. Truszczy{\'n}ski and D. Warren},
  booktitle = {The Logic Programming Paradigm: a 25-Year Perspective},
  pages = {357-373},
  publisher = springer,
  year = {1999}
}

@inproceedings{lifschitz99b,
  title = {Answer set planning},
  author = {V. Lifschitz},
  editor = {D. de Schreye},
  booktitle = {Proceedings of the International Conference on Logic Programming (ICLP'99)},
  pages = {23-37},
  publisher = {MIT Press},
  year = {1999}
}

@incollection{lifschitz99c,
  title = {Success of Default Logic},
  author = {V. Lifschitz},
  editor = {H. Levesque and F. Pirri},
  booktitle = {Logical Foundations for Cognitive Agents: Contributions in Honour of Ray Reiter},
  pages = {357-373},
  publisher = springer,
  url = {http://www.cs.utexas.edu/users/vl/mypapers/deflog.ps},
  year = {1999}
}

@misc{lifschitz:xx,
  title = {Reflections on Circumscription},
  author = {V. Lifschitz},
  howpublished = {University of Texas at El Paso},
  keywords = {automated reasoning; circumscription; nonmonotonic reasoning},
  origin = {bibel_2}
}

@inproceedings{liftur94a,
  title = {Splitting a logic program},
  author = {V. Lifschitz and H. Turner},
  booktitle = {Proceedings of the Eleventh International Conference on Logic Programming},
  pages = {23-37},
  publisher = {MIT Press},
  year = {1994}
}

@inproceedings{liftur99a,
  title = {Representing Transition Systems by Logic Programs},
  author = {V. Lifschitz and H. Turner},
  crossref = {lpnmr99},
  pages = {92-106}
}

@inproceedings{lifwoo92a,
  title = {Answer Sets in General Nonmonotonic Reasoning (Preliminary Report)},
  author = {V. Lifschitz and T. Woo},
  crossref = {kr92},
  pages = {603-614}
}

@article{lihohusc15a,
  title = {{AutoFolio}: An Automatically Configured Algorithm Selector},
  author = {M. Lindauer and H. Hoos and F. Hutter and T. Schaub},
  journal = jair,
  pages = {745-778},
  volume = {53},
  year = {2015}
}

@article{liholesc17a,
  title = {Automatic construction of parallel portfolios via algorithm configuration},
  author = {M. Lindauer and H. Hoos and K. Leyton-Brown and T. Schaub},
  journal = ai,
  pages = {272-290},
  volume = {244},
  year = {2017}
}

@inproceedings{lijani12a,
  title = {Answer Set Programming via Mixed Integer Programming},
  author = {G. Liu and T. Janhunen and I. Niemel{\"a}},
  crossref = {kr12},
  pages = {32-42}
}

@article{lijiko11a,
  title = {Dynamics of argumentation systems: A division-based method},
  author = {B. Liao and L. Jin and R. Koons},
  journal = ai,
  number = {11},
  pages = {1790-1814},
  volume = {175},
  year = {2011}
}

@inproceedings{lilusc18a,
  title = {anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report)},
  author = {V. Lifschitz and P. L{\"u}hne and T. Schaub},
  crossref = {aspocp18}
}

@inproceedings{lilusc19a,
  title = {Verifying Strong Equivalence of Programs in the Input Language of {GRINGO}},
  author = {V. Lifschitz and P. L{\"u}hne and T. Schaub},
  crossref = {lpnmr19},
  pages = {270-283}
}

@inproceedings{lilusc20a,
  title = {Towards Verifying Logic Programs in the Input Language of {CLINGO}},
  author = {V. Lifschitz and P. L{\"u}hne and T. Schaub},
  crossref = {gurevich80},
  pages = {190-209}
}

@incollection{liman09a,
  title = {Max{SAT}},
  author = {C. Li and F. Many{\`a}},
  chapter = {19},
  crossref = {SATHandbook},
  pages = {613-631}
}

@article{limapl07a,
  title = {New inference rules for {M}ax-{SAT}},
  author = {C. Li and F. Many{\`a} and J. Planes},
  journal = jair,
  pages = {321-359},
  volume = {30},
  year = {2007}
}

@article{limari16a,
  title = {Systems, Engineering Environments, and Competitions},
  author = {Y. Lierler and M. Maratea and F. Ricca},
  journal = aim,
  number = {3},
  pages = {45-52},
  volume = {37},
  year = {2016}
}

@inproceedings{lin04a,
  title = {Discovering State Invariants},
  author = {F. Lin},
  crossref = {kr04},
  pages = {536-544}
}

@inproceedings{lin87a,
  title = {Reasoning in the Presence of Inconsistency},
  author = {F. Lin},
  booktitle = aaai,
  pages = {139-143},
  publisher = aaaimit,
  year = {1987}
}

@inproceedings{lin90,
  title = {Formalizing Various Intuitions about Inheritance in Logic Programs},
  author = {F. Lin},
  crossref = {nmr90},
  pages = {177-190}
}

@phdthesis{lin91a,
  title = {A Study of Nonmonotonic Reasoning},
  author = {F. Lin},
  school = {Stanford University},
  year = {1991}
}

@inproceedings{lin95a,
  title = {Embracing causality in specifying the indirect effects of actions},
  author = {F. Lin},
  crossref = {ijcai95},
  pages = {1985-1993}
}

@inproceedings{lin96a,
  title = {Paraconsistent Circumscription},
  author = {Z. Lin},
  booktitle = {???????},
  pages = {296-???},
  publisher = springer,
  series = lncs,
  volume = {1081},
  year = {1996}
}

@article{lin96b,
  title = {A semantics for reasoning consistently in the presence of inconsistency},
  author = {J. Lin},
  journal = ai,
  number = {1-2},
  pages = {75-95},
  volume = {86},
  year = {1996}
}

@inproceedings{linjzh03a,
  title = {On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic},
  author = {F. Lin and J. Zhao},
  crossref = {ijcai03},
  pages = {853-858}
}

@inproceedings{linke01a,
  title = {Graph Theoretical Characterization and Computation of Answer Sets},
  author = {T. Linke},
  crossref = {ijcai01},
  pages = {641-645}
}

@inproceedings{linke03a,
  title = {Using Nested Logic Programs for Answer Set Programming},
  author = {T. Linke},
  crossref = {asp03},
  pages = {181-194}
}

@inproceedings{linke03b,
  title = {Suitable Graphs for Answer Set Programming},
  author = {T. Linke},
  crossref = {asp03},
  pages = {15-28}
}

@phdthesis{linke96,
  title = {New foundations for automation of default reasoning},
  author = {T. Linke},
  note = {Revised Version appeared at: Akademische Verlags-Gesellschaft, 2000},
  school = {University of Bielefeld},
  type = {Dissertation},
  year = {1999}
}

@book{linke99,
  title = {New {F}oundations for {A}utomation of {D}efault {R}easoning},
  author = {T. Linke},
  address = {Berlin},
  publisher = {Akademische Verlags-Gesellschaft Aka 2000},
  school = {University of Bielefeld},
  type = {Dissertation},
  year = {2000}
}

@inproceedings{linlo11a,
  title = {Instance-Based Parameter Tuning via Search Trajectory Similarity Clustering},
  author = {L. Lindawati and D. Lo},
  crossref = {lion11},
  pages = {131-145}
}

@incollection{linmen99a,
  title = {Knowledge base merging by majority},
  author = {J. Lin and A. Mendelzon},
  editor = {R. Pareschi and B. Fronh{\"o}fer},
  booktitle = {Dynamic Worlds: From the Frame Problem to Knowledge Management},
  pages = {195-218},
  publisher = {Kluwer},
  year = {1999}
}

@inproceedings{linsar05a,
  title = {Suitable Graphs for Answer Set Programming},
  author = {T. Linke and V. Sarsakov},
  editor = {F. Baader and A. Voronkov},
  booktitle = {Proceedings of the Eleventh International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'04)},
  pages = {154-168},
  publisher = springer,
  series = lncs,
  volume = {3452},
  year = {2004}
}

@article{linsch00a,
  title = {Alternative foundations for {R}eiter's default logic.},
  author = {T. Linke and T. Schaub},
  journal = ai,
  number = {1},
  pages = {31-86},
  volume = {124},
  year = {2000}
}

@inproceedings{linsch94a,
  title = {Lemma handling in default logic theorem provers},
  author = {T. Linke and T. Schaub},
  editor = {G. Brewka and C. Witteveen},
  booktitle = {Second Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications},
  year = {1995}
}

@inproceedings{linsch94b,
  title = {Lemma handling in default logic theorem provers},
  author = {T. Linke and T. Schaub},
  crossref = {ecsqaru95},
  pages = {285-292}
}

@inproceedings{linsch96a,
  title = {Putting default logics in perspective},
  author = {T. Linke and T. Schaub},
  editor = {G. G{\"o}rz and S. H{\"o}lldobler},
  booktitle = {Advances in Artificial Intelligence, Proceedings of the Twentieth Annual German Conference on Artificial Intelligence},
  pages = {241-252},
  publisher = springer,
  series = lnai,
  year = {1996}
}

@article{linsch96b,
  title = {Towards a Classification of Default Logics},
  author = {T. Linke and T. Schaub},
  journal = jancl,
  number = {4},
  pages = {397-451},
  volume = {7},
  year = {1997}
}

@inproceedings{linsch98a,
  title = {An approach to query-answering in {R}eiter's default logic and the underlying existence of extensions problem.},
  author = {T. Linke and T. Schaub},
  editor = {J. Dix and L. {Fari{\~n}as del Cerro} and U. Furbach},
  booktitle = {Logics in Artificial Intelligence, Proceedings of the Sixth European Workshop on Logics in Artificial Intelligence},
  pages = {233-247},
  publisher = springer,
  series = lnai,
  volume = {1489},
  year = {1998}
}

@inproceedings{linsch99a,
  title = {On bottom-up pre-processing techniques for automated default reasoning},
  author = {T. Linke and T. Schaub},
  editor = {A. Hunter and S. Parsons},
  booktitle = {Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty},
  pages = {268-278},
  publisher = springer,
  series = lnai,
  volume = {1638},
  year = {1999}
}

@techreport{linsch99b,
  title = {New foundations for reasoning with Reiter's default logic},
  author = {T. Linke and T. Schaub},
  institution = uofp,
  year = {1999}
}

@inproceedings{linsch99c,
  title = {Default Reasoning via Blocking Sets},
  author = {T. Linke and T. Schaub},
  crossref = {lpnmr99},
  pages = {247-261}
}

@inproceedings{linsho90,
  title = {Epistemic semantics for fixed-points nonmonotonic logics},
  author = {F. Lin and Y. Shoham},
  editor = {R. Parikh},
  booktitle = tarc,
  pages = {111-120},
  year = {1990}
}

@inproceedings{linwan08a,
  title = {Answer Set Programming with Functions},
  author = {F. Lin and Y. Wang},
  crossref = {kr08},
  pages = {454-465}
}

@inproceedings{linzha02a,
  title = {{ASSAT}: Computing Answer Sets of a Logic Program by {SAT} Solvers},
  author = {F. Lin and Y. Zhao},
  booktitle = aaai,
  pages = {112-118},
  publisher = aaaimit,
  year = {2002}
}

@article{linzha04a,
  title = {{ASSAT}: computing answer sets of a logic program by {SAT} solvers.},
  author = {F. Lin and Y. Zhao},
  journal = ai,
  number = {1-2},
  pages = {115-137},
  volume = {157},
  year = {2004}
}

@article{lipeva01a,
  title = {Strongly equivalent logic programs},
  author = {V. Lifschitz and D. Pearce and A. Valverde},
  doi = {10.1145/383779.383783},
  journal = tocl,
  number = {4},
  pages = {526-541},
  volume = {2},
  year = {2001}
}

@inproceedings{lipeva07a,
  title = {A Characterization of Strong Equivalence for Logic Programs with Variables},
  author = {V. Lifschitz and D. Pearce and A. Valverde},
  crossref = {lpnmr07},
  pages = {188-200}
}

@inproceedings{liposotr07a,
  title = {Logic Programs with Abstract Constraint Atoms: The Role of Computations},
  author = {L. Liu and E. Pontelli and T. Son and M. Truszczy{\'n}ski},
  crossref = {iclp07},
  pages = {286-301}
}

@article{liposotr10a,
  title = {Logic Programs with Abstract Constraint Atoms: The Role of Computations},
  author = {L. Liu and E. Pontelli and T. Son and M. Truszczy{\'n}ski},
  journal = ai,
  number = {3-4},
  pages = {295-315},
  volume = {174},
  year = {2010}
}

@inproceedings{lirasc98a,
  title = {Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)},
  author = {X. Liu and C. Ramakrishnan and S. Smolka},
  crossref = {tacas98},
  pages = {5-19}
}

@inproceedings{lisufemakuko19a,
  title = {Multi-Agent Path Finding for Large Agents},
  author = {J. Li and P. Surynek and A. Felner and H. Ma and T. Kumar and S. Koenig},
  crossref = {aaai19},
  doi = {10.1609/aaai.v33i01.33017627},
  pages = {7627-7634}
}

@article{litatu99a,
  title = {Nested Expressions in Logic Programs},
  author = {V. Lifschitz and L. Tang and H. Turner},
  journal = amai,
  number = {3-4},
  pages = {369-389},
  volume = {25},
  year = {1999}
}

@article{liulay73a,
  title = {Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment},
  author = {C. Liu and J. Layland},
  journal = jacm,
  number = {1},
  pages = {46-61},
  volume = {20},
  year = {1973}
}

@inproceedings{liutru05a,
  title = {Properties of programs with monotone and convex constraints},
  author = {L. Liu and M. Truszczy{\'n}ski},
  crossref = {aaai05},
  pages = {701-706}
}

@inproceedings{liutru05b,
  title = {Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers},
  author = {L. Liu and M. Truszczy{\'n}ski},
  crossref = {lpnmr05},
  pages = {410-415}
}

@article{liutru06a,
  title = {Properties and applications of programs with monotone and convex constraints},
  author = {L. Liu and M. Truszczy{\'n}ski},
  journal = jair,
  pages = {299-334},
  volume = {27},
  year = {2006}
}

@article{liuyou10a,
  title = {Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs},
  author = {G. Liu and J. You},
  journal = {Fundamenta Informaticae},
  number = {3},
  pages = {237-255},
  volume = {101},
  year = {2010}
}

@article{liuyou13a,
  title = {Relating Weight Constraint and Aggregate Programs: Semantics and Representation},
  author = {G. Liu and J. You},
  journal = tplp,
  number = {1},
  pages = {1-31},
  volume = {13},
  year = {2013}
}

@inproceedings{lizhhe06a,
  title = {Fast {SAT}-based Answer Set Solver},
  author = {Z. Lin and Y. Zhang and H. Hernandez},
  crossref = {aaai06},
  pages = {92-97}
}

@inproceedings{lizhpuvahe14a,
  title = {{LTL}$_f$ Satisfiability Checking},
  author = {J. Li and L. Zhang and G. Pu and M. Vardi and J. He},
  crossref = {ecai14},
  pages = {513-518}
}

@article{llotop84a,
  title = {Making {P}rolog more Expressive},
  author = {J. Lloyd and R. Topor},
  journal = jlp,
  number = {3},
  pages = {225-240},
  volume = {1},
  year = {1984}
}

@book{lloyd87,
  title = {Foundations of Logic Programming},
  author = {J. Lloyd},
  publisher = springer,
  series = {Symbolic Computation},
  year = {1987}
}

@inproceedings{lloyd94a,
  title = {Practical Advantages of Declarative Programming},
  author = {J. Lloyd},
  editor = {M. Alpuente and R. Barbuti and I. Ramos},
  booktitle = {Proceedings of the Joint Conference on Declarative Programming (GULP-PRODE'94)},
  pages = {3-17},
  publisher = {Technical University of Valencia},
  year = {1994}
}

@inproceedings{lobo07a,
  title = {Policy-Based Computing: From Systems and Applications to Theory},
  author = {J. Lobo},
  crossref = {lpnmr07},
  pages = {2}
}

@techreport{lohihascge08a,
  title = {General Game Playing: Game Description Language Specification},
  author = {N. Love and T. Hinrichs and D. Haley and E. Schkufza and M. Genesereth},
  institution = {Stanford University},
  number = {LG-2006-01},
  year = {2008}
}

@article{lokasebogekobrhorianwesmfo00a,
  title = {The {AIPS'98} Planning Competition},
  author = {D. Long and H. Kautz and B. Selman and B. Bonet and H. Geffner and J. K{\"o}hler and M. Brenner and J. Hoffmann and F. Rittinger and C. Anderson and D. Weld and D. Smith and M. Fox},
  journal = aim,
  number = {2},
  pages = {13-33},
  volume = {21},
  year = {2000}
}

@inproceedings{lometa97a,
  title = {Adding Knowledge to the Action Description Language {A}},
  author = {J. Lobo and G. Mendez and S. Taylor},
  crossref = {aaai97},
  pages = {454-459}
}

@book{lomira92,
  title = {Foundations of Disjunctive Logic Programming},
  author = {J. Lobo and J. Minker and A. Rajasekar},
  address = {Cambridge, MA},
  publisher = {MIT Press},
  year = {1992}
}

@inproceedings{lonegl17a,
  title = {{DepQBF} 6.0: {A} Search-Based {QBF} Solver Beyond Traditional {QCDCL}},
  author = {F. Lonsing and U. Egly},
  crossref = {cade17},
  pages = {371-384}
}

@inproceedings{lonegl19a,
  title = {{QRATPre+:} {E}ffective {QBF} Preprocessing via Strong Redundancy Properties},
  author = {F. Lonsing and U. Egly},
  crossref = {sat19},
  pages = {203-210}
}

@article{lontru01a,
  title = {On the Problem of Computing the Well-Founded Semantics},
  author = {Z. Lonc and M. Truszczy{\'n}ski},
  journal = tplp,
  number = {5},
  pages = {591-609},
  volume = {1},
  year = {2001}
}

@article{loon81a,
  title = {Irreducibly Inconsistent Systems of Linear Inequalities},
  author = {J. van Loon},
  journal = {European Journal of Operational Research},
  number = {3},
  pages = {283-288},
  volume = {8},
  year = {1981}
}

@inproceedings{lopawi11a,
  title = {{DEL} Planning and Some Tractable Cases},
  author = {B. L{\"o}we and E. Pacuit and A. Witzel},
  editor = {H. van Ditmarsch and J. Lang and S. Ju},
  booktitle = {Proceedings of the Third International Workshop on Logic, Rationality, and Interaction (LORI'11)},
  pages = {179-192},
  publisher = springer,
  series = lncs,
  volume = {6953},
  year = {2011}
}

@article{loveland69,
  title = {A simplified format for the model elimination theorem-proving procedure},
  author = {D. Loveland},
  journal = jacm,
  number = {3},
  pages = {349-363},
  volume = {16},
  year = {1969}
}

@article{loveland72,
  title = {A unifying view of some linear {H}erbrand procedures},
  author = {D. Loveland},
  journal = jacm,
  pages = {366-384},
  volume = {19},
  year = {1972}
}

@book{loveland78,
  title = {Automated Theorem Proving: A Logical Basis},
  author = {D. Loveland},
  publisher = {North-Holland},
  year = {1978}
}

@article{loveland86a,
  title = {Mechanical theorem proving by model elimination},
  author = {D. Loveland},
  journal = jacm,
  pages = {236-251},
  volume = {15},
  year = {1986}
}

@misc{lparseManual,
  title = {Lparse 1.0 User's Manual},
  author = {T. Syrj{\"a}nen},
  url = {http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz},
  year = {2001}
}

@book{lua06,
  title = {Programming in Lua},
  author = {R. Ierusalimschy},
  publisher = {lua.org},
  year = {2006}
}

@inproceedings{luglha07a,
  title = {SAT-Decoding in Evolutionary Algorithms for Discrete Constrained Optimization Problems},
  author = {M. Lukasiewycz and M. Gla{\ss} and C. Haubelt and J. Teich},
  booktitle = {Proceedings of the Congress on Evolutionary Computation (CEC'07)},
  pages = {935-942},
  year = {2007}
}

@inproceedings{luglha08a,
  title = {Efficient Symbolic Multi-Objective Design Space Exploration},
  author = {M. Lukasiewycz and M. Gla{\ss} and C. Haubelt and J. Teich},
  booktitle = {Proceedings of the Asia and South Pacific Design Automation Conference (ASPDAC'08)},
  pages = {691-696},
  year = {2008}
}

@inproceedings{luglhate08a,
  title = {Efficient symbolic multi-objective design space exploration},
  author = {M. Lukasiewycz and M. Gla{\ss} and C. Haubelt and J. Teich},
  booktitle = {Proceedings of the Thirteenth Asia and South Pacific Design Automation Conference (ASP-DAC'08),},
  doi = {10.1109/ASPDAC.2008.4484040},
  pages = {691-696},
  year = {2008}
}

@article{lukasiewicz41a,
  title = {Die Logik und das Grundlagenproblem},
  author = {J. Lukasiewicz},
  journal = {Les Entreties de Z{\"u}rich sur les Fondaments et la M{\'e}thode des Sciences Math{\'e}matiques},
  number = {6-9},
  pages = {82-100},
  volume = {12},
  year = {1941}
}

@inproceedings{lukaszewicz80,
  title = {Automated Theorem Proving in Non-Classical Logics Based on Possible Worlds Semantics},
  author = {W. {\L}ukaszewicz},
  booktitle = cade,
  year = {1980}
}

@inproceedings{lukaszewicz84,
  title = {Nonmonotonic Logic for Default Theories},
  author = {W. {\L}ukaszewicz},
  booktitle = ecai,
  keywords = {nonmonotonic logic},
  year = {1984}
}

@inproceedings{lukaszewicz85,
  title = {Two Results on Default Logic},
  author = {W. {\L}ukaszewicz},
  booktitle = ijcai,
  pages = {459-461},
  year = {1985}
}

@article{lukaszewicz88,
  title = {Considerations on Default Logic --- An Alternative Approach},
  author = {W. {\L}ukaszewicz},
  journal = ci,
  pages = {1-16},
  volume = {4},
  year = {1988}
}

@book{lukaszewicz90,
  title = {Non-monotonic reasoning: formalizations of commonsense reasoning},
  author = {W. {\L}ukaszewicz},
  publisher = {Ellis Horwood},
  series = ai,
  year = {1990}
}

@inproceedings{lunbek11a,
  title = {Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees},
  author = {R. Luna and K. Bekris},
  crossref = {ijcai11},
  pages = {294-300}
}

@techreport{lunepe87,
  title = {The Anatomy of the BACK System},
  author = {K. von Luck and B. Nebel and C. Peltason and A. Schmiedel},
  institution = {Projektgruppe KIT, Fachbereich Informatik, Institut f{\"u}r angewandte Informatik, Technische Universit{\"a}t Berlin},
  number = {41},
  year = {1987}
}

@article{lusizu93a,
  title = {Optimal speedup of {L}as {V}egas algorithms},
  author = {M. Luby and A. Sinclair and D. Zuckerman},
  journal = ipl,
  number = {4},
  pages = {173-180},
  volume = {47},
  year = {1993}
}

@article{lutwal05a,
  title = {{PDL} with Negation of Atomic Programs},
  author = {C. Lutz and D. Walther},
  journal = jancl,
  number = {2},
  pages = {189-213},
  volume = {15},
  year = {2005}
}

@inproceedings{luvalibemc16a,
  title = {Using Metric Temporal Logic to Specify Scheduling Problems},
  author = {R. Luo and R. Valenzano and Y. Li and J. Beck and S. McIlraith},
  crossref = {kr16},
  pages = {581-584}
}

@inproceedings{luwoza08a,
  title = {Temporal Description Logics: {A} Survey},
  author = {C. Lutz and F. Wolter and M. Zakharyaschev},
  crossref = {time08},
  pages = {3-14}
}

@article{lymar04a,
  title = {On computing minimum unsatisfiable cores},
  author = {I. Lynce and J. Marques-Silva},
  crossref = {sat04}
}

@inproceedings{lynmar02a,
  title = {Complete Unrestricted Backtracking Algorithms for Satisfiability},
  author = {I. Lynce and J. Marques-Silva},
  crossref = {sat02},
  pages = {214-221}
}

@inproceedings{lynmarm06a,
  title = {Efficient Haplotype Inference with Boolean Satisfiability.},
  author = {I. Lynce and J. Marques-Silva},
  crossref = {aaai06}
}

@inproceedings{lynmarm06b,
  title = {{SAT} in Bioinformatics: Making the Case with Haplotype Inference.},
  author = {I. Lynce and J. Marques-Silva},
  crossref = {sat06},
  pages = {136-141}
}

@article{maargrly11a,
  title = {Boolean Lexicographic Optimization: Algorithms and Applications},
  author = {J. Marques-Silva and J. Argelich and A. Gra{\c{c}}a and I. Lynce},
  journal = amai,
  number = {3-4},
  pages = {317-343},
  volume = {62},
  year = {2011}
}

@inproceedings{mabamigu12a,
  title = {Goal-directed execution of answer set programs},
  author = {K. Marple and A. Bansal and R. Min and G. Gupta},
  crossref = {ppdp12},
  pages = {35-44}
}

@inproceedings{macnish91,
  title = {Hierarchical Default Logic},
  author = {C. MacNish},
  editor = {R. Kruse and P. Siegel},
  booktitle = {Proceedings of the European Conference on Symbolic and Quantitative Approaches to Uncertainty},
  publisher = springer,
  series = lncs,
  volume = {548},
  year = {1991}
}

@inproceedings{macqueen67a,
  title = {Some Methods for Classification and Analysis of MultiVariate Observations},
  author = {J. {MacQueen}},
  editor = {L. Cam and J. Neyman},
  booktitle = {Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability},
  pages = {281-297},
  publisher = {University of California Press},
  volume = {1},
  year = {1967}
}

@inproceedings{mafuma04a,
  title = {Zchaff2004: An Efficient {SAT} Solver},
  author = {Y. Mahajan and Z. Fu and S. Malik},
  crossref = {sat04},
  pages = {360-375}
}

@inproceedings{magide04a,
  title = {On the Relation Between {ID}-Logic and Answer Set Programming},
  author = {M. Mari{\"e}n and D. Gilis and M. Denecker},
  crossref = {jelia04},
  pages = {108-120}
}

@inproceedings{mahastliko19a,
  title = {Searching with Consistent Prioritization for Multi-Agent Path Finding},
  author = {H. Ma and D. Harabor and P. Stuckey and J. Li and S. Koenig},
  crossref = {aaai19},
  pages = {7643-7650}
}

@inproceedings{mahehonusu08a,
  title = {Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving},
  author = {E. O'Mahony and E. Hebrard and A. Holland and C. Nugent and B. {O}'\relax Sullivan},
  editor = {D. Bridge and K. Brown and B. {O}'\relax Sullivan and H. Sorensen},
  booktitle = {Proceedings of the Nineteenth Irish Conference on Artificial Intelligence and Cognitive Science (AICS'08)},
  year = {2008}
}

@article{mailharro98a,
  title = {A classification and constraint-based framework for configuration},
  author = {D. Mailharro},
  doi = {10.1017/s0890060498124101},
  journal = aiedam,
  number = {4},
  pages = {383-397},
  volume = {12},
  year = {1998}
}

@inproceedings{makbre91,
  title = {Cumulative Inference Relations for {JTMS} and Logic Programming},
  author = {G. Brewka and D. Makinson and K. Schlechta},
  editor = {J. Dix and K. Jantke and P. Schmitt},
  booktitle = {Proceedings of the First International Workshop on Nonmonotonic and Inductive Logic},
  pages = {1-12},
  publisher = springer,
  series = lnai,
  year = {1991}
}

@incollection{makgae90,
  title = {Relations Between the Logic of Theory Change and Nonmonotonic Logic},
  author = {D. Makinson and P. G{\"a}rdenfors},
  editor = {A. Fuhrmann and M. Morreau},
  booktitle = {The Logic of Theory Change},
  pages = {185-205},
  publisher = springer,
  year = {1990}
}

@inproceedings{makinson89,
  title = {General Theory of Cumulative Inference},
  author = {D. Makinson},
  editor = {M. Reinfrank and J. de Kleer and M. Ginsberg and E. Sandewall},
  booktitle = {Proceedings of the Second International Workshop on Non-Monotonic Reasoning},
  pages = {1-18},
  publisher = springer,
  series = lnai,
  volume = {346},
  year = {1989}
}

@incollection{makinson92a,
  title = {General Patterns in Nonmonotonic Reasoning},
  author = {D. Makinson},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  booktitle = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  pages = {35-110},
  publisher = {Oxford University Press},
  volume = {1},
  year = {1994}
}

@article{makoaycohokuurxutosh17a,
  title = {Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios},
  author = {H. Ma and S. Koenig and N. Ayanian and L. Cohen and W. H{\"o}nig and T. Kumar and T. Uras and H. Xu and C. Tovey and G. Sharon},
  journal = {CoRR},
  url = {http://arxiv.org/abs/1702.05515},
  volume = {abs/1702.05515},
  year = {2017}
}

@inproceedings{makoe16a,
  title = {Optimal Target Assignment and Path Finding for Teams of Agents},
  author = {H. Ma and S. Koenig},
  crossref = {aamas16},
  pages = {1144-1152},
  year = {2016}
}

@inproceedings{makuko17a,
  title = {Multi-Agent Path Finding with Delay Probabilities},
  author = {H. Ma and T. Kumar and S. Koenig},
  crossref = {aaai17},
  pages = {3605-3612}
}

@inproceedings{malikuko17a,
  title = {Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks},
  author = {H. Ma and J. Li and T. Kumar and S. Koenig},
  booktitle = {Proceedings of the Sixteenth Conference on Autonomous Agents and MultiAgent Systems (AAMAS'17)},
  pages = {837-845},
  publisher = acm,
  year = {2017}
}

@incollection{malyma09a,
  title = {Conflict-Driven Clause Learning {SAT} Solvers},
  author = {J. Marques-Silva and I. Lynce and S. Malik},
  chapter = {4},
  crossref = {SATHandbook},
  pages = {131-153}
}

@inproceedings{mamaly10a,
  title = {Improving Search Space Splitting for Parallel {SAT} Solving},
  author = {R. Martins and V. Manquinho and I. Lynce},
  crossref = {ictai10},
  pages = {336-343}
}

@inproceedings{mamapl09a,
  title = {Algorithms for Weighted {B}oolean Optimization},
  author = {V. Manquinho and J. Marques-Silva and J. Planes},
  crossref = {sat09},
  pages = {495-508}
}

@article{manere90,
  title = {A theory of nonmonotonic rule systems},
  author = {V. Marek and A. Nerode and J. Remmel},
  journal = amai,
  pages = {241-273},
  volume = {1},
  year = {1990}
}

@article{manitr08a,
  title = {Logic programs with monotone abstract constraint atoms},
  author = {V. Marek and I. Niemel{\"a} and M. Truszczy{\'n}ski},
  journal = tplp,
  number = {2},
  pages = {167-199},
  volume = {8},
  year = {2008}
}

@article{manmar04a,
  title = {Satisfiability-Based Algorithms for {B}oolean Optimization},
  author = {V. Manquinho and J. Marques-Silva},
  journal = amai,
  number = {3-4},
  pages = {353-372},
  volume = {40},
  year = {2004}
}

@article{manmar06a,
  title = {On Using Cutting Planes in Pseudo-{B}oolean Optimization},
  author = {V. Manquinho and J. Marques-Silva},
  journal = jsat,
  pages = {209-219},
  volume = {2},
  year = {2006}
}

@article{manres70,
  title = {On inferences from inconsistent information},
  author = {R. Manor and N. Rescher},
  journal = {Theory and Decision},
  pages = {179-219},
  volume = {1},
  year = {1970}
}

@article{manrou06a,
  title = {The First Evaluation of {P}seudo-{B}oolean Solvers ({PB}'05)},
  author = {V. Manquinho and O. Roussel},
  journal = jsat,
  pages = {103-143},
  volume = {2},
  year = {2006}
}

@inproceedings{mapuri12a,
  title = {Applying Machine Learning Techniques to {ASP} Solving},
  author = {M. Maratea and L. Pulina and F. Ricca},
  crossref = {iclp-lipics12},
  pages = {37-48}
}

@inproceedings{margup12a,
  title = {Galliwasp: {A} Goal-Directed Answer Set Solver},
  author = {K. Marple and G. Gupta},
  crossref = {lopstr12},
  pages = {122-136}
}

@article{margup14a,
  title = {Dynamic Consistency Checking in Goal-Directed Answer Set Programming},
  author = {K. Marple and G. Gupta},
  journal = tplp,
  number = {4-5},
  pages = {415-427},
  volume = {14},
  year = {2014}
}

@inproceedings{marive10a,
  title = {{DLV}\textsuperscript{MC}: Enhanced Model Checking in {DLV}},
  author = {M. Maratea and F. Ricca and P. Veltri},
  crossref = {jelia10},
  pages = {365-368}
}

@article{markey03a,
  title = {Temporal Logic with Past is Exponentially More Succinct},
  author = {N. Markey},
  journal = {Bulletin of the {EATCS}},
  pages = {122-128},
  volume = {79},
  year = {2003}
}

@inproceedings{marlyn07a,
  title = {Towards Robust {CNF} Encodings of Cardinality Constraints},
  author = {J. Marques-Silva and I. Lynce},
  crossref = {cp07},
  pages = {483-497}
}

@inproceedings{marpla08a,
  title = {Algorithms for Maximum Satisfiability using Unsatisfiable Cores},
  author = {J. Marques-Silva and J. Planes},
  crossref = {date08},
  pages = {408-413}
}

@inproceedings{marquessilva08a,
  title = {Practical Applications of {B}oolean Satisfiability},
  author = {J. Marques-Silva},
  booktitle = {Proceedings of the Ninth International Workshop on Discrete Event Systems (WODES'08)},
  pages = {74-80},
  publisher = ieee,
  year = {2008}
}

@inproceedings{marrem01a,
  title = {On the Expressibility of Stable Logic Programming},
  author = {V. Marek and J. Remmel},
  crossref = {lpnmr01},
  pages = {107-120}
}

@inproceedings{marrem04a,
  title = {Set Constraints in Logic Programming},
  author = {V. Marek and J. Remmel},
  crossref = {lpnmr04},
  pages = {167-179}
}

@inproceedings{marrem08a,
  title = {On the Continuity of {G}elfond-{L}ifschitz Operator and Other Applications of Proof-Theory in {ASP}},
  author = {V. Marek and J. Remmel},
  crossref = {iclp08},
  pages = {223-237}
}

@inproceedings{marsak96a,
  title = {{GRASP} - A New Search Algorithm for Satisfiability},
  author = {J. Marques-Silva and K. Sakallah},
  booktitle = {Proceedings of the International Conference on Computer-Aided Design (ICCAD'96)},
  pages = {220-227},
  publisher = ieee,
  year = {1996}
}

@article{marsak99a,
  title = {{GRASP}: A Search Algorithm for Propositional Satisfiability},
  author = {J. Marques-Silva and K. Sakallah},
  journal = ieeetc,
  number = {5},
  pages = {506-521},
  volume = {48},
  year = {1999}
}

@article{marsub92a,
  title = {The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs},
  author = {V. Marek and V. Subrahmanian},
  journal = tcs,
  number = {2},
  pages = {365-386},
  volume = {103},
  year = {1992}
}

@book{martot90a,
  title = {Knapsack Problems: Algorithms and Computer Implementations},
  author = {S. Martello and P. Toth},
  publisher = wiley,
  year = {1990}
}

@inproceedings{martru89,
  title = {Relating autoepistemic and default logics},
  author = {V. Marek and M. Truszczy{\'n}ski},
  crossref = {kr89},
  pages = {276-288}
}

@inproceedings{martru89c,
  title = {Stable semantics for logic programs and default theories},
  author = {V. Marek and M. Truszczy{\'n}ski},
  editor = {E. Lusk and R. Overbeek},
  booktitle = {Proceedings of the North American Conference on Logic Programing},
  pages = {243-256},
  publisher = {MIT Press},
  where = {Cambridge, MA},
  year = {1989}
}

@article{martru90,
  title = {Modal Logic for Default Reasoning},
  author = {V. Marek and M. Truszczy{\'n}ski},
  journal = amai,
  pages = {275-302},
  volume = {1},
  year = {1990}
}

@inproceedings{martru90:ws,
  title = {Modal Logic for Default Reasoning},
  author = {V. Marek and M. Truszczy{\'n}ski},
  crossref = {nmr90},
  pages = {247-258}
}

@inproceedings{martru91a,
  title = {Normal form results for default logics},
  author = {V. Marek and M. Truszczy{\'n}ski},
  editor = {G. Brewka and K. Jantke and P. Schmitt},
  booktitle = {Nonmonotonic and Inductive Logic},
  pages = {153-174},
  publisher = springer,
  series = lnai,
  volume = {659},
  year = {1993}
}

@inproceedings{martru91b,
  title = {Computing intersection of autoepistemic expansions},
  author = {V. Marek and M. Truszczy{\'n}ski},
  editor = {V. Marek and A. Nerode and V. Subrahmanian},
  booktitle = {Proceedings of the First International Workshop on Logic Programming and Nonmonotonic Reasoning},
  pages = {37-50},
  publisher = {MIT Press},
  year = {1991}
}

@article{martru91c,
  title = {Autoepistemic Logic},
  author = {V. Marek and M. Truszczy{\'n}ski},
  journal = jacm,
  number = {3},
  pages = {588-619},
  volume = {38},
  year = {1991}
}

@book{martru93a,
  title = {Nonmonotonic logic: context-dependent reasoning},
  author = {V. Marek and M. Truszczy{\'n}ski},
  publisher = springer,
  series = {Artifical Intelligence},
  year = {1993}
}

@incollection{martru99a,
  title = {Stable models and an alternative logic programming paradigm},
  author = {V. Marek and M. Truszczy{\'n}ski},
  editor = {K. Apt and V. Marek and M. Truszczy{\'n}ski and D. Warren},
  booktitle = {The Logic Programming Paradigm: a 25-Year Perspective},
  pages = {375-398},
  publisher = springer,
  year = {1999}
}

@article{marwagwei08a,
  title = {A mathematical approach to solve the network reconstruction problem},
  author = {W. Marwan and A. Wagler and R. Weismantel},
  journal = {Mathematical Methods of Operatios Research},
  number = {1},
  pages = {117-132},
  volume = {67},
  year = {2008}
}

@book{marzom16a,
  title = {Optimization methods in metabolic networks},
  author = {C. Maranas and A. Zomorrodi},
  publisher = wiley,
  year = {2016}
}

@inproceedings{masasase13a,
  title = {Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering},
  author = {Y. Malitsky and A. Sabharwal and H. Samulowitz and M. Sellmann},
  crossref = {ijcai13},
  pages = {608-614}
}

@inproceedings{masctr91,
  title = {Modal nonmonotonic logic: ranges, characterization, computation},
  author = {V. Marek and G. Schwarz and M. Truszczy{\'n}ski},
  crossref = {kr91},
  pages = {395-404}
}

@article{maseza13a,
  title = {Extending the Power of {D}atalog Recursion},
  author = {M. Mazuran and E. Serra and C. Zaniolo},
  journal = {Journal on Very Large Data Bases},
  number = {4},
  pages = {471-493},
  volume = {22},
  year = {2013}
}

@book{matiiasevich93a,
  title = {Hilbert's tenth problem},
  author = {I. Matiiasevich},
  publisher = {MIT press},
  year = {1993}
}

@inproceedings{matoshkuko16a,
  title = {Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem},
  author = {H. Ma and C. Tovey and G. Sharon and T. Kumar and S. Koenig},
  crossref = {aaai16},
  pages = {3166-3173}
}

@inproceedings{matrtr92a,
  title = {Representation Theory for Default Logic},
  author = {V. Marek and J. Treur and M. Truszczy{\'n}ski},
  booktitle = {Proceedings of the Symposium on Mathematics and Artificial Intelligence},
  year = {1996}
}

@inproceedings{mawafelikuko18a,
  title = {Multi-Agent Path Finding with Deadlines},
  author = {H. Ma and G. Wagner and A. Felner and J. Li and T. Kumar and S. Koenig},
  crossref = {ijcai18},
  pages = {417-423}
}

@inproceedings{mawidebr08a,
  title = {{SAT}({ID}): Satisfiability of Propositional Logic Extended with Inductive Definitions},
  author = {M. Mari{\"e}n and J. Wittocx and M. Denecker and M. Bruynooghe},
  crossref = {sat08},
  pages = {211-224}
}

@inproceedings{maysaf20a,
  title = {Positional Games and {QBF:} The Corrective Encoding},
  author = {V. Mayer-Eichberger and A. Saffidine},
  crossref = {sat20},
  pages = {447-463}
}

@inproceedings{mccarthy59a,
  title = {Programs with Common Sense},
  author = {J. McCarthy},
  booktitle = {Mechanization of Thought Processes, Proceedings of the Symposium of the National Physics Laboratory},
  pages = {77-84},
  year = {1959}
}

@article{mccarthy80a,
  title = {Circumscription --- A Form of Nonmonotonic Reasoning},
  author = {J. McCarthy},
  journal = ai,
  number = {1-2},
  pages = {27-39},
  volume = {13},
  year = {1980}
}

@article{mccarthy86a,
  title = {Applications of Circumscription to Formalizing Common-Sense Knowledge},
  author = {J. McCarthy},
  journal = ai,
  pages = {89-116},
  volume = {28},
  year = {1986}
}

@inproceedings{mccarthy93a,
  title = {Notes on formalizing contexts},
  author = {J. McCarthy},
  booktitle = ijcai,
  year = {1993}
}

@misc{mccarthy98a,
  title = {Elaboration Tolerance},
  author = {J. McCarthy},
  url = {http://jmc.stanford.edu/articles/elaboration/elaboration.pdf},
  year = {1998}
}

@incollection{mcchay69a,
  title = {Some Philosophical Problems from the Standpoint of Artificial Intelligence},
  author = {J. McCarthy and P. Hayes},
  editor = {B. Meltzer and D. Michie},
  booktitle = {Machine Intelligence},
  pages = {463-502},
  publisher = {Edinburgh University Press},
  volume = {4},
  year = {1969}
}

@inproceedings{mcctur95a,
  title = {A Causal Theory of Ramifications and Qualifications},
  author = {N. McCain and H. Turner},
  crossref = {ijcai95},
  pages = {1978-1984}
}

@inproceedings{mcctur97a,
  title = {Causal Theories of Action and Change},
  author = {N. McCain and H. Turner},
  crossref = {aaai97},
  pages = {460-465}
}

@misc{mccune88,
  title = {Otter Users' Guide},
  author = {W. McCune},
  howpublished = {Argonne Nat'l Laboratories, Argonne, ILL},
  year = {1988}
}

@techreport{mccune94a,
  title = {A {D}avis-{P}utnam Program and Its Application to Finite First-Order Model Search: Quasigroup Existence Problems},
  author = {W. McCune},
  institution = {Argonne National Laboratory},
  number = {ANL/MCS-TM-194},
  year = {1994}
}

@article{mcddoy80,
  title = {Nonmonotonic Logic {I}},
  author = {D. McDermott and J. Doyle},
  journal = ai,
  number = {1-2},
  pages = {41-72},
  volume = {13},
  year = {1980}
}

@article{mcdermott82a,
  title = {Nonmonotonic Logic {II}: Nonmonotonic Modal Theories},
  author = {D. McDermott},
  journal = jacm,
  number = {1},
  pages = {33-57},
  volume = {29},
  year = {1982}
}

@article{mcdermott82b,
  title = {{R1:} {A} Rule-Based Configurer of Computer Systems},
  author = {J. McDermott},
  doi = {10.1016/0004-3702(82)90021-2},
  journal = ai,
  number = {1},
  pages = {39-88},
  volume = {19},
  year = {1982}
}

@techreport{mcdermott98a,
  title = {{PDDL} --- The Planning Domain Definition Language},
  author = {D. McDermott},
  institution = {Yale Center for Computational Vision and Control},
  number = {TR-98-003/DCS TR-1165},
  type = {Technical Report CVC},
  year = {1998}
}

@inproceedings{mcilraith97a,
  title = {Representing Actions and State Constraints in Model-Based Diagnosis},
  author = {S. McIlraith},
  crossref = {aaai97},
  pages = {43-49}
}

@article{mecost13a,
  title = {Boolean Equi-propagation for Concise and Efficient {SAT} Encodings of Combinatorial Problems},
  author = {A. Metodi and M. Codish and P. Stuckey},
  journal = jair,
  pages = {303-341},
  volume = {46},
  year = {2013}
}

@inproceedings{medush07a,
  title = {A Tutorial on Satisfiability Modulo Theories},
  author = {L. {Mendon{\c{c}}a de Moura} and B. Dutertre and N. Shankar},
  crossref = {cav07},
  pages = {20-36}
}

@phdthesis{meel18a,
  title = {Constrained Counting and Sampling: Bridging the Gap between Theory and Practice},
  author = {K. Meel},
  month = aug,
  school = {Rice University},
  type = {Dissertation},
  year = {2018}
}

@article{megezh08a,
  title = {Integrating Answer Set Programming and Constraint Logic Programming},
  author = {V. Mellarkod and M. Gelfond and Y. Zhang},
  journal = amai,
  number = {1-4},
  pages = {251-287},
  volume = {53},
  year = {2008}
}

@inproceedings{melgel08a,
  title = {Integrating Answer Set Reasoning with Constraint Solving Techniques},
  author = {V. Mellarkod and M. Gelfond},
  crossref = {flops08},
  pages = {15-31}
}

@inproceedings{mellloba96a,
  title = {Temporal logic and reasoning about actions},
  author = {G. Mendez and J. Llopis and J. Lobo and C. Baral},
  booktitle = {Proceedings of the Third Symposium on Logical Formalizations of Commonsense Reasoning},
  year = {1996}
}

@book{mendelson64,
  title = {Introduction to Mathematical Logic},
  author = {E. Mendelson},
  publisher = elsevier,
  year = {1964}
}

@inproceedings{mengin94,
  title = {Prioritized Conflict Resolution for Default Reasoning},
  author = {J. Mengin},
  booktitle = ecai,
  pages = {376-380},
  publisher = wiley,
  year = {1994}
}

@inproceedings{menipu06a,
  title = {From {MITL} to timed automata},
  author = {O. Maler and D. Nickovic and A. Pnueli},
  booktitle = {International conference on formal modeling and analysis of timed systems},
  doi = {10.1007/11867340\_20},
  pages = {274-289},
  publisher = springer,
  year = {2006}
}

@inproceedings{mercer88,
  title = {Using Default Logic to Derive Natural Language Suppositions},
  author = {R. Mercer},
  booktitle = {Proceedings of Canadian Society for Computational Studies of Intelligence Conference},
  pages = {14-21},
  year = {1988}
}

@incollection{merosc06a,
  title = {Soft Constraints},
  author = {P. Meseguer and F. Rossi and T. Schiex},
  chapter = {9},
  crossref = {CPHandbook},
  pages = {279-326}
}

@article{mestkaco14a,
  title = {A Novel SAT-Based Approach to Model Based Diagnosis},
  author = {A. Metodi and R. Stern and M. Kalech and M. Codish},
  journal = jair,
  pages = {377-411},
  volume = {51},
  year = {2014}
}

@article{metcod12a,
  title = {Compiling finite domain constraints to {SAT} with {BEE}},
  author = {A. Metodi and M. Codish},
  journal = tplp,
  number = {4-5},
  pages = {465-483},
  volume = {12},
  year = {2012}
}

@article{mezhrezhlv20a,
  title = {Mixed-Integer Linear Programming and Constraint Programming Formulations for Solving Distributed Flexible Job Shop Scheduling Problem},
  author = {L. Meng and C. Zhang and Y. Ren and B. Zhang and C. Lv},
  journal = {Computers \& Industrial Engineering},
  pages = {Article ID 106347},
  volume = {142},
  year = {2020}
}

@article{mibrde95a,
  title = {{CHICA}, an Abductive Planning System Based on Event Calculus},
  author = {L. Missiaen and M. Bruynooghe and M. Denecker},
  journal = jlc,
  number = {5},
  pages = {579-602},
  volume = {5},
  year = {1995}
}

@inproceedings{michael04a,
  title = {Scalable Lock-Free Dynamic Memory Allocation},
  author = {M. Michael},
  crossref = {pldi04},
  pages = {35-46}
}

@inproceedings{micrue10a,
  title = {Handling Software Upgradeability Problems with {MILP} Solvers},
  author = {C. Michel and M. Rueher},
  crossref = {lococo10},
  pages = {1-10}
}

@inproceedings{micsco96a,
  title = {Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms},
  author = {M. Michael and M. Scott},
  crossref = {podc96},
  pages = {267-275}
}

@inproceedings{miktru93a,
  title = {Rational default logic and disjunctive logic programming},
  author = {A. Mikitiuk and M. Truszczy{\'n}ski},
  editor = {A. Nerode and L. Pereira},
  booktitle = {Proceedings of the Second International Workshop on logic Programming and Non-monotonic Reasoning.},
  pages = {283-299},
  publisher = {MIT Press},
  year = {1993}
}

@misc{miktru94a,
  title = {Rational versus constrained default logic},
  author = {A. Mikitiuk and M. Truszczy{\'n}ski},
  howpublished = {Personal communication},
  year = {1994}
}

@inproceedings{miktru95a,
  title = {Rational versus constrained default logic},
  author = {A. Mikitiuk and M. Truszczy{\'n}ski},
  crossref = {ijcai95},
  pages = {1509-1515}
}

@article{miles08a,
  title = {Cross-disciplinary perspectives on meta-learning for algorithm selection},
  author = {K. Smith-Miles},
  journal = acmcs,
  number = {1},
  pages = {6:1-6:25},
  volume = {41},
  year = {2008}
}

@article{miller95,
  title = {Word{N}et: A lexical database for {E}nglish},
  author = {G. Miller},
  journal = cacm,
  number = {11},
  pages = {39-41},
  volume = {38},
  year = {1995}
}

@inproceedings{milsch06a,
  title = {Extending Ordered Disjunctions for Policy Enforcement: Preliminary report},
  author = {A. Mileo and T. Schaub},
  crossref = {prefs06},
  pages = {45-59}
}

@inproceedings{milsch07a,
  title = {Qualitative constraint enforcement in advanced policy specification},
  author = {A. Mileo and T. Schaub},
  crossref = {ecsqaru07},
  pages = {695-706}
}

@inbook{milsha02a,
  title = {Some Alternative Formulations of the Event Calculus},
  author = {R. Miller and M. Shanahan},
  crossref = {kowalski02},
  pages = {452-490}
}

@inproceedings{mimebi08a,
  title = {Wireless sensor networks supporting context-aware reasoning in assisted living},
  author = {A. Mileo and D. Merico and R. Bisiani},
  crossref = {petra08},
  pages = {54},
  year = {2008}
}

@inproceedings{mimebi08b,
  title = {A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living},
  author = {A. Mileo and D. Merico and R. Bisiani},
  crossref = {iclp08},
  pages = {145-159}
}

@inproceedings{mimebi09a,
  title = {Non-monotonic Reasoning Supporting Wireless Sensor Networks for Intelligent Monitoring: The {SINDI} System},
  author = {A. Mileo and D. Merico and R. Bisiani},
  crossref = {lpnmr09},
  pages = {585-590}
}

@inproceedings{minker82,
  title = {On Indefinite Databases and the Closed World Assumption},
  author = {J. Minker},
  booktitle = cade,
  year = {1982}
}

@book{minker88,
  title = {Foundations of Deductive Databases and Logic Programming},
  editor = {J. Minker},
  publisher = m-k,
  year = {1988}
}

@incollection{minsky75,
  title = {A framework for representing knowledge},
  author = {M. Minsky},
  editor = {P. Winston},
  address = {New York},
  booktitle = {The Psychology of Computer Vision},
  pages = {211-277},
  publisher = {McGraw-Hill},
  year = {1975}
}

@article{mints10a,
  title = {Cut-free formulations for a quantified logic of here and there},
  author = {G. Mints},
  journal = {Annals of Pure and Applied Logic},
  number = {3},
  pages = {237-242},
  volume = {162},
  year = {2010}
}

@inproceedings{mipesu87,
  title = {A Parallel Self-Modifying Default Reasoning System},
  author = {J. Minker and D. Perlis and K. Subramanian},
  booktitle = ncai,
  pages = {923-927},
  year = {1987}
}

@inproceedings{miscmebi10a,
  title = {Knowledge-Based Multi-Criteria Optimization to Support Indoor Positioning},
  author = {A. Mileo and T. Schaub and D. Merico and R. Bisiani},
  editor = {M. Gavanelli and T. Mancini},
  booktitle = {Proceedings of Seventh International Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion (RCRA'10)},
  publisher = {CEUR Workshop Proceedings (CEUR-WS.org)},
  year = {2010}
}

@article{miscmebi11a,
  title = {Knowledge-Based Multi-Criteria Optimization to Support Indoor Positioning},
  author = {A. Mileo and T. Schaub and D. Merico and R. Bisiani},
  journal = amai,
  number = {3-4},
  pages = {345-370},
  volume = {62},
  year = {2011}
}

@article{mitchell05a,
  title = {A {SAT} Solver Primer},
  author = {D. Mitchell},
  journal = {Bulletin of the European Association for Theoretical Computer Science},
  pages = {112-133},
  volume = {85},
  year = {2005}
}

@inproceedings{mitfal90a,
  title = {Dynamic Constraint Satisfaction Problems},
  author = {S. Mittal and B. Falkenhainer},
  crossref = {aaai90},
  pages = {25-32}
}

@inproceedings{mitfra89a,
  title = {Towards a Generic Model of Configuration Tasks},
  author = {S. Mittal and F. Frayman},
  crossref = {ijcai89},
  pages = {1395-1401}
}

@inproceedings{miufuk17a,
  title = {Automatic Extraction of Axioms for Planning},
  author = {S. Miura and A. Fukunaga},
  crossref = {icaps17},
  pages = {218-227}
}

@article{moheliplma13a,
  title = {Iterative and core-guided MaxSAT solving: {A} survey and assessment},
  author = {A. Morgado and F. Heras and M. Liffiton and J. Planes and J. Marques-Silva},
  journal = {Constraints},
  number = {4},
  pages = {478-534},
  volume = {18},
  year = {2013}
}

@inproceedings{moinard90,
  title = {Preference by Specificity in Default Logic},
  author = {Y. Moinard},
  address = {Marseille},
  booktitle = {ESPRIT Project DRUMS RP1 1st Workshop},
  pages = {???},
  year = {1990}
}

@inproceedings{moirol94a,
  title = {Preferential entailments for circumscriptions},
  author = {Y. Moinard and R. Rolland},
  crossref = {kr94},
  pages = {461-472}
}

@inproceedings{momazhzhma01a,
  title = {Chaff: Engineering an Efficient {SAT} Solver},
  author = {M. Moskewicz and C. Madigan and Y. Zhao and L. Zhang and S. Malik},
  crossref = {dac01},
  pages = {530-535}
}

@inproceedings{moore84a,
  title = {Possible World Semantics for Autoepistemic Logic},
  author = {R. Moore},
  booktitle = {Proceedings of the AAAI-Workshop on Nonmonotonic Reasoning},
  pages = {344-354},
  year = {1984}
}

@inproceedings{moore84b,
  title = {The Role of Logic in Artificial Intelligence},
  author = {R. Moore},
  booktitle = {Proceedings of the Conference on Advanced Information Technology: Applications, Achievements and Prospects},
  year = {1984}
}

@article{moore85,
  title = {Semantical Considerations on Nonmonotonic Logic},
  author = {R. Moore},
  journal = ai,
  pages = {75-94},
  volume = {25},
  year = {1985}
}

@incollection{moore88,
  title = {Autoepistemic Logic},
  author = {R. Moore},
  editor = {P. Smets and E. Mamdani and D. Dubois and H Prade},
  booktitle = {Non-Standard Logics for Automated Reasoning},
  chapter = {4},
  pages = {105-127},
  publisher = {Academic Press Limited},
  year = {1988}
}

@inproceedings{mopalumamakuko16a,
  title = {Planning, Scheduling and Monitoring for Airport Surface Operations},
  author = {R. Morris and C. Pasareanu and K. Luckow and W. Malik and H. Ma and T. Kumar and S. Koenig},
  editor = {D. Magazzeni and S. Sanner and S. Thi{\'e}baux},
  booktitle = {Proceedings of the Workshop on Planning for Hybrid Systems},
  publisher = {{AAAI} Press},
  year = {2016}
}

@inproceedings{morgenstern90a,
  title = {A Formal Theory of Multiple Agent Nonmonotonic Reasoning},
  author = {L. Morgenstern},
  crossref = {aaai90},
  pages = {538-544},
  year = {1990}
}

@inproceedings{mormar05a,
  title = {Good Learning and Implicit Model Enumeration},
  author = {A. Morgado and J. Marques-Silva},
  crossref = {ictai05},
  pages = {131-136}
}

@article{moscwesc10a,
  title = {Centurio, a General Game Player: Parallel, {Java}- and {ASP}-based},
  author = {M. M{\"o}ller and M. Schneider and M. Wegner and T. Schaub},
  journal = {K{\"u}nstliche Intelligenz},
  number = {1},
  pages = {17-24},
  volume = {25},
  year = {2011}
}

@book{moszkowski86a,
  title = {Executing Temporal Logic Programs},
  author = {B. Moszkowski},
  doi = {10.1017/S0022481200029169},
  publisher = cup,
  year = {1986}
}

@inproceedings{motuso07a,
  title = {An Extension to Conformant Planning Using Logic Programming},
  author = {A. Morales and P. Tu and T. Son},
  crossref = {ijcai07},
  pages = {1991-1996}
}

@inproceedings{moubjo09a,
  title = {Satisfiability Modulo Theories: An Appetizer},
  author = {L. de Moura and N. Bj{\o}rner},
  crossref = {sbmf09},
  pages = {23-36}
}

@inproceedings{mubefemcmipeso15a,
  title = {Planning Over Multi-Agent Epistemic States: {A} Classical Planning Approach},
  author = {C. Muise and V. Belle and P. Felli and S. McIlraith and T. Miller and A. Pearce and L. Sonenberg},
  crossref = {aaai15},
  pages = {3327-3334}
}

@book{mueller06a,
  title = {Commonsense Reasoning},
  author = {E. Mueller},
  publisher = m-k,
  year = {2006}
}

@incollection{mueller08a,
  title = {Event Calculus},
  author = {E. Mueller},
  crossref = {KRHandbook},
  doi = {10.1016/S1574-6526(07)03017-9},
  pages = {671-708}
}

@article{mugrae94a,
  title = {Inductive Logic Programming: Theory and Methods},
  author = {S. Muggleton and L. {D}e Raedt},
  journal = jlp,
  pages = {629-679},
  volume = {19/20},
  year = {1994}
}

@inproceedings{muneha21a,
  title = {Exploiting Similarity in Evolutionary Product Design for Improved Design Space Exploration},
  author = {L. M{\"u}ller and K. Neubauer and C. Haubelt},
  booktitle = {Embedded Computer Systems: Architectures, Modeling, and Simulation},
  doi = {10.1007/978-3-031-04580-6_3},
  pages = {33-49},
  publisher = springer,
  year = {2022}
}

@inproceedings{mupira90a,
  title = {The Magic of Duplicates and Aggregates},
  author = {I. Mumick and H. Pirahesh and R. Ramakrishnan},
  crossref = {vldb90},
  pages = {264-277}
}

@book{murphy00a,
  title = {Introduction to {AI} Robotics},
  author = {R. Murphy},
  address = {Cambridge, MA, USA},
  publisher = {MIT Press},
  year = {2000}
}

@article{murray82a,
  title = {Completely Non-Clausal Theorem Proving},
  author = {N. Murray},
  journal = ai,
  pages = {67-85},
  volume = {18},
  year = {1982}
}

@misc{murros86,
  title = {Inference with Path Resolution and Semantic Graphs},
  author = {N. Murray and E. Rosenthal},
  howpublished = {State University of New York at Albany, Computer Science Department},
  keywords = {resolution; connection graph; theorem proving},
  origin = {bibel_2},
  year = {1986}
}

@inproceedings{mytirafe14a,
  title = {Using Answer Set Programming for Feature Model Representation and Configuration},
  author = {V. Myll{\"a}rniemi and J. Tiihonen and M. Raatikainen and A. Felfernig},
  crossref = {conf14},
  pages = {1-8}
}

@inproceedings{nacalomu99a,
  title = {{SHOP}: Simple Hierarchical Ordered Planner},
  author = {D. Nau and Y. Cao and A. Lotem and H. Mu{\~n}oz-Avila},
  crossref = {ijcai99},
  pages = {968-975}
}

@inproceedings{nadel11a,
  title = {Generating Diverse Solutions in {SAT}},
  author = {A. Nadel},
  crossref = {sat11},
  pages = {287-301}
}

@inproceedings{nadryv10a,
  title = {Assignment Stack Shrinking},
  author = {A. Nadel and V. Ryvchin},
  crossref = {sat10},
  pages = {375-381}
}

@book{naghtr04a,
  title = {Automated Planning: Theory and Practice},
  author = {D. Nau and M. Ghallab and P. Traverso},
  publisher = m-k,
  year = {2004}
}

@inproceedings{namasivayam06a,
  title = {PB-smodels a Pseudo-Boolean Solver},
  author = {G. Namasivayam},
  booktitle = {AAAI},
  crossref = {aaai06},
  year = {2006}
}

@inproceedings{narbac14a,
  title = {Maximum Satisfiability Using Core-Guided MaxSAT Resolution},
  author = {N. Narodytska and F. Bacchus},
  crossref = {aaai14},
  pages = {2717-2723}
}

@inproceedings{natayopyma03a,
  title = {Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings},
  author = {R. Nair and M. Tambe and M. Yokoo and D. Pynadath and S. Marsella},
  crossref = {ijcai03},
  pages = {705-711}
}

@inproceedings{navvor07a,
  title = {Encodings of bounded {LTL} model checking in effectively propositional logic},
  author = {J. {Navarro P{\'e}rez} and A. Voronkov},
  booktitle = {Proceedings of the Twenty-first International Conference on Automated Deduction (CADE'07)},
  pages = {346-361},
  publisher = springer,
  year = {2007}
}

@inproceedings{navvor08a,
  title = {Planning with effectively propositional logic},
  author = {J. {Navarro P{\'e}rez} and A. Voronkov},
  booktitle = {Volume in Memoriam of Harald Ganzinger},
  publisher = springer,
  year = {2008}
}

@inproceedings{nebel89,
  title = {A Knowledge Level Analysis of Belief Revision},
  author = {B. Nebel},
  crossref = {kr89},
  pages = {301-311}
}

@article{nebel90,
  title = {Terminological Reasoning is Inherently Intractable},
  author = {B. Nebel},
  journal = ai,
  pages = {235-249},
  volume = {43},
  year = {1990}
}

@incollection{nebel98a,
  title = {How Hard is it to Revise a Belief Base?},
  author = {B. Nebel},
  editor = {D. Dubois and H. Prade},
  address = {Dordrecht},
  booktitle = {Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 3: Belief Change},
  pages = {77-145},
  publisher = kluwer,
  year = {1998}
}

@article{nefrle18a,
  title = {Deep optimization for spectrum repacking},
  author = {N. Newman and A. Fr{\'e}chette and K. Leyton-Brown},
  journal = cacm,
  number = {1},
  pages = {97-104},
  volume = {61},
  year = {2018}
}

@inproceedings{neggun15a,
  title = {Constraint-Based Sequence Mining Using Constraint Programming},
  author = {B. Negrevergne and T. Guns},
  crossref = {cpaior15},
  pages = {288-305}
}

@inproceedings{nehagl16a,
  title = {Supporting composition in symbolic system synthesis},
  author = {K. Neubauer and C. Haubelt and M. Gla{\ss}},
  booktitle = {Proceedings of the International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS'16)},
  doi = {10.1109/SAMOS.2016.7818340},
  pages = {132-139},
  year = {2016}
}

@inproceedings{nehawasc18a,
  title = {Utilizing quad-trees for efficient design space exploration with partial assignment evaluation},
  author = {K. Neubauer and C. Haubelt and P. Wanko and T. Schaub},
  crossref = {aspdac18},
  pages = {434-439}
}

@inproceedings{nehawasc18b,
  title = {On Leveraging Approximations for Exact System-level Design Space Exploration: Work-in-progress},
  author = {K. Neubauer and C. Haubelt and P. Wanko and T. Schaub},
  booktitle = {Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis (CODES'18)},
  pages = {15:1-15:2},
  publisher = ieee,
  year = {2018}
}

@inproceedings{nehawasc18c,
  title = {Systematic Test Case Instance Generation for the Assessment of System-level Design Space Exploration Approaches},
  author = {K. Neubauer and C. Haubelt and P. Wanko and T. Schaub},
  booktitle = {Proceedings of the Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen},
  page = {10},
  publisher = {Universit{\"a}t T{\"u}bingen},
  year = {2018}
}

@article{nelopp79a,
  title = {Simplification by Cooperating Decision Procedures},
  author = {G. Nelson and D. Oppen},
  journal = toplas,
  number = {2},
  pages = {245-257},
  volume = {1},
  year = {1979}
}

@techreport{neugebauer89,
  title = {Die Konnektionsmethode},
  author = {G. Neugebauer},
  address = iki:adr,
  institution = iki,
  number = {AIDA-89-6},
  type = {Forschungsbericht},
  year = {1989}
}

@techreport{neugebauer91,
  title = {Lemma Usage in Connection Method Theorem Proving},
  author = {G. Neugebauer},
  institution = {FG Intellektik, Technisch Hochschule Darmstadt.},
  number = {AIDA-91-08},
  year = {1991}
}

@techreport{neugebauer92,
  title = {From Horn Clauses to First Order Logic: A Graceful Ascent},
  author = {G. Neugebauer},
  institution = iki,
  number = {AIDA-92-21},
  year = {1992}
}

@techreport{neusch91,
  title = {A Pool-Based Connection Calculus},
  author = {G. Neugebauer and T. Schaub},
  address = iki:adr,
  institution = iki,
  number = {AIDA-91-2},
  year = {1991}
}

@inproceedings{neusch94,
  title = {A Pool-Based Connection Calculus},
  author = {G. Neugebauer and T. Schaub},
  editor = {C. Boz{\c{s}}ahin and U. Hal{\i}c{\i} and K. Oflazar and N. Yalab{\i}k},
  booktitle = {Proceedings of Third Turkish Symposium on Artificial Intelligence and Neural Networks},
  pages = {297-306},
  publisher = {Middle East Technical University},
  year = {1994}
}

@inproceedings{newascha17a,
  title = {Enhancing symbolic system synthesis through {ASPmT} with partial assignment evaluation},
  author = {K. Neubauer and P. Wanko and T. Schaub and C. Haubelt},
  crossref = {date17},
  pages = {306-309}
}

@inproceedings{newascha18b,
  title = {Exact Multi-Objective Design Space Exploration using {ASPmT}},
  author = {K. Neubauer and P. Wanko and T. Schaub and C. Haubelt},
  crossref = {date18},
  pages = {257-260}
}

@book{newell94a,
  title = {Unified theories of cognition},
  author = {A. Newell},
  publisher = {Harvard University Press},
  year = {1994}
}

@inproceedings{ngjani11a,
  title = {Translating Answer-Set Programs into Bit-Vector Logic},
  author = {M. Nguyen and T. Janhunen and I. Niemel{\"a}},
  crossref = {inapwlp11},
  pages = {105-116}
}

@inproceedings{ngobsoscye17a,
  title = {Generalized Target Assignment and Path Finding Using Answer Set Programming},
  author = {V. Nguyen and P. Obermeier and T. Son and T. Schaub and W. Yeoh},
  crossref = {ijcai17},
  pages = {1216-1223}
}

@inproceedings{ngstsoye20a,
  title = {Explainable Planning Using Answer Set Programming},
  author = {V. Nguyen and V. Stylianos and T. Son and W. Yeoh},
  crossref = {kr20},
  pages = {662-666}
}

@inproceedings{ngtrsopo11a,
  title = {On Improving Conformant Planners by Analyzing Domain-Structures},
  author = {H. Nguyen and D. Tran and T. Son and E. Pontelli},
  crossref = {aaai11}
}

@inproceedings{ngtrsopo12a,
  title = {On Computing Conformant Plans Using Classical Planners: {A} Generate-And-Complete Approach},
  author = {H. Nguyen and D. Tran and T. Son and E. Pontelli},
  crossref = {icaps12}
}

@incollection{nicsch98,
  title = {The {{\sf XRay}} system: An implementation platform for local query-answering in default logics},
  author = {P. Nicolas and T. Schaub},
  editor = {A. Hunter and S. Parsons},
  booktitle = {Applications of Uncertainty Formalisms in Information Systems},
  pages = {354-378},
  publisher = springer,
  series = lnai,
  volume = {1455},
  year = {1998}
}

@article{nideve07a,
  title = {An introduction to fuzzy answer set programming},
  author = {D. {V}an Nieuwenborgh and M. {D}e Cock and D. Vermeir},
  journal = amai,
  number = {3-4},
  pages = {363-388},
  volume = {50},
  year = {2007}
}

@article{niemela08a,
  title = {Stable Models and Difference Logic},
  author = {I. Niemel{\"a}},
  journal = amai,
  number = {1-4},
  pages = {313-329},
  volume = {53},
  year = {2008}
}

@inproceedings{niemela08b,
  title = {Answer Set Programming without Unstratified Negation},
  author = {I. Niemel{\"a}},
  crossref = {iclp08},
  pages = {88-92}
}

@inproceedings{niemela88,
  title = {Decision Procedure for Autoepistemic Logic},
  author = {I. Niemel{\"a}},
  booktitle = cade,
  pages = {675-684},
  year = {1988}
}

@inproceedings{niemela90,
  title = {Towards Automating Autoepistemic Reasoning},
  author = {I. Niemel{\"a}},
  booktitle = {European Workshop on Logics in Artificial Intelligence (JELIA'90)},
  pages = {10-14},
  year = {1990}
}

@inproceedings{niemela94a,
  title = {A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning},
  author = {I. Niemel{\"a}},
  crossref = {kr94},
  pages = {473-484}
}

@inproceedings{niemela95a,
  title = {Towards Efficient Default Reasoning},
  author = {I. Niemel{\"a}},
  crossref = {ijcai95},
  pages = {312-318}
}

@article{niemela99a,
  title = {Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm},
  author = {I. Niemel{\"a}},
  journal = amai,
  number = {3-4},
  pages = {241-273},
  volume = {25},
  year = {1999}
}

@inproceedings{nieoli05a,
  title = {{DPLL}({T}) with Exhaustive Theory Propagation and Its Application to Difference Logic},
  author = {R. Nieuwenhuis and A. Oliveras},
  crossref = {cav05},
  pages = {321-334}
}

@inproceedings{nieoli06a,
  title = {On {SAT} Modulo Theories and Optimization Problems},
  author = {R. Nieuwenhuis and A. Oliveras},
  crossref = {sat06},
  pages = {156-169}
}

@article{nierin94,
  title = {On the impact of stratification on the complexity of nonmonotonic reasoning},
  author = {I. Niemel{\"a} and J. Rintanen},
  journal = jancl,
  number = {2},
  pages = {141-179},
  volume = {4},
  year = {1994}
}

@inproceedings{niesim95a,
  title = {Evaluating an algorithm for default reasoning},
  author = {I. Niemel{\"a} and P. Simons},
  booktitle = {Working Notes of the IJCAI'95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems},
  pages = {66-72},
  year = {1995}
}

@inproceedings{niesim96a,
  title = {Efficient Implementation of the Well-founded and Stable Model Semantics},
  author = {I. Niemel{\"a} and P. Simons},
  editor = {M. Maher},
  booktitle = {Proceedings of the Joint International Conference and Symposium on Logic Programming},
  pages = {289-303},
  publisher = {MIT Press},
  year = {1996}
}

@inproceedings{niesim97a,
  title = {Smodels: An implementation of the stable model and well-founded semantics for normal logic programs},
  author = {I. Niemel{\"a} and P. Simons},
  crossref = {lpnmr97},
  pages = {420-429}
}

@article{niever06a,
  title = {Preferred Answer Sets for Ordered Logic Programs},
  author = {D. {V}an Nieuwenborgh and D. Vermeir},
  journal = tplp,
  number = {1-2},
  pages = {107-167},
  volume = {6},
  year = {2006}
}

@article{nigrmase08a,
  title = {Metabolic Networks are {NP}-hard to reconstruct},
  author = {Z. Nikoloski and S. Grimbs and P. May and J. Selbig},
  journal = {Journal of Theoretical Biology},
  pages = {807-816},
  volume = {254},
  year = {2008}
}

@inproceedings{nigrseeb08a,
  title = {Hardness and Approximability of the Inverse Scope Problem},
  author = {Z. Nikoloski and S. Grimbs and J. Selbig and O. Ebenh{\"o}h},
  crossref = {wabi08},
  pages = {99-112},
  year = {2008}
}

@book{nilmal95a,
  title = {Logic, Programming and {P}rolog},
  author = {U. Nilsson and J. Ma{\l}uszy{\'n}ski},
  publisher = wiley,
  year = {1995}
}

@book{nilsson80,
  title = {Principles of Artificial Intelligence},
  author = {N. Nilsson},
  publisher = m-k,
  year = {1980}
}

@techreport{nilsson84a,
  title = {Shakey The Robot},
  author = {N. Nilsson},
  institution = {AI Center, SRI International},
  number = {323},
  year = {1984}
}

@article{nilsson86,
  title = {Probabilistic Logic},
  author = {N. Nilsson},
  journal = ai,
  pages = {71-87},
  volume = {28},
  year = {1986}
}

@article{nilsson94a,
  title = {Teleo-Reactive Programs for Agent Control},
  author = {N. Nilsson},
  journal = jair,
  pages = {139-158},
  volume = {1},
  year = {1994}
}

@inproceedings{niolti05a,
  title = {Abstract {DPLL} and Abstract {DPLL} Modulo Theories},
  author = {R. Nieuwenhuis and A. Oliveras and C. Tinelli},
  crossref = {lpar05},
  pages = {36-50}
}

@article{niolti06a,
  title = {Solving {SAT} and {SAT} Modulo Theories: From an abstract {D}avis-{P}utnam-{L}ogemann-{L}oveland procedure to {DPLL}({T})},
  author = {R. Nieuwenhuis and A. Oliveras and C. Tinelli},
  journal = jacm,
  number = {6},
  pages = {937-977},
  volume = {53},
  year = {2006}
}

@inproceedings{nisbra12a,
  title = {Multi-agent A* for parallel and distributed systems},
  author = {R. Nissim and R. Brafman},
  crossref = {aamas12},
  pages = {1265-1266}
}

@inproceedings{nisiso99a,
  title = {Stable Model Semantics of Weight Constraint Rules},
  author = {I. Niemel{\"a} and P. Simons and T. Soininen},
  editor = {M. Gelfond and N. Leone and G. Pfeifer},
  booktitle = {Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning},
  pages = {317-333},
  publisher = springer,
  series = lnai,
  volume = {1730},
  year = {1999}
}

@inproceedings{nivpit10a,
  title = {From {MTL} to Deterministic Timed Automata},
  author = {D. Ni{\v{c}}kovi{\'c} and N. Piterman},
  editor = {K. Chatterjee and T. Henzinger},
  booktitle = {Proceedings of the Eighth International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'10)},
  doi = {10.1007/978-3-642-15297-9\_13},
  pages = {152-167},
  publisher = springer,
  series = lncs,
  year = {2010}
}

@inproceedings{nobagewaba01a,
  title = {An {A-Prolog} Decision Support System for the Space Shuttle},
  author = {M. Nogueira and M. Balduccini and M. Gelfond and R. Watson and M. Barry},
  editor = {I. Ramakrishnan},
  booktitle = {Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages (PADL'01)},
  doi = {10.1007/3-540-45241-9_12},
  pages = {169-183},
  publisher = springer,
  series = lncs,
  volume = {1990},
  year = {2001}
}

@inproceedings{nulehodesh04a,
  title = {Understanding Random {SAT}: Beyond the Clauses-to-Variables Ratio},
  author = {E. Nudelman and K. Leyton-Brown and H. Hoos and A. Devkar and Y. Shoham},
  crossref = {cp04},
  pages = {438-452}
}

@inproceedings{nute87,
  title = {Defeasible Reasoning},
  author = {D. Nute},
  booktitle = {Proceedings of the 20th Hawaii International Conference on Systems Science},
  pages = {470-477},
  publisher = ieee,
  year = {1987}
}

@incollection{nute94,
  title = {Defeasible Logic},
  author = {D. Nute},
  booktitle = {Handbook of Logics in Artificial Intelligence and Logic Programming, Vol. 3},
  pages = {353-395},
  publisher = {Oxford University Press},
  year = {1994}
}

@article{obrnic98a,
  title = {{FIPA} --- towards a standard for software agents},
  author = {P. O'Brien and R. Nicol},
  journal = {BT Technology Journal},
  number = {3},
  pages = {51-59},
  publisher = springer,
  volume = {16},
  year = {1998}
}

@article{obrosc19a,
  title = {Multi-Shot Stream Reasoning in Answer Set Programming: {A} Preliminary Report},
  author = {P. Obermeier and J. Romero and T. Schaub},
  journal = {Open Journal of Databases},
  number = {1},
  pages = {33-38},
  volume = {6},
  year = {2019}
}

@inproceedings{oepusetozw11a,
  title = {{VIDEAS}: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology},
  author = {J. Oetsch and J. P{\"u}hrer and M. Seidl and H. Tompits and P. Zwickl},
  crossref = {lpnmr11},
  pages = {382-387}
}

@article{oeputo10a,
  title = {Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs},
  author = {J. Oetsch and J. P{\"u}hrer and H. Tompits},
  journal = tplp,
  number = {4-6},
  pages = {513-529},
  volume = {10},
  year = {2010}
}

@inproceedings{oesetowo09a,
  title = {{ccT} on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions},
  author = {J. Oetsch and M. Seidl and H. Tompits and S. Woltran},
  crossref = {lpnmr09},
  pages = {382-395}
}

@techreport{ohlbach88,
  title = {A Resolution Calculus for Modal Logics},
  author = {H. Ohlbach},
  address = {Postfach 3049, D-6750 Kaiserslautern 1, Germany},
  institution = {Fachbereich Informatik, Universit{\"a}t Kaiserslautern},
  number = {SR-88-08},
  type = {SEKI Report},
  year = {1988}
}

@techreport{ohlbach89,
  title = {Context Logic},
  author = {H. Ohlbach},
  address = {Postfach 3049, D-6750 Kaiserslautern 1, Germany},
  institution = {Fachbereich Informatik, Universit{\"a}t Kaiserslautern},
  number = {SR-89-08},
  type = {SEKI Report},
  year = {1989}
}

@inproceedings{ohlbach90a,
  title = {Compilation of Recursive Two-Literal Clauses into Unification Algorithms},
  author = {H. Ohlbach},
  booktitle = aimsa,
  year = {1990}
}

@inproceedings{ohlbach90b,
  title = {Abstraction Tree Indexing for Terms},
  author = {H. Ohlbach},
  editor = {L. Aiello},
  booktitle = ecai,
  pages = {479-484},
  publisher = pitman,
  year = {1990}
}

@inproceedings{ohstco07a,
  title = {Propagation = Lazy Clause Generation},
  author = {O. Ohrimenko and P. Stuckey and M. Codish},
  crossref = {cp07},
  pages = {544-558}
}

@article{ohstco09a,
  title = {Propagation via lazy clause generation},
  author = {O. Ohrimenko and P. Stuckey and M. Codish},
  journal = {Constraints},
  number = {3},
  pages = {357-391},
  volume = {14},
  year = {2009}
}

@techreport{oikarinen06a,
  title = {Modular Answer Set Programming},
  author = {E. Oikarinen},
  institution = {Helsinki University of Technology, Laboratory for Theoretical Computer Science},
  number = {A106},
  type = {Research Report},
  year = {2006}
}

@inproceedings{oikjan06a,
  title = {Modular Equivalence for Normal Logic Programs},
  author = {E. Oikarinen and T. Janhunen},
  crossref = {ecai06},
  pages = {412-416}
}

@article{oikjan08a,
  title = {Achieving Compositionality of the Stable Model Semantics for smodels Programs},
  author = {E. Oikarinen and T. Janhunen},
  journal = tplp,
  number = {5-6},
  pages = {717-761},
  volume = {8},
  year = {2008}
}

@inproceedings{oikjan08b,
  title = {Implementing Prioritized Circumscription by Computing Disjunctive Stable Models},
  author = {E. Oikarinen and T. Janhunen},
  crossref = {aimsa08},
  pages = {167-180}
}

@article{oikjan09a,
  title = {A Translation-based Approach to the Verification of Modular Equivalence},
  author = {E. Oikarinen and T. Janhunen},
  journal = jlc,
  number = {4},
  pages = {591-613},
  volume = {19},
  year = {2009}
}

@techreport{olismi00a,
  title = {A job-shop scheduling model for the single-track railway scheduling problem},
  author = {E. Oliveira and B Smith},
  institution = {University of Leeds, School of Computer Studies},
  number = {21},
  type = {LU SCS RR},
  year = {2000}
}

@incollection{olivetti99a,
  title = {Tableaux for nonmonotonic logics},
  author = {N. Olivetti},
  crossref = {TableauHandbook},
  pages = {469-528}
}

@inproceedings{opobsc15a,
  title = {Automatic Genre-Dependent Composition using Answer Set Programming},
  author = {S. Opolka and P. Obermeier and T. Schaub},
  booktitle = {Proceedings of the Twenty-first International Symposium on Electronic Art (ISEA'15)},
  url = {http://isea2015.org/proceeding/submissions/ISEA2015_submission_78.pdf},
  year = {2015}
}

@inproceedings{orarlo12,
  title = {{iSat}: Structure Visualization for {SAT} Problems},
  author = {E. Orbe and C. Areces and G. L{\'o}pez},
  crossref = {lpar12},
  pages = {335-342}
}

@inproceedings{orevkov71a,
  title = {On {G}livenko sequent classes},
  author = {V. Orevkov},
  editor = {V. Orevkov},
  booktitle = {Proceedings of the Steklov Institute of Mathematics},
  note = {Translated from the Russian original},
  pages = {147-173},
  publisher = {American Mathematical Society},
  volume = {98},
  year = {1971}
}

@inproceedings{orgwad92a,
  title = {Theory and Practice of Temporal Logic Programming},
  author = {M. Orgun and W. Wadge},
  crossref = {ilfp92},
  pages = {21-50},
  year = {1990}
}

@incollection{orsben14a,
  title = {{Tacton}: Use of Tacton Configurator at {FLSmidth}},
  author = {K. Orsv{\"a}rn and H. Bennick},
  chapter = {17},
  crossref = {kbc14},
  doi = {10.1016/b978-0-12-415817-7.00017-7},
  pages = {211-218}
}

@article{orthpa10a,
  title = {What is Flux Balance Analysis?},
  author = {J. Orth and I. Thiele and B. Palsson},
  journal = {Nature biotechnology},
  number = {3},
  pages = {245-248},
  volume = {28},
  year = {2010}
}

@inproceedings{osflscan11b,
  title = {Evolution of Ontologies using {ASP}},
  author = {M. Ostrowski and G. Flouris and T. Schaub and G. Antoniou},
  crossref = {iclp-lipics11},
  pages = {16-27}
}

@inproceedings{osnaar01a,
  title = {Equivalence in Answer Set Programming},
  author = {M. Osorio and J. Navarro and J. Arrazola},
  crossref = {lopstr01},
  pages = {57-75}
}

@article{ospascsigu16a,
  title = {Boolean Network Identification from Perturbation Time Series Data combining Dynamics Abstraction and Logic Programming},
  author = {M. Ostrowski and L. Paulev{\'e} and T. Schaub and A. Siegel and C. Guziolowski},
  journal = {Biosystems},
  pages = {139-153},
  volume = {149},
  year = {2016}
}

@phdthesis{ostrowski17a,
  title = {Modern Constraint Answer Set Solving},
  author = {M. Ostrowski},
  school = uofp,
  type = {Dissertation},
  year = {2017}
}

@article{ostsch12a,
  title = {{ASP} modulo {CSP}: The clingcon system},
  author = {M. Ostrowski and T. Schaub},
  doi = {10.1017/S1471068412000142},
  journal = tplp,
  number = {4-5},
  pages = {485-503},
  volume = {12},
  year = {2012}
}

@inproceedings{ostsch12b,
  title = {{ASP} modulo {CSP}: The clingcon system},
  author = {M. Ostrowski and T. Schaub},
  crossref = {cspsat12}
}

@inproceedings{otero01a,
  title = {Induction of Stable Models},
  author = {R. Otero},
  crossref = {ilp01},
  pages = {193-205}
}

@inproceedings{ottdac70a,
  title = {Sur un probl{\`e}me de {J}a{\'s}kowski},
  author = {I. D'Ottaviano and N. da Costa},
  booktitle = {Comptes Rendus de l'Acad{\'e}mie des Sciences de Paris},
  pages = {1349-1353},
  volume = {270},
  year = {1970}
}

@inproceedings{ouawor05a,
  title = {On the Decidability of Metric Temporal Logic},
  author = {J. Ouaknine and J. Worrell},
  crossref = {lics05},
  pages = {188-197}
}

@article{ouawor07a,
  title = {On the decidability and complexity of Metric Temporal Logic over finite words},
  author = {J. Ouaknine and J. Worrell},
  journal = {Logical Methods in Computer Science},
  number = {1},
  volume = {3},
  year = {2007}
}

@article{ozozma87a,
  title = {Extending Relational Algebra and Relational Calculus with Set-Valued Attributes and Aggregate Functions},
  author = {G. {\"O}zsoyoglu and Z. {\"O}zsoyoglu and V. Matos},
  journal = tods,
  number = {4},
  pages = {566-592},
  volume = {12},
  year = {1987}
}

@article{padatu12a,
  title = {{ONTO}-{PDM}: Product-driven {ONTO}logy for Product Data Management interoperability within manufacturing process environment},
  author = {H. Panetto and M. Dassisti and A. Tursi},
  journal = aei,
  number = {2},
  pages = {334-348},
  volume = {26},
  year = {2012}
}

@article{padoporo09a,
  title = {{GASP}: Answer Set Programming with Lazy Grounding},
  author = {A. {Dal Pal{\`{u}}} and A. Dovier and E. Pontelli and G. Rossi},
  journal = {Fundamenta Informaticae},
  number = {3},
  pages = {297-322},
  volume = {96},
  year = {2009}
}

@inproceedings{padtuz98a,
  title = {A Belief-Driven Method for Discovering Unexpected Patterns},
  author = {B. Padmanabhan and A. Tuzhilin},
  crossref = {kdd98},
  pages = {94-100}
}

@inproceedings{paek90,
  title = {A Circumscriptive Theory for Causal and Evidential Support},
  author = {E. Paek},
  editor = {K. Konolige},
  booktitle = {Third International Workshop on Nonmonotonic Reasoning},
  pages = {191-200},
  year = {1990}
}

@inproceedings{pagpep01a,
  title = {Causality and Minimal Change Demystified},
  author = {M. Pagnucco and P. Peppas},
  crossref = {ijcai01},
  pages = {125-130}
}

@inproceedings{pakase05a,
  title = {Inference of Gene Relations from Microarray Data by Abduction.},
  author = {I. Papatheodorou and A. Kakas and M. Sergot},
  crossref = {lpnmr05},
  pages = {389-393}
}

@inproceedings{palgef05a,
  title = {Mapping Conformant Planning into {SAT} Through Compilation and Projection},
  author = {H. Palacios and H. Geffner},
  editor = {R. Mar{\'\i}n and E. Onaindia and A. Bugar{\'\i}n and J. {Santos Reyes}},
  booktitle = {Proceedings of the Eleventh Conference of the Spanish Association for Artificial Intelligence (CAEPIA'05)},
  pages = {311-320},
  publisher = springer,
  series = lncs,
  volume = {4177},
  year = {2005}
}

@inproceedings{palgef07a,
  title = {From Conformant into Classical Planning: Efficient Translations that May Be Complete Too},
  author = {H. Palacios and H. Geffner},
  crossref = {icaps07},
  pages = {264-271}
}

@article{palgef09a,
  title = {Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width},
  author = {H. Palacios and H. Geffner},
  journal = jair,
  pages = {623-675},
  volume = {35},
  year = {2009}
}

@inproceedings{panger95a,
  title = {A {P}rolog like temporal reasoning system},
  author = {T. Panayiotopoulos and M. Gergatsoulis},
  booktitle = {Proceedings of Thirteenth IASTED International Conference on Applied Informatics},
  pages = {123-126},
  year = {1995}
}

@book{papadimitriou94a,
  title = {Computational Complexity},
  author = {C. Papadimitriou},
  publisher = addison,
  year = {1994}
}

@article{papsid94,
  title = {Default theories that always have extensions},
  author = {C. Papadimitriou and M. Sideri},
  journal = ai,
  pages = {347-357},
  volume = {69},
  year = {1994}
}

@book{papste82a,
  title = {Combinatorial Optimization: Algorithms and Complexity},
  author = {C. Papadimitriou and K. Steiglitz},
  address = {Upper Saddle River, NJ, USA},
  publisher = {Prentice-Hall},
  year = {1982}
}

@inproceedings{papyan82a,
  title = {The complexity of facets (and some facets of complexity)},
  author = {C. Papadimitriou and M. Yannakakis},
  booktitle = {Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC'82)},
  pages = {255-260},
  publisher = acm,
  year = {1982}
}

@inproceedings{parastth13a,
  title = {Implementing Belief Change in the Situation Calculus and an Application},
  author = {M. Pagnucco and D. Rajaratnam and H. Strass and M. Thielscher},
  crossref = {lpnmr13},
  pages = {439-451}
}

@book{pareto64a,
  title = {Cours d'economie politique},
  author = {V. Pareto},
  publisher = {Librairie Droz},
  year = {1964}
}

@incollection{parry89,
  title = {Analytic Implication: Its History, Justification, and Varieties},
  author = {W. Parry},
  editor = {R. Routley and J. Norman},
  booktitle = {Directions in Relevant Logic},
  publisher = {Nijhoff, Amsterdam},
  year = {1989}
}

@article{pasije98a,
  title = {Agents that reason and negotiate by arguing},
  author = {S. Parsons and C. Sierra and N. Jennings},
  journal = jlc,
  number = {3},
  pages = {261-292},
  volume = {8},
  year = {1998}
}

@inproceedings{patterson97a,
  title = {Bisimulation and Propositional Intuitionistic Logic},
  author = {A. Patterson},
  editor = {A. Mazurkiewicz and J. Winkowski},
  booktitle = {Proceedings of the Eighth International Conference on Concurrency Theory (CONCUR'97)},
  pages = {347-360},
  publisher = springer,
  series = lncs,
  volume = {1243},
  year = {1997}
}

@inproceedings{patuposo04a,
  title = {Construction of an Agent-Based Framework for Evolutionary Biology: A Progress Report},
  author = {Y. Pan and P. Tu and E. Pontelli and T. Son},
  crossref = {dalt04},
  pages = {92-111},
  year = {2004}
}

@article{pearce06a,
  title = {Equilibrium logic},
  author = {D. Pearce},
  doi = {10.1007/s10472-006-9028-z},
  journal = amai,
  number = {1-2},
  pages = {3-41},
  volume = {47},
  year = {2006}
}

@inproceedings{pearce94,
  title = {Default Logic and Constructive Logic},
  author = {D. Pearce},
  editor = {B. Neumann},
  booktitle = ecai,
  pages = {309-313},
  publisher = wiley,
  year = {1994}
}

@inproceedings{pearce96a,
  title = {A New Logical Characterisation of Stable Models and Answer Sets},
  author = {D. Pearce},
  crossref = {nmelp96},
  doi = {10.1007/BFb0023801},
  pages = {57-70}
}

@article{pearce99a,
  title = {Stable Inference as Intuitionistic Validity},
  author = {D. Pearce},
  journal = jlp,
  number = {1},
  pages = {79-91},
  volume = {38},
  year = {1999}
}

@incollection{pearce99b,
  title = {From here to there: stable negation in logic programming},
  author = {D. Pearce},
  editor = {D. Gabbay and H. Wansing},
  booktitle = {What is negation?},
  pages = {161-181},
  publisher = kluwer,
  year = {1999}
}

@book{pearl88a,
  title = {Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference},
  author = {J. Pearl},
  publisher = m-k,
  year = {1988}
}

@inproceedings{pearl89,
  title = {Probabilistic Semantics for Nonmonotonic Reasoning: A Survey},
  author = {J. Pearl},
  crossref = {kr89},
  pages = {505-516}
}

@incollection{pearl90,
  title = {System {Z}: A Natural Ordering of Defaults with Tractable Applications to Default Reasoning},
  author = {J. Pearl},
  editor = {R. Parikh},
  booktitle = tarc,
  pages = {121-135},
  publisher = m-k,
  year = {1990}
}

@inproceedings{peaval04a,
  title = {Uniform Equivalence for Equilibrium Logic and Logic Programs},
  author = {D. Pearce and A. Valverde},
  crossref = {lpnmr04},
  doi = {10.1007/978-3-540-24609-1\_18},
  pages = {194-206}
}

@inproceedings{peaval04b,
  title = {Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning},
  author = {D. Pearce and A. Valverde},
  crossref = {jelia04},
  doi = {10.1007/978-3-540-30227-8\_15},
  pages = {147-160}
}

@article{peaval05a,
  title = {A First Order Nonmonotonic Extension of Constructive Logic},
  author = {D. Pearce and A. Valverde},
  journal = {Studia Logica},
  number = {2-3},
  pages = {321-346},
  volume = {30},
  year = {2005}
}

@techreport{peaval06a,
  title = {Quantified Equilibrium Logic and the First Order Logic of Here-and-There},
  author = {D. Pearce and A. Valverde},
  institution = {University of M{\'a}laga},
  number = {MA-06-02},
  type = {Technical Report},
  year = {2006}
}

@inproceedings{peaval08a,
  title = {Quantified Equilibrium Logic and Foundations for Answer Set Programs},
  author = {D. Pearce and A. Valverde},
  crossref = {iclp08},
  doi = {10.1007/978-3-540-89982-2\_46},
  pages = {546-560}
}

@inproceedings{peboaa10a,
  title = {Enacting Declarative Languages Using {LTL}: Avoiding Errors and Improving Performance},
  author = {M. Pesic and D. Bosnacki and W. van der Aalst},
  crossref = {spin10},
  pages = {146-161}
}

@inproceedings{pedebr03a,
  title = {Translation of Aggregate Programs to Normal Logic Programs},
  author = {N. Pelov and M. Denecker and M. Bruynooghe},
  crossref = {asp03},
  pages = {29-42}
}

@article{pedebr07a,
  title = {Well-founded and stable semantics of logic programs with aggregates},
  author = {N. Pelov and M. Denecker and M. Bruynooghe},
  journal = tplp,
  number = {3},
  pages = {301-353},
  volume = {7},
  year = {2007}
}

@inproceedings{pediga23a,
  title = {The {CP-SAT-LP} Solver (Invited Talk)},
  author = {L. Perron and F. Didier and S. Gay},
  crossref = {cp23},
  pages = {3:1-3:2}
}

@inproceedings{pednault87a,
  title = {Formulating multi-agent dynamic-world problems in the classical planning framework},
  author = {E. Pednault},
  editor = {M. Georgeff and A. Lansky},
  booktitle = {Reasoning about actions and plans},
  pages = {47-82},
  publisher = m-k,
  year = {1987}
}

@inproceedings{pedomaro13a,
  title = {Real-time train routing and scheduling through mixed integer linear programming: Heuristic approach},
  author = {P. Pellegrini and G. Douchet and G. Marli{\`e}re and J. Rodriguez},
  booktitle = {Proceedings of the International Conference on Industrial Engineering and Systems Management (IESM'13)},
  pages = {1-5},
  year = {2013}
}

@inproceedings{peguva00a,
  title = {A Tableau Calculus for Equilibrium Entailment},
  author = {D. Pearce and I. {de Guzm{\'a}n} and A. Valverde},
  crossref = {tableaux00},
  pages = {352-367}
}

@inproceedings{peltru04a,
  title = {Semantics of Disjunctive Programs with Monotone Aggregates --- an Operator-Based Approach},
  author = {N. Pelov and M. Truszczy{\'n}ski},
  crossref = {nmr04},
  pages = {327-334}
}

@techreport{pelune87,
  title = {The User's Guide to the {BACK} System},
  author = {C. Peltason and K. von Luck and B. Nebel and A. Schmiedel},
  address = {Berlin},
  institution = {Projektgruppe KIT, Fachbereich Informatik, Institut f{\"u}r angewandte Informatik, Technische Universit{\"a}t Berlin},
  number = {42},
  year = {1987}
}

@article{pemapero15a,
  title = {{RECIFE-MILP}: An Effective {MILP}-Based Heuristic for the Real-Time Railway Traffic Management Problem},
  author = {P. Pellegrini and G. Marli{\`e}re and R. Pesenti and J. Rodriguez},
  journal = {IEEE Transactions on Intelligent Transportation Systems},
  number = {5},
  pages = {2609-2619},
  volume = {16},
  year = {2015}
}

@inproceedings{peosmi92a,
  title = {{C}onditional {N}onlinear {P}lanning},
  author = {M. Peot and D. Smith},
  crossref = {aips92},
  pages = {189-197},
  year = {1992}
}

@inproceedings{peputabukuly10a,
  title = {The Seventh {QBF} Solvers Evaluation ({QBFEVAL}'10)},
  author = {C. Peschiera and L. Pulina and A. Tacchella and U. Bubeck and O. Kullmann and I. Lynce},
  crossref = {sat10},
  pages = {237-250}
}

@inproceedings{peqbuc91,
  title = {The Logic of Epistemic Inconsistency},
  author = {T. Pequeno and A. Buchsbaum},
  crossref = {kr91},
  pages = {453-560}
}

@inproceedings{perisi10a,
  title = {A Parallel {ASP} Instantiator Based on {DLV}},
  author = {S. Perri and F. Ricca and M. Sirianni},
  crossref = {damp10},
  pages = {73-82}
}

@inproceedings{peritecive07a,
  title = {An integrated graphic tool for developing and testing DLV programs},
  author = {S. Perri and F. Ricca and G. Terracina and D. Cianni and P. Veltri},
  crossref = {sea07},
  pages = {86-100}
}

@inproceedings{perlis89,
  title = {Circumscription as Introspection},
  author = {D. Perlis},
  booktitle = {Proceedings on the Intel Symposium on Methodologies for intelligent systems.},
  keywords = {circumscription, consistency, default reasoning, introspection},
  origin = {wb_1/90},
  year = {1989}
}

@article{permin86,
  title = {Completeness Results for Circumscription},
  author = {D. Perlis and J. Minker},
  journal = ai,
  pages = {29-42},
  year = {1986}
}

@techreport{perrault87,
  title = {An Application of Default Logic to Speech Act Theory},
  author = {C. Perrault},
  institution = {Stanford University},
  number = {CSLI-87-90},
  year = {1987}
}

@inproceedings{persca03a,
  title = {Advanced Backjumping Techniques for Rule Instantiations},
  author = {S. Perri and F. Scarcello},
  crossref = {agp03},
  pages = {238-251}
}

@inproceedings{pesasctowo02a,
  title = {A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs.},
  author = {D. Pearce and V. Sarsakov and T. Schaub and H. Tompits and S. Woltran},
  crossref = {iclp02},
  pages = {405-420}
}

@article{pesccale07a,
  title = {Enhancing {DLV} Instantiator by Backjumping Techniques},
  author = {S. Perri and F. Scarcello and G. Catalano and N. Leone},
  journal = amai,
  number = {2-4},
  pages = {195-228},
  volume = {51},
  year = {2007}
}

@article{peslsz19a,
  title = {Dependency Learning for {QBF}},
  author = {T. Peitl and F. Slivovsky and S. Szeider},
  journal = jair,
  pages = {180-208},
  volume = {65},
  year = {2019}
}

@inproceedings{pessav02a,
  title = {Reinforcement learning for adaptive routing},
  author = {L. Peshkin and V. Savova},
  booktitle = {Proceedings of the International Joint Conference on Neural Networks (IJCNN'02)},
  pages = {1825-1830},
  volume = {2},
  year = {2002}
}

@misc{petermann88,
  title = {Building in Theories into a First-Order Proof Procedure based on the Connection Method},
  author = {U. Petermann},
  howpublished = {Leipzig University, Naturwissenschaftlich-Theoretisches Zentrum and Department of Informatics, DDR-7010 Leipzig},
  origin = {wb_1/91},
  year = {1988}
}

@inproceedings{petermann90,
  title = {Towards a connection procedure with built in theories},
  author = {U. Petermann},
  booktitle = {European Workshop on Logics in Artificial Intelligence (JELIA'90)},
  publisher = springer,
  year = {1990}
}

@inproceedings{petermann93,
  title = {Completeness of the pool calculus with an open built in theory},
  author = {U. Petermann},
  editor = {G. Gottlob and A. Leitsch and D. Mundici},
  booktitle = kgc,
  number = {713},
  pages = {264-277},
  publisher = springer,
  series = lncs,
  year = {1993}
}

@inproceedings{petowo01a,
  title = {Encodings for Equilibrium Logic and Logic Programs with Nested Expressions},
  author = {D. Pearce and H. Tompits and S. Woltran},
  crossref = {epia01},
  pages = {306-320}
}

@article{petowo09a,
  title = {Characterising equilibrium logic and nested logic programs: Reductions and complexity},
  author = {D. Pearce and H. Tompits and S. Woltran},
  journal = tplp,
  number = {5},
  pages = {565-616},
  volume = {9},
  year = {2009}
}

@inproceedings{petsmi03a,
  title = {Symmetry Breaking in Graceful Graphs},
  author = {K. Petrie and B. Smith},
  crossref = {cp03},
  pages = {930-934}
}

@article{pettersson05a,
  title = {Execution monitoring in robotics: {A} survey},
  author = {O. Pettersson},
  journal = {Robotics and Autonomous Systems},
  number = {2},
  pages = {73-88},
  volume = {53},
  year = {2005}
}

@inproceedings{pfeifer04a,
  title = {Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs},
  author = {G. Pfeifer},
  crossref = {lpnmr04},
  pages = {220-233}
}

@inproceedings{phalmi19a,
  title = {{C-ASP}: Continuous {ASP}-Based Reasoning over {RDF} Streams},
  author = {T. Pham and M. Ali and A. Mileo},
  crossref = {lpnmr19},
  year = {2019}
}

@article{phthsa08a,
  title = {Modelling and solving temporal reasoning as propositional satisfiability},
  author = {D. Pham and J. Thornton and A. Sattar},
  journal = ai,
  number = {15},
  pages = {1752-1782},
  volume = {172},
  year = {2008}
}

@inproceedings{phtrpaha11a,
  title = {A Native and Adaptive Approach for Unified Processing of Linked Streams and Linked Data},
  author = {D. Phuoc and M. Dao-Tran and J. Parreira and M. Hauswirth},
  crossref = {iswc11},
  pages = {370-388}
}

@inproceedings{piatra21a,
  title = {{DMAPF}: {A} Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles},
  author = {P. Pianpak and T. Son},
  crossref = {iclp-tc21},
  pages = {99-112}
}

@inproceedings{pihasa08a,
  title = {Vivifying Propositional Clausal Formulae},
  author = {C. Piette and Y. Hamadi and L. Sais},
  crossref = {ecai08},
  pages = {525-529}
}

@article{pimentel17a,
  title = {Exploring Exploration: A Tutorial Introduction to Embedded Systems Design Space Exploration},
  author = {A. Pimentel},
  journal = {IEEE Design \& Test},
  number = {1},
  pages = {77-90},
  volume = {34},
  year = {2017}
}

@article{pipachchda08a,
  title = {Solving Weighted {M}ax-{SAT} Problems in a Reduced Search Space: A Performance Analysis},
  author = {K. Pipatsrisawat and A. Palyan and M. Chavira and A. Choi and A. Darwiche},
  journal = jsat,
  number = {2-4},
  pages = {191-217},
  volume = {4},
  year = {2008}
}

@inproceedings{pipdar07a,
  title = {A Lightweight Component Caching Scheme for Satisfiability Solvers},
  author = {K. Pipatsrisawat and A. Darwiche},
  crossref = {sat07},
  pages = {294-299}
}

@inproceedings{pipdar08a,
  title = {A New Clause Learning Scheme for Efficient Unsatisfiability Proofs},
  author = {K. Pipatsrisawat and A. Darwiche},
  crossref = {aaai08},
  pages = {1481-1484}
}

@inproceedings{pipdar09a,
  title = {On the Power of Clause-Learning {SAT} Solvers with Restarts},
  author = {K. Pipatsrisawat and A. Darwiche},
  crossref = {cp09},
  pages = {654-668}
}

@article{pipdar11a,
  title = {On the Power of Clause-Learning {SAT} Solvers as Resolution Engines},
  author = {K. Pipatsrisawat and A. Darwiche},
  journal = ai,
  number = {2},
  pages = {512-525},
  volume = {175},
  year = {2011}
}

@inproceedings{pisotoye19a,
  title = {A distributed solver for multi-agent path finding problems},
  author = {P. Pianpak and T. Son and Z. Toups and W. Yeoh},
  booktitle = {Proceedings of the First International Conference on Distributed Artificial Intelligence (DAI'19)},
  pages = {2:1-2:7},
  publisher = acm,
  year = {2019}
}

@incollection{pisrop10a,
  title = {Large Neighborhood Search},
  author = {D. Pisinger and S. Ropke},
  editor = {M. Gendreau and J. Potvin},
  booktitle = {Handbook of Metaheuristics},
  pages = {399-419},
  publisher = springer,
  series = {International Series in Operations Research \& Management Science},
  volume = {146},
  year = {2010}
}

@inproceedings{pistra01a,
  title = {Planning as Model Checking for Extended Goals in Non-deterministic Domains},
  author = {M. Pistore and P. Traverso},
  crossref = {ijcai01},
  pages = {479-486}
}

@article{plagre86a,
  title = {A Structure-preserving Clause Form Translation},
  author = {D. Plaisted and S. Greenbaum},
  journal = jsc,
  pages = {293-304},
  volume = {2},
  year = {1986}
}

@article{plaisted82,
  title = {A simplified problem reduction format},
  author = {D. Plaisted},
  journal = ai,
  pages = {227-261},
  volume = {18},
  year = {1982}
}

@inproceedings{pnueli77a,
  title = {The Temporal Logic of Programs},
  author = {A. Pnueli},
  crossref = {focs77},
  doi = {10.1109/SFCS.1977.32},
  pages = {46-57}
}

@inproceedings{pobabe03a,
  title = {Non-monotonic reasoning on {B}eowulf platforms},
  author = {E. Pontelli and M. Balduccini and F. Bermudez},
  editor = {V. Dahl and P. Wadler},
  booktitle = {Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL'03)},
  pages = {37-57},
  publisher = springer,
  series = lnai,
  volume = {2562},
  year = {2003}
}

@incollection{pobrla05a,
  title = {Jadex: A {BDI} reasoning engine},
  author = {A. Pokahr and L. Braubach and W. Lamersdorf},
  booktitle = {Multi-agent programming},
  pages = {149-174},
  publisher = springer,
  year = {2005}
}

@incollection{pogoal87,
  title = {Theorist: A Logical Reasoning System for Defaults and Diagnosis},
  author = {D. Poole and R. Goebel and R. Aleliunas},
  editor = {N. Cercone and G. McCalla},
  booktitle = {The Knowledge Frontier: Essays in the Representation of Knowledge},
  chapter = {13},
  pages = {331-352},
  publisher = springer,
  year = {1987}
}

@inproceedings{ponson06a,
  title = {Justifications for Logic Programs under Answer Set Semantics},
  author = {E. Pontelli and T. Son},
  crossref = {iclp06}
}

@inproceedings{poogoe86,
  title = {Gracefully adding negation and disjunction to {P}ROLOG},
  author = {D. Poole and R. Goebel},
  editor = {E. Shapiro},
  booktitle = iclp,
  pages = {635-641},
  publisher = springer,
  year = {1986}
}

@inproceedings{poole85,
  title = {On the Comparison of Theories: Preferring the Most Specific Explanation},
  author = {D. Poole},
  booktitle = ijcai,
  pages = {144-147},
  year = {1985}
}

@techreport{poole87a,
  title = {Defaults and Conjectures: Hypothetical Reasoning for Explanation and Prediction},
  author = {D. Poole},
  address = {Waterloo, Ontario, Canada},
  institution = {Faculty of Mathematics, University of Waterloo},
  number = {CS-87-54},
  year = {1987}
}

@techreport{poole87b,
  title = {A Logical Framework for Default Reasoning},
  author = {D. Poole},
  address = {Waterloo, Ontario, Canada},
  institution = {Faculty of Mathematics, University of Waterloo},
  number = {CS-87-59},
  year = {1987}
}

@inproceedings{poole87c,
  title = {Variables in Hypotheses},
  author = {D. Poole},
  booktitle = ijcai,
  pages = {905-908},
  publisher = m-k,
  year = {1987}
}

@manual{poole87d,
  title = {A Theorist to {P}rolog Compiler},
  author = {D. Poole},
  organization = {Logic Programming and Artificial Intelligence Group, Department of Computer Science, University of Waaterloo},
  year = {1987}
}

@article{poole88,
  title = {A Logical Framework for Default Reasoning},
  author = {D. Poole},
  journal = ai,
  pages = {27-47},
  volume = {36},
  year = {1988}
}

@inproceedings{poole89,
  title = {What the Lottery Paradox tells us about Default Reasoning},
  author = {D. Poole},
  crossref = {kr89},
  pages = {333-340}
}

@article{poole89b,
  title = {Explanation and Prediction: An Architecture for Default and Abductive Reasoning},
  author = {D. Poole},
  journal = ci,
  pages = {97-110},
  volume = {5},
  year = {1989}
}

@techreport{poole89c,
  title = {Explanation and Prediction: An Architecture for Default and Abductive Reasoning},
  author = {D. Poole},
  institution = {Department of Computer Science, University of British Columbia},
  number = {89-4},
  type = {Technical Report},
  year = {1989}
}

@inproceedings{poole90,
  title = {Dialectics and Specificity: Conditioning in Logic-based Hypothetical Reasoning (Preliminary Report)},
  author = {D. Poole},
  crossref = {nmr90},
  pages = {201-208}
}

@article{poole91a,
  title = {The effect of knowledge on belief: conditioning, specificity, and the lottery paradox in default reasoning},
  author = {D. Poole},
  journal = ai,
  pages = {281-307},
  volume = {49},
  year = {1991}
}

@article{poole91b,
  title = {Compiling a Default Reasoning System into {P}rolog},
  author = {D. Poole},
  journal = ngc,
  number = {1},
  pages = {3-38},
  volume = {9},
  year = {1991}
}

@article{poole93a,
  title = {Probabilistic Horn abduction and Bayesian networks},
  author = {D. Poole},
  journal = ai,
  number = {1},
  pages = {81-129},
  volume = {64},
  year = {1993}
}

@incollection{poole94a,
  title = {Default Logic},
  author = {D. Poole},
  editor = {D. Gabbay and C. Hogger and J. Robinson},
  booktitle = {Handbook of Logic in Artificial Intelligence and Logic Programming},
  pages = {189-215},
  publisher = {Oxford University Press},
  volume = {1},
  year = {1994}
}

@book{poomac10a,
  title = {Artificial Intelligence: Foundations of Computational Agents},
  author = {D. Poole and A. Mackworth},
  address = {New York, NY, USA},
  publisher = cup,
  year = {2010}
}

@inproceedings{porohecarosa20a,
  title = {Lagrangian Decomposition for Classical Planning (Extended Abstract)},
  author = {F. Pommerening and G. R{\"o}ger and M. Helmert and H. Cambazard and L. Rousseau and D. Salvagnin},
  crossref = {ijcai20},
  pages = {4770-4774}
}

@misc{potassco,
  title = {Potassco website},
  key = {potassco},
  url = {https://potassco.org}
}

@misc{potasscoManual,
  title = {A User's Guide to \texttt{gringo}, \texttt{clasp}, \texttt{clingo}, and \texttt{iclingo}},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Ostrowski and T. Schaub and S. Thiele},
  key = {potassco},
  url = {http://potassco.org}
}

@manual{PotasscoUserGuide,
  title = {Potassco User Guide},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Lindauer and M. Ostrowski and J. Romero and T. Schaub and S. Thiele},
  edition = {2},
  organization = uofp,
  url = {http://potassco.org},
  year = {2015}
}

@manual{PotasscoUserGuide19,
  title = {Potassco User Guide},
  author = {M. Gebser and R. Kaminski and B. Kaufmann and M. Lindauer and M. Ostrowski and J. Romero and T. Schaub and S. Thiele and P. Wanko},
  edition = {Version 2.2.0},
  publisher = uofp,
  url = {http://potassco.org},
  year = {2019}
}

@inproceedings{poubou03a,
  title = {Bounded Finite State Controllers},
  author = {P. Poupart and C. Boutilier},
  editor = {S. Thrun and L. Saul and B. Sch{\"o}lkopf},
  booktitle = {Proceedings of the Sixteenth Annual Conference on Neural Information Processing Systems (NIPS'03)},
  pages = {823-830},
  publisher = {MIT Press},
  year = {2003}
}

@inproceedings{powide11a,
  title = {A Prototype of a Knowledge-Based Programming Environment},
  author = {S. {D}e Pooter and J. Wittocx and M. Denecker},
  crossref = {inapwlp11},
  pages = {279-286}
}

@book{prakken97a,
  title = {Logical Tools for Modelling Legal Argument},
  author = {H. Prakken},
  publisher = kluwer,
  year = {1997}
}

@article{pramin96,
  title = {Using Priorities to Combine Knowledge Bases},
  author = {S. Pradhan and J. Minker},
  journal = {International Journal of Cooperative Information Systems},
  number = {2-3},
  pages = {333-364},
  volume = {5},
  year = {1996}
}

@inproceedings{pratt76a,
  title = {Semantical Consideration on Floyd-Hoare Logic},
  author = {V. Pratt},
  booktitle = {Proceedings of the Seventeenth Annual Symposium on Foundations of Computer Science (SFCS'76)},
  pages = {109-121},
  publisher = ieee,
  year = {1976}
}

@book{prawitz65,
  title = {Natural Deduction},
  author = {D. Prawitz},
  publisher = {Almqvist \& Wiksell, Stockholm},
  year = {1965}
}

@article{prcodideetdaevthcabosito14a,
  title = {The genome-scale metabolic network of Ectocarpus siliculosus (EctoGEM): a resource to study brown algal physiology and beyond},
  author = {S. Prigent and G. Collet and S. Dittami and L. Delage and F. {Ethis de Corny} and O. Dameron and D. Eveillard and S. Thiele and J. Cambefort and C. Boyen and A. Siegel and T. Tonon},
  journal = {The Plant Journal},
  number = {2},
  pages = {367-381},
  volume = {80},
  year = {2014}
}

@inproceedings{pretolani96a,
  title = {Efficiency and stability of Hypergraph {SAT} algorithms},
  author = {D. Pretolani},
  editor = {D. Johnson and M. Trick},
  booktitle = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  pages = {479-498},
  publisher = {American Mathematical Society},
  volume = {26},
  year = {1996}
}

@article{priest79a,
  title = {Logic of paradox},
  author = {G. Priest},
  journal = {Journal of Philosophical Logic},
  pages = {219-241},
  volume = {8},
  year = {1979}
}

@article{priest89a,
  title = {Reasoning about Truth},
  author = {G. Priest},
  journal = ai,
  pages = {231-244},
  volume = {39},
  year = {1989}
}

@book{primio95,
  title = {Methoden der K{\"u}nstlichen Intelligenz f{\"u}r Grafikanwendungen},
  editor = {F. di Primio},
  note = {In German.},
  publisher = addison,
  year = {1995}
}

@techreport{prismo93,
  title = {Optimality Theory: Constraint interaction in generative grammar},
  author = {A. Prince and P. Smolensky},
  institution = {University of Colorado, Boulder},
  year = {1993}
}

@book{prrono89,
  title = {Paraconsistent Logics},
  editor = {G. Priest and R. Routley and J. Norman},
  publisher = {Philosophica Verlag},
  year = {1989}
}

@article{prycol96a,
  title = {Planning for Contingencies: {A} Decision-based Approach},
  author = {L. Pryor and G. Collins},
  journal = jair,
  pages = {287-339},
  volume = {4},
  year = {1996}
}

@inproceedings{przprz92a,
  title = {Stationary default extensions},
  author = {H. Przymusinska and T. Przymusinski},
  crossref = {nmr92},
  pages = {179-193}
}

@article{przprz94a,
  title = {Stationary Default Extensions},
  author = {H. Przymusinska and T. Przymusinski},
  journal = {Fundamenta Informaticae},
  number = {1-2},
  pages = {76-87},
  volume = {21},
  year = {1994}
}

@incollection{przymusinski88a,
  title = {On the Declarative Semantics of Deductive Databases and Logic Programs},
  author = {T. Przymusinski},
  editor = {J. Minker},
  booktitle = {Foundations of Deductive Databases and Logic Programming},
  pages = {193-216},
  publisher = m-k,
  year = {1988}
}

@inproceedings{przymusinski88b,
  title = {Perfect Model Semantics},
  author = {T. Przymusinski},
  crossref = {iclp88},
  pages = {1081-1096}
}

@article{przymusinski89a,
  title = {An algorithm to compute circumscription},
  author = {T. Przymusinski},
  journal = ai,
  number = {1},
  pages = {49-73},
  volume = {38},
  year = {1989}
}

@article{przymusinski91a,
  title = {Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs},
  author = {T. Przymusinski},
  journal = ai,
  number = {1-3},
  pages = {309-343},
  volume = {49},
  year = {1991}
}

@article{pultac09a,
  title = {A self-adaptive multi-engine solver for quantified {B}oolean formulas},
  author = {L. Pulina and A. Tacchella},
  journal = {Constraints},
  number = {1},
  pages = {80-116},
  volume = {14},
  year = {2009}
}

@article{purdom70a,
  title = {A Transitive Closure Algorithm},
  author = {P. Purdom},
  journal = {BIT Numerical Mathematics},
  pages = {76-94},
  volume = {10},
  year = {1970}
}

@incollection{qucacacofrmapo10a,
  title = {Intelligent adaptive monitoring for cardiac surveillance},
  author = {R. Quiniou and L. Callens and G. Carrault and M. Cordier and E. Fromont and P. Mabo and F. Portet},
  editor = {I. Bichindarritz and S. Vaidya and A. Jain and L. Jain},
  booktitle = {Computational Intelligence in Healthcare 4},
  pages = {329-346},
  publisher = springer,
  series = {Studies in Computational Intelligence},
  volume = {309},
  year = {2010}
}

@inproceedings{qugecofafolebewhng09a,
  title = {{ROS}: an open-source Robot Operating System},
  author = {M. Quigley and B. Gerkey and K. Conley and J. Faust and T. Foote and J. Leibs and E. Berger and R. Wheeler and A. Ng},
  booktitle = {{ICRA} Workshop on {OSS}},
  year = {2009}
}

@inproceedings{rabten15a,
  title = {{CAQE:} {A} Certifying {QBF} Solver},
  author = {M. Rabe and L. Tentrup},
  crossref = {fmcad15},
  pages = {136-143}
}

@inproceedings{radogm06a,
  title = {Exact solutions of interactive {POMDP}s using behavioral equivalence},
  author = {B. Rathnasabapathy and P. Doshi and P. Gmytrasiewicz},
  crossref = {aamas06},
  pages = {1025-1032}
}

@misc{radzikowska94,
  title = {Three-Valued Default Logic and Circumscription},
  author = {A. Radzikowska},
  year = {1994}
}

@article{radzikowska96a,
  title = {A three-valued approach to default logic},
  author = {A. Radzikowska},
  journal = jancl,
  number = {2},
  pages = {149-190},
  volume = {6},
  year = {1996}
}

@book{rahsim09a,
  title = {Argumentation in Artificial Intelligence},
  editor = {I. Rahwan and G. Simari},
  publisher = springer,
  year = {2009}
}

@inproceedings{rakaroscbogu18a,
  title = {Computing Diverse Boolean Networks from Phosphoproteomic Time Series Data},
  author = {M. Razzaq and R. Kaminski and J. Romero and T. Schaub and J. Bourdon and C. Guziolowski},
  booktitle = {Proceedings of the Sixteenth International Conference on Computational Methods in Systems Biology (CMSB'18)},
  crossref = {cmsb18},
  pages = {59-74}
}

@article{rangha15a,
  title = {{ITSAT}: An Efficient {SAT}-Based Temporal Planner},
  author = {M. Rankooh and G. Ghassem-Sani},
  journal = jair,
  pages = {541-632},
  volume = {53},
  year = {2015}
}

@incollection{rao96a,
  title = {AgentSpeak (L): BDI agents speak out in a logical computable language},
  author = {A. Rao},
  booktitle = {Agents Breaking Away},
  pages = {42-55},
  publisher = springer,
  year = {1996}
}

@article{rascwachliso23a,
  title = {Solving an Industrial-Scale Warehouse Delivery Problem with Answer Set Programming Modulo Difference Constraints},
  author = {D. Rajaratnam and T. Schaub and P. Wanko and K. Chen and S. Liu and T. Son},
  article-number = {216},
  doi = {10.3390/a16040216},
  journal = {Algorithms},
  number = {4},
  url = {https://www.mdpi.com/1999-4893/16/4/216},
  volume = {16},
  year = {2023}
}

@inproceedings{rasoin10a,
  title = {Analyzing Pathways Using {ASP}-Based Approaches},
  author = {O. Ray and T. Soh and K. Inoue},
  crossref = {anb10},
  pages = {167-183}
}

@inproceedings{ratama04a,
  title = {A Comparative Study of {2QBF} Algorithms},
  author = {D. Ranjan and D. Tang and S. Malik},
  booktitle = {Electronic Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04)},
  url = {http://www.satisfiability.org/SAT04/programme/113.pdf},
  year = {2004}
}

@book{ravindran08a,
  title = {Operations Research and Management Science Handbook},
  editor = {A. Ravindran},
  publisher = {CRC Press},
  year = {2008}
}

@inproceedings{rawhki09a,
  title = {A nonmonotonic logical approach for modelling and revising metabolic networks},
  author = {O. Ray and K. Whelan and R. King},
  crossref = {cisis09},
  pages = {25-829}
}

@inproceedings{rawhki10a,
  title = {Logic-Based Steady-State Analysis and Revision of Metabolic Networks with Inhibition},
  author = {O. Ray and K. Whelan and R. King},
  crossref = {cisis10},
  pages = {661-666}
}

@inproceedings{raygin08a,
  title = {The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions},
  author = {K. Ray and M. Ginsberg},
  editor = {J. Rintanen and B. Nebel and J. Beck and E. Hansen},
  booktitle = {Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS'08)},
  pages = {280-287},
  publisher = {{AAAI} Press},
  year = {2011}
}

@book{read89,
  title = {Relevant Logic. A Philosophical Examination of Inference},
  author = {S. Read},
  publisher = {Basil Blackwell},
  year = {1989}
}

@article{redl16a,
  title = {The dlvhex system for knowledge representation: recent advances (system description)},
  author = {C. Redl},
  doi = {10.1017/S1471068416000211},
  journal = tplp,
  number = {5-6},
  pages = {866-883},
  publisher = cup,
  volume = {16},
  year = {2016}
}

@inproceedings{redrbr89,
  title = {On the Relation between Truth Maintenance and Autoepistemic Logic},
  author = {M. Reinfrank and O. Dressler and G. Brewka},
  booktitle = ijcai,
  pages = {1206-1212},
  year = {1989}
}

@inproceedings{regvor19a,
  title = {Induction in Saturation-Based Proof Search},
  author = {G. Reger and A. Voronkov},
  crossref = {cade19},
  pages = {477-494}
}

@inproceedings{reicri81,
  title = {On Interacting Defaults},
  author = {R. Reiter and G. Criscuolo},
  booktitle = ijcai,
  pages = {270-276},
  year = {1981}
}

@inproceedings{reidek87,
  title = {Foundations of Assumption-based Truth Maintenance Systems},
  author = {R. Reiter and J. de Kleer},
  booktitle = aaai,
  pages = {183-188},
  year = {1987}
}

@techreport{reidre88,
  title = {On the Relation between Truth Maintenance and Nonmonotonic Logics},
  author = {M. Reinfrank and O. Dressler},
  address = {Munich},
  institution = {Siemens},
  number = {INF 2 ARM-11-88},
  type = {Report},
  year = {1988}
}

@techreport{reinfrank85,
  title = {An Introduction to Nonmonotonic Reasoning},
  author = {M. Reinfrank},
  institution = {Universit{\"a}t Kaiserslautern},
  number = {MEMO-SEKI-85-02},
  type = {Technical Report},
  year = {1985}
}

@techreport{reinfrank88,
  title = {Lecture Notes on Truth Maintenance, Part I, Fundamentals},
  author = {M. Reinfrank},
  address = {Munich},
  institution = {Siemens},
  number = {INF 2 ARM-5-88},
  type = {Report},
  year = {1988}
}

@article{reinfrank89b,
  title = {Formeln und Modelle: Wissensrepr{\"a}sentation mit Logik},
  author = {M. Reinfrank},
  journal = {Informationstechnik},
  number = {2},
  pages = {101-112},
  volume = {31},
  year = {1989}
}

@book{reiter01a,
  title = {Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems.},
  author = {R. Reiter},
  publisher = {MIT Press},
  year = {2001}
}

@incollection{reiter77a,
  title = {On Closed World Data Bases},
  author = {R. Reiter},
  editor = {H. Gallaire and J. Minker},
  booktitle = {Proceedings of Workshop on Logic and Databases},
  pages = {119-140},
  publisher = {Plenum Press},
  year = {1977}
}

@incollection{reiter78a,
  title = {On Closed World Data Bases},
  author = {R. Reiter},
  editor = {H. Gallaire and J. Minker},
  address = {New York},
  booktitle = {Logic and Databases},
  pages = {55-76},
  publisher = {Plenum Press},
  year = {1978}
}

@article{reiter80a,
  title = {A Logic for Default Reasoning},
  author = {R. Reiter},
  journal = ai,
  number = {1-2},
  pages = {81-132},
  volume = {13},
  year = {1980}
}

@inproceedings{reiter82a,
  title = {Circumscription Implies Predicate Completion (Sometimes)},
  author = {R. Reiter},
  booktitle = {Proceedings of the National Conference on Artificial Intelligence},
  pages = {418-420},
  year = {1982}
}

@incollection{reiter84a,
  title = {Towards a logical reconstruction of relational database theory},
  author = {R. Reiter},
  editor = {M. Brodie and J. Myopoulos and J. Schmidt},
  booktitle = {On conceptual modeling: Perspectives from Artificial Intelligence, Datbases and Programming Languages},
  pages = {191-233},
  publisher = springer,
  year = {1984}
}

@article{reiter87a,
  title = {Nonmonotonic Reasoning},
  author = {R. Reiter},
  journal = {Annual Review of Computer Science},
  pages = {147-187},
  volume = {2},
  year = {1987}
}

@article{reiter87b,
  title = {A Theory of Diagnosis from First Principles},
  author = {R. Reiter},
  journal = ai,
  number = {1},
  pages = {57-96},
  volume = {32},
  year = {1987}
}

@techreport{reiter90a,
  title = {What should a database know?},
  author = {R. Reiter},
  institution = {Department of Computer Science, University of Toronto},
  year = {1990}
}

@inproceedings{reiter90b,
  title = {On Asking What a Database Knows},
  author = {R. Reiter},
  editor = {J. Lloyd},
  booktitle = {Computational Logic},
  pages = {96-113},
  publisher = springer,
  year = {1990}
}

@incollection{reiter91a,
  title = {The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression},
  author = {R. Reiter},
  crossref = {jm64},
  pages = {359-380}
}

@inproceedings{reiter92a,
  title = {Twelve Years of Nonmonotonic Reasoning Research: Where (and What) Is the beef?},
  author = {R. Reiter},
  crossref = {kr92},
  pages = {789}
}

@article{reruth08a,
  title = {Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework},
  author = {E. Remy and P. Ruet and D. Thieffry},
  journal = {Advances in Applied Mathematics},
  number = {3},
  pages = {335-350},
  volume = {41},
  year = {2008}
}

@book{resbra80,
  title = {The Logic of Inconsistency},
  author = {N. Rescher and R. Brandom},
  publisher = {Blackwell},
  year = {1980}
}

@inproceedings{ricca03a,
  title = {A Java Wrapper for {DLV}},
  author = {F. Ricca},
  crossref = {asp03}
}

@article{riccom07a,
  title = {Necessary conditions for multistationarity in discrete dynamical systems},
  author = {A. Richard and J. Comet},
  journal = {Discrete Applied Mathematics},
  number = {18},
  pages = {2403-2413},
  volume = {155},
  year = {2007}
}

@article{rice76a,
  title = {The Algorithm Selection Problem},
  author = {J. Rice},
  journal = {Advances in Computers},
  pages = {65-118},
  volume = {15},
  year = {1976}
}

@article{richardson53,
  title = {Solutions of Irreflexive Relations},
  author = {M. Richardson},
  journal = {Annals of Mathematics},
  pages = {573-590},
  volume = {3},
  year = {1953}
}

@inproceedings{richel09a,
  title = {Preferred Operators and Deferred Evaluation in Satisficing Planning},
  author = {S. Richter and M. Helmert},
  crossref = {icaps09}
}

@book{richter78,
  title = {Logikkalk{\"u}le},
  author = {M. Richter},
  publisher = {Teubner Studienb{\"u}cher},
  year = {1978}
}

@article{ricwes10a,
  title = {The {LAMA} Planner: Guiding Cost-Based Anytime Planning with Landmarks},
  author = {S. Richter and M. Westphal},
  journal = jair,
  pages = {127-177},
  volume = {39},
  year = {2010}
}

@inproceedings{ridofrba16a,
  title = {Improving Performance by Reformulating {PDDL} into a Bagged Representation},
  author = {P. Riddle and J. Douglas and S. Franco and M. Barley},
  editor = {J. Benton and D. Bryce and M. Katz and N. Lipovetzky and C. Muise and M. Ram{\i}rez and {\'A}. Torralba},
  booktitle = {Proceedings of the Eighth Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP)},
  pages = {28-36},
  year = {2016}
}

@article{rifale06a,
  title = {A Backjumping Technique for Disjunctive Logic Programming},
  author = {F. Ricca and W. Faber and N. Leone},
  journal = aicom,
  number = {2},
  pages = {155-172},
  url = {http://www.wfaber.com/research/papers/aicom-bj.pdf},
  volume = {19},
  year = {2006}
}

@article{rigascdegrle09a,
  title = {{OntoDLV}: An {ASP}-based System for Enterprise Ontologies},
  author = {F. Ricca and L. Gallucci and R. Schindlauer and T. Dell'Armi and G. Grasso and N. Leone},
  journal = jlc,
  number = {4},
  pages = {643-670},
  volume = {19},
  year = {2009}
}

@article{rigralmaliiile12a,
  title = {Team-building with answer set programming in the {G}ioia-{T}auro seaport},
  author = {F. Ricca and G. Grasso and M. Alviano and M. Manna and V. Lio and S. Iiritano and N. Leone},
  journal = tplp,
  number = {3},
  pages = {361-381},
  volume = {12},
  year = {2012}
}

@inproceedings{riheni04a,
  title = {Parallel Encodings of Classical Planning as Satisfiability},
  author = {J. Rintanen and K. Heljanko and I. Niemel{\"a}},
  crossref = {jelia04},
  pages = {307-319}
}

@article{riheni06a,
  title = {Planning as satisfiability: parallel plans and algorithms for plan search},
  author = {J. Rintanen and K. Heljanko and I. Niemel{\"a}},
  journal = ai,
  number = {12-13},
  pages = {1031-1080},
  volume = {170},
  year = {2006}
}

@inproceedings{riinbo13a,
  title = {Combining Answer Set Programs for Adaptive and Reactive Reasoning},
  author = {T. Ribeiro and K. Inoue and G. Bourgne},
  crossref = {iclp-tc13}
}

@inproceedings{rintanen00a,
  title = {An Iterative Algorithm for Synthesizing Invariants},
  author = {J. Rintanen},
  crossref = {aaai00},
  pages = {806-811}
}

@inproceedings{rintanen08a,
  title = {Regression for Classical and Nondeterministic Planning},
  author = {J. Rintanen},
  crossref = {ecai08},
  pages = {568-572}
}

@incollection{rintanen09a,
  title = {Planning and {SAT}},
  author = {J. Rintanen},
  chapter = {15},
  crossref = {SATHandbook},
  pages = {483-504}
}

@inproceedings{rintanen10a,
  title = {Heuristics for Planning with {SAT}},
  author = {J. Rintanen},
  crossref = {cp10},
  pages = {414-428}
}

@inproceedings{rintanen10b,
  title = {Heuristic Planning with {SAT}: Beyond Uninformed Depth-First Search},
  author = {J. Rintanen},
  crossref = {ausai10},
  pages = {415-424}
}

@inproceedings{rintanen11a,
  title = {Planning with {SAT}, Admissible Heuristics and {A}$^*$},
  author = {J. Rintanen},
  crossref = {ijcai11},
  pages = {2015-2020}
}

@article{rintanen12a,
  title = {Planning as satisfiability: heuristics},
  author = {J. Rintanen},
  journal = ai,
  pages = {45-86},
  volume = {193},
  year = {2012}
}

@inproceedings{rintanen12b,
  title = {Engineering Efficient Planners with {SAT}},
  author = {J. Rintanen},
  crossref = {ecai12},
  pages = {684-689}
}

@inproceedings{rintanen14a,
  title = {Madagascar: Scalable Planning with {SAT}},
  author = {J. Rintanen},
  crossref = {ipc14},
  pages = {66-70}
}

@inproceedings{rintanen94a,
  title = {Prioritized Autoepistemic Logic},
  author = {J. Rintanen},
  editor = {C. MacNish and D. Pearce and L. Pereira},
  booktitle = {Proceedings of the European Workshop on Logics in Artificial Intelligence},
  pages = {232-246},
  publisher = springer,
  series = lnai,
  volume = {838},
  year = {1994}
}

@inproceedings{rintanen95,
  title = {On Specificity in Default Logic},
  author = {J. Rintanen},
  booktitle = ijcai,
  pages = {1474-1479},
  publisher = m-k,
  year = {1995}
}

@article{rintanen98a,
  title = {Complexity of Prioritized Default Logics},
  author = {J. Rintanen},
  journal = jair,
  pages = {423-461},
  volume = {9},
  year = {1998}
}

@article{rintanen98b,
  title = {Lexicographic Priorities in Default Logic},
  author = {J. Rintanen},
  journal = ai,
  pages = {221-265},
  volume = {106},
  year = {1998}
}

@inproceedings{rintanen98c,
  title = {A Planning Algorithm Not Based on Directional Search},
  author = {J. Rintanen},
  crossref = {kr98},
  pages = {617-625}
}

@article{rintanen99b,
  title = {Constructing Conditional Plans by a Theorem-Prover},
  author = {J. Rintanen},
  journal = jair,
  pages = {323-352},
  volume = {10},
  year = {1999}
}

@misc{risch92,
  title = {A Tableaux-Based Method for {{\L}}ukaszewicz' Variant of Default Logic},
  author = {V. Risch},
  howpublished = {Unpublished.},
  year = {1992}
}

@phdthesis{risch93,
  title = {Les Tableaux Analytiques au Service des Logiques de Defauts},
  author = {V. Risch},
  address = {G.I.A., Parc Scientifique et Technologique de Luminy},
  school = {Universite Aix-Marseille II},
  year = {1993}
}

@misc{risch95,
  title = {On the cumulativity of justified default logic},
  author = {V. Risch},
  howpublished = {Unpublished manuscript},
  year = {1995}
}

@inproceedings{risch95a,
  title = {Yet some more considerations on cumulativity in default logics},
  author = {V. Risch},
  crossref = {ecsqaru95},
  pages = {364-378}
}

@article{risch96a,
  title = {Analytic Tableaux for Default Logics},
  author = {V. Risch},
  journal = jancl,
  number = {1},
  pages = {71-88},
  volume = {6},
  year = {1996}
}

@article{risdec00a,
  title = {Resolution versus Search: Two Strategies for {SAT}},
  author = {I. Rish and R. Dechter},
  journal = jar,
  number = {1-2},
  pages = {225-275},
  volume = {24},
  year = {2000}
}

@article{robinson65a,
  title = {A Machine-Oriented Logic Based on the Resolution Principle},
  author = {J. Robinson},
  journal = jacm,
  number = {1},
  pages = {23-41},
  volume = {12},
  year = {1965}
}

@article{robinson65b,
  title = {Automatic deduction with hyper-resolution},
  author = {J. Robinson},
  journal = {International Journal of Computer Mathematics},
  pages = {227-234},
  volume = {1},
  year = {1965}
}

@article{rodriguez07a,
  title = {A constraint programming model for real-time train scheduling at junctions},
  author = {J. Rodriguez},
  journal = {Transportation Research Part B: Methodological},
  number = {2},
  pages = {231-245},
  volume = {41},
  year = {2007}
}

@incollection{rodriguez12a,
  title = {Scheduling theory and constraint programming applied to rail traffic management},
  author = {J. Rodriguez},
  booktitle = {Farewell address to Professor Ingo Hansen},
  pages = {133-145},
  publisher = {Technical University Delft},
  url = {https://hal.archives-ouvertes.fr/hal-00959593/file/rodriguez.pdf},
  year = {2012}
}

@inproceedings{roeireri15a,
  title = {Constraint Answer Set Programming Based on {HEX}-Programs},
  author = {A. {D}e Rosis and T. Eiter and C. Redl and F. Ricca},
  crossref = {aspocp15}
}

@inproceedings{roeser05a,
  title = {Minimal and Absent Information in Contexts},
  author = {F. Roelofsen and L. Serafini},
  crossref = {ijcai05},
  pages = {558-563}
}

@inproceedings{roghel10a,
  title = {The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning},
  author = {G. R{\"o}ger and M. Helmert},
  crossref = {icaps10},
  pages = {246-249}
}

@article{rogima10a,
  title = {Solving satisfiability problems with preferences},
  author = {E. {D}i Rosa and E. Giunchiglia and M. Maratea},
  journal = {Constraints},
  number = {4},
  pages = {485-515},
  volume = {15},
  year = {2010}
}

@inproceedings{rogrphsa09a,
  title = {{SAT}-Based Parallel Planning Using a Split Representation of Actions},
  author = {N. Robinson and C. Gretton and D. Pham and A. Sattar},
  crossref = {icaps09},
  pages = {281-288}
}

@inproceedings{romero17a,
  title = {asprin: Answer Set Programming with Preferences},
  author = {J. Romero},
  editor = {B. Mitschang and N. Ritter and H. Schwarz and M. Klettke and A. Thor and O. Kopp and M. Wieland},
  booktitle = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW'17)},
  pages = {159-162},
  publisher = {Gesellschaft f{\"u}r Informatik e.V.},
  year = {2017}
}

@article{roos92,
  title = {A logic for reasoning with inconsistent knowledge},
  author = {N. Roos},
  journal = ai,
  pages = {69-103},
  volume = {57},
  year = {1992}
}

@inproceedings{rosath14a,
  title = {Solving the Inferential Frame Problem in the General Game Description Language},
  author = {J. Romero and A. Saffidine and M. Thielscher},
  crossref = {aaai14},
  pages = {515-521}
}

@inproceedings{roscso17a,
  title = {Generalized Answer Set Planning with Incomplete Information},
  author = {J. Romero and T. Schaub and T. Son},
  crossref = {aspocp17}
}

@inproceedings{roscst22a,
  title = {On the Generalization of Learned Constraints for {ASP} Solving in Temporal Domains},
  author = {J. Romero and T. Schaub and K. Strauch},
  crossref = {ruleml22},
  doi = {10.1007/978-3-031-21541-4_2},
  pages = {20-37}
}

@article{roscst24a,
  title = {On the Generalization of Learned Constraints for {ASP} Solving in Temporal Domains},
  author = {J. Romero and T. Schaub and K. Strauch},
  journal = tplp,
  note = {To appear; available at \url{https://arxiv.org/abs/2401.16124}},
  year = {2024}
}

@inproceedings{roscwa16a,
  title = {Computing Diverse Optimal Stable Models},
  author = {J. Romero and T. Schaub and P. Wanko},
  crossref = {iclp-lipics16},
  pages = {3:1-3:14}
}

@misc{roscwa16b,
  title = {Computing Diverse Optimal Stable Models (Extended Version)},
  author = {J. Romero and T. Schaub and P. Wanko},
  note = {Extended version of~\cite{roscwa16a}},
  url = {http://www.cs.uni-potsdam.de/wv/publications/},
  year = {2016}
}

@article{rosgiu13a,
  title = {Combining approaches for solving satisfiability problems with qualitative preferences},
  author = {E. {D}i Rosa and E. Giunchiglia},
  journal = aicom,
  number = {4},
  pages = {395-408},
  volume = {26},
  year = {2013}
}

@article{ross94a,
  title = {Modular Stratification and Magic Sets for {D}atalog Programs with Negation},
  author = {K. Ross},
  journal = jacm,
  number = {6},
  pages = {1216-1266},
  volume = {41},
  year = {1994}
}

@inproceedings{rotsch93a,
  title = {A computational approach to default logics},
  author = {A. Rothschild and T. Schaub},
  editor = {G. Brewka and C. Witteveen},
  booktitle = {Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications},
  pages = {1-14},
  volume = {2},
  year = {1993}
}

@inproceedings{rotsch93b,
  title = {A method for query-answering in default logics},
  author = {A. Rothschild and T. Schaub},
  editor = {R. Soto and J. S{\'a}nchez},
  booktitle = {Proceedings of the Seventh International Symposium on Artificial Intelligence},
  note = {Also in: Marco Schaerf, editor. Proceedings of the Workshop on Algorithms, Complexity and Commonsense Reasoning, held in conjunction with ECAI-94},
  pages = {166-173},
  publisher = {ITESM Press},
  year = {1994}
}

@book{rott01a,
  title = {Change, Choice and Inference - A Study of Belief Revision and Nonmonotonic Reasoning},
  author = {H. Rott},
  publisher = {Oxford: Clarendon Press},
  year = {2001}
}

@incollection{rouman09a,
  title = {Pseudo-{B}oolean and Cardinality Constraints},
  author = {O. Roussel and V. Manquinho},
  chapter = {22},
  crossref = {SATHandbook},
  pages = {695-733}
}

@misc{roussel11a,
  title = {Description of ppfolio},
  author = {O. Roussel},
  url = {http://www.cril.univ-artois.fr/~roussel/ppfolio/solver1.pdf},
  year = {2011}
}

@inproceedings{rozvar07a,
  title = {{LTL} satisfiability checking},
  author = {K. Rozier and M. Vardi},
  booktitle = spinw,
  organization = springer,
  pages = {149-167},
  year = {2007}
}

@inproceedings{ruhegegafi24a,
  title = {Navigating and Querying Answer Sets: How Hard Is It Really and Why?},
  author = {D. Rusovac and M. Hecher and M. Gebser and S. Gaggl and J. Fichte},
  crossref = {kr24},
  doi = {10.24963/kr.2024/60},
  pages = {642-653}
}

@inproceedings{ruscst23a,
  title = {Towards a formalization of configuration problems for {ASP}-based reasoning: Preliminary report},
  author = {N. R{\"u}hling and T. Schaub and T. Stolzmann},
  crossref = {conf23},
  pages = {85-94},
  url = {https://ceur-ws.org/Vol-3509/paper12.pdf}
}

@book{rusnor10a,
  title = {Artificial Intelligence: A Modern Approach},
  author = {S. Russell and P. Norvig},
  publisher = {Pearson},
  year = {2010}
}

@mastersthesis{ryan04a,
  title = {Efficient Algorithms for Clause-Learning {SAT} Solvers},
  author = {L. Ryan},
  school = {Simon Fraser University},
  year = {2004}
}

@inproceedings{ryan10a,
  title = {Constraint-based multi-robot path planning},
  author = {M. Ryan},
  booktitle = {Proceedings of the {IEEE} International Conference on Robotics and Automation (ICRA'10)},
  doi = {10.1109/ROBOT.2010.5509582},
  pages = {922-928},
  publisher = ieee,
  year = {2010}
}

@inproceedings{ryan14a,
  title = {Efficiently Implementing {GOLOG} with Answer Set Programming},
  author = {M. Ryan},
  crossref = {aaai14},
  pages = {2352-2357}
}

@inproceedings{rychlik91,
  title = {Some Variants of Default Logic},
  author = {P. Rychlik},
  booktitle = aaai,
  pages = {373-378},
  year = {1991}
}

@inproceedings{ryvstr08a,
  title = {Local Restarts},
  author = {V. Ryvchin and O. Strichman},
  crossref = {sat08},
  pages = {271-276}
}

@article{ryvstr08b,
  title = {Local Restarts in {SAT}},
  author = {V. Ryvchin and O. Strichman},
  journal = {Constraint Programming Letters},
  pages = {3-13},
  volume = {4},
  year = {2008}
}

@inproceedings{sababekapi04a,
  title = {Combining Component Caching and Clause Learning for Effective Model Counting},
  author = {T. Sang and F. Bacchus and P. Beame and H. Kautz and T. Pitassi},
  crossref = {sat04}
}

@inproceedings{sabalp07a,
  title = {Computing Answer Sets Using Model Generation Theorem Provers},
  author = {O. Sabuncu and F. Alpaslan},
  crossref = {asp07},
  pages = {225-240}
}

@inproceedings{sabeka05a,
  title = {Heuristics for Fast Exact Model Counting},
  author = {T. Sang and P. Beame and H. Kautz},
  crossref = {sat05},
  pages = {226-240}
}

@inproceedings{sabeka05b,
  title = {Performing {B}ayesian Inference by Weighted Model Counting},
  author = {T. Sang and P. Beame and H. Kautz},
  crossref = {aaai05},
  pages = {475-482}
}

@inproceedings{sablei17a,
  title = {moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming},
  author = {O. Sabuncu and J. Leite},
  crossref = {lpnmr17},
  pages = {336-342},
  year = {2017}
}

@inproceedings{sabsim20a,
  title = {Solving Assembly Line Workload Smoothing Problem via Answer Set Programming},
  author = {O. Sabuncu and M. Simsek},
  crossref = {aspocp20},
  url = {https://ceur-ws.org/Vol-2678/paper3.pdf}
}

@article{sacerdoti74a,
  title = {Planning in a Hierarchy of Abstraction Spaces},
  author = {E. Sacerdoti},
  journal = ai,
  number = {2},
  pages = {115-135},
  volume = {5},
  year = {1974}
}

@inproceedings{sacerdoti75a,
  title = {The Nonlinear Nature of Plans},
  author = {E. Sacerdoti},
  crossref = {ijcai75},
  pages = {206-214},
  url = {http://ijcai.org/Proceedings/75/Papers/028.pdf}
}

@inproceedings{saczan90a,
  title = {Stable Models and Non-Determinism in Logic Programs with Negation},
  author = {D. Sacc{\'a} and C. Zaniolo},
  booktitle = {Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems},
  pages = {205-217},
  publisher = acm,
  year = {1990}
}

@inproceedings{saczschipobe11a,
  title = {{SAT}-based Analysis of Sensitisable Paths},
  author = {M. Sauer and A. Czutro and T. Schubert and S. Hillebrecht and I. Polian and B. Becker},
  crossref = {ddecs11},
  pages = {93-98}
}

@incollection{sadkow87a,
  title = {A Theorem-Proving Approach to Database Integrity},
  author = {F. Sadri and R. Kowalski},
  editor = {J. Minker},
  booktitle = {Foundations of Deductive Databases and Logic Programming},
  chapter = {9},
  pages = {313-362},
  publisher = m-k,
  year = {1987}
}

@article{sakakl10a,
  title = {Computing Combinatorial Intervention Strategies and Failure Modes in Signaling Networks},
  author = {R. Samaga and A. von Kamp and S. Klamt},
  journal = {Journal of Computational Biology},
  number = {1},
  pages = {39-53},
  volume = {17},
  year = {2010}
}

@incollection{sakallah09a,
  title = {Symmetry and Satisfiability},
  author = {K. Sakallah},
  chapter = {10},
  crossref = {SATHandbook},
  pages = {289-338}
}

@article{sakino00a,
  title = {Prioritized Logic Programming and its Application to Commonsense Reasoning},
  author = {C. Sakama and K. Inoue},
  journal = ai,
  number = {1-2},
  pages = {185-222},
  volume = {123},
  year = {2000}
}

@inproceedings{sakino96,
  title = {Representing Priorities in Logic Programs},
  author = {C. Sakama and K. Inoue},
  editor = {M. Maher},
  address = {Cambridge},
  booktitle = {Proceedings of the Joint International Conference and Symposium on Logic Programming},
  pages = {82-96},
  publisher = {MIT Press},
  year = {1996}
}

@inproceedings{sakino99a,
  title = {Updating Extended Logic Programs through Abduction},
  author = {C. Sakama and K. Inoue},
  crossref = {lpnmr99},
  pages = {147-161}
}

@inproceedings{salste20a,
  title = {Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems},
  author = {O. Salzman and R. Stern},
  crossref = {aamas20},
  pages = {1711-1715}
}

@inproceedings{salube12a,
  title = {Multi-agent pathfinding with simultaneous execution of single-agent primitives},
  author = {Q. Sajid and R. Luna and K. Bekris},
  crossref = {socs12}
}

@inproceedings{sammem07a,
  title = {Learning to Solve {QBF}},
  author = {H. Samulowitz and R. Memisevic},
  crossref = {aaai07},
  pages = {255-260}
}

@incollection{sandewall72,
  title = {An Approach to the Frame Problem and its Implementation},
  author = {E. Sandewall},
  editor = {B. Meltzer and D. Michie},
  booktitle = {Machine Intelligence 7},
  note = {XII},
  pages = {195-204},
  publisher = {Edinburgh University Press},
  year = {1972}
}

@techreport{sandewall85a,
  title = {A Functional Approach to Non-Monotonic Logic},
  author = {E. Sandewall},
  institution = {Department of Computer and Information Science, Link{\"o}ping University},
  number = {LITH-IDA-R-85-07},
  type = {Research Report},
  year = {1985}
}

@article{sandewall85b,
  title = {A Functional Approach to Non-Monotonic Logic},
  author = {E. Sandewall},
  journal = ci,
  pages = {80-87},
  volume = {1},
  year = {1985}
}

@techreport{sandewall88a,
  title = {Formal Semantics for Reasoning about Change with Ramified Causal Minimizations},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-88-08},
  year = {1988}
}

@techreport{sandewall88b1,
  title = {Nonmonotonic Entailment for Reasoning about Time and Action, Part {I}: Sequential Actions},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-88-27},
  year = {1988}
}

@techreport{sandewall88b2,
  title = {Nonmonotonic Entailment for Reasoning about Time and Action, Part {II}: Concurrent Actions},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-88-28},
  year = {1988}
}

@techreport{sandewall88b3,
  title = {Nonmonotonic Entailment for Reasoning about Time and Action, Part {III}: Decision Procedure},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-88-29},
  year = {1988}
}

@techreport{sandewall88c,
  title = {The Semantics of Nonmonotonic Entailment Defined Using Partial Interpretations},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-88-31},
  year = {1988}
}

@techreport{sandewall88d,
  title = {An Approach to Nonmonotonic Entailment},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-88-32},
  year = {1988}
}

@techreport{sandewall89,
  title = {A Decision Procedure for a Theory of Action and Plans},
  author = {E. Sandewall},
  institution = {Link{\"o}ping University},
  number = {LiTH-IDA-R-89-39},
  year = {1989}
}

@book{sandewall94a,
  title = {Features and fluents: the representation of knowledge about dynamical systems},
  author = {E. Sandewall},
  address = {New York, NY, USA},
  publisher = {Oxford University Press},
  volume = {1},
  year = {1994}
}

@inproceedings{sanman08a,
  title = {Learning Techniques for Pseudo-{B}oolean Solving},
  author = {J. Santos and V. Manquinho},
  crossref = {iwil08},
  pages = {103-112}
}

@inproceedings{sasctowo03a,
  title = {nlp: A compiler for nested logic programming},
  author = {V. Sarsakov and T. Schaub and H. Tompits and S. Woltran},
  crossref = {lpnmr04},
  pages = {361-364}
}

@inproceedings{sasopo11a,
  title = {A logical formulation for negotiation among dishonest agents},
  author = {C. Sakama and T. Son and E. Pontelli},
  crossref = {ijcai11},
  pages = {1069-1074}
}

@inproceedings{saswwa96,
  title = {An Abstract Machine for Computing the Well-Founded Semantics},
  author = {K. Sagonas and T. Swift and D. Warren},
  editor = {M. Maher},
  booktitle = {Proceedings of the Joint International Conference and Symposium on Logic Programming},
  pages = {274-288},
  publisher = {MIT Press},
  year = {1996}
}

@article{satgoe91a,
  title = {Using crucial literals to select better theories},
  author = {A. Sattar and R. Goebel},
  journal = ci,
  number = {1},
  pages = {11-22},
  volume = {7},
  year = {1991}
}

@inproceedings{satoh88a,
  title = {Nonmonotonic Reasoning by Minimal Belief Revision},
  author = {K. Satoh},
  booktitle = {Proceedings of the International Conference on Fifth Generation Computer Systems},
  pages = {455-462},
  publisher = springer,
  year = {1988}
}

@incollection{scassellati02a,
  title = {Theory of mind for a humanoid robot},
  author = {B. Scassellati},
  booktitle = {Autonomous Robots},
  number = {1},
  pages = {13-24},
  publisher = springer,
  volume = {12},
  year = {2002}
}

@inproceedings{scbrni96a,
  title = {{{\sf XRay}}: A {P}rolog Technology Theorem Prover for Default Reasoning: A System Description.},
  author = {T. Schaub and S. Br{\"u}ning and P. Nicolas},
  editor = {M. McRobbie and J. Slaney},
  booktitle = cade,
  pages = {293-297},
  publisher = springer,
  series = lnai,
  volume = {1104},
  year = {1996}
}

@inproceedings{schaefer78a,
  title = {The Complexity of Satisfiability Problems},
  author = {T. Schaefer},
  editor = {R. Lipton and W. Burkhard and W. Savitch and E. Friedman and A. Aho},
  booktitle = {Proceedings of the Tenth Annual {ACM} Symposium on Theory of Computing (STOCS'78)},
  pages = {216-226},
  publisher = acm,
  year = {1978}
}

@article{schaub02a,
  title = {Antwortmengenprogrammierung},
  author = {T. Schaub},
  journal = {LOG IN: Informatische Bildung und Computer in der Schule},
  pages = {104-106},
  volume = {122/123},
  year = {2003}
}

@inproceedings{schaub08a,
  title = {Here's the beef: Answer Set Programming !},
  author = {T. Schaub},
  crossref = {iclp08},
  pages = {93-98}
}

@inproceedings{schaub09a,
  title = {Making Your Hands Dirty Inspires Your Brain! {Or} How to Switch {ASP} into Production Mode},
  author = {T. Schaub},
  crossref = {lpnmr09},
  pages = {631-633}
}

@mastersthesis{schaub90,
  title = {{N}ichtmonotone {L}ogiken und ein {D}efault-{B}eweiser},
  author = {T. Schaub},
  address = iki:adr,
  note = {In German.},
  school = iki,
  year = {1990}
}

@techreport{schaub90a,
  title = {{N}ichtmonotone {L}ogiken und ein {D}efault-{B}eweiser},
  author = {T. Schaub},
  address = iki:adr,
  institution = iki,
  number = {AIDA-90-5},
  year = {1990}
}

@techreport{schaub90b,
  title = {{N}ichtmonotone {L}ogiken und ein {D}efault-{B}eweiser},
  author = {T. Schaub},
  institution = iki,
  number = {6},
  type = {TASSO-Report},
  year = {1990}
}

@mastersthesis{schaub90zz,
  title = {{N}ichtmonotone {L}ogiken und ein {D}efault-{B}eweiser},
  author = {T. Schaub},
  address = iki:adr,
  note = {In German.},
  school = {Technische Hochschule Darmstadt},
  type = {Diplomarbeit},
  year = {1990}
}

@techreport{schaub91a,
  title = {Assertional Default Theories: {A} Semantical View.},
  author = {T. Schaub},
  address = iki:adr,
  institution = iki,
  number = {AIDA-91-1},
  year = {1991}
}

@inproceedings{schaub91b,
  title = {Assertional Default Theories: A Semantical View.},
  author = {T. Schaub},
  crossref = {kr91},
  pages = {496-506}
}

@inproceedings{schaub91c,
  title = {On Commitment and Cumulativity in Default Logics},
  author = {T. Schaub},
  editor = {R. Kruse and P. Siegel},
  booktitle = {Proceedings of European Conference on Symbolic and Quantitative Approaches to Uncertainty},
  pages = {304-309},
  publisher = springer,
  year = {1991}
}

@techreport{schaub91d,
  title = {On Constrained Default Theories},
  author = {T. Schaub},
  institution = iki,
  type = {TASSO-Report},
  year = {1991}
}

@techreport{schaub92b,
  title = {On Constrained Default Theories},
  author = {T. Schaub},
  address = iki:adr,
  institution = iki,
  number = {AIDA-92-2},
  year = {1992}
}

@inproceedings{schaub92d,
  title = {On Constrained Default Theories},
  author = {T. Schaub},
  editor = {R. Kowalski},
  booktitle = {Proceedings of Logic Programming in Artificial Intelligence, First Compulog-Net Workshop},
  note = {Extended Abstract},
  year = {1992}
}

@inproceedings{schaub92e,
  title = {On Constrained Default Theories},
  author = {T. Schaub},
  crossref = {ecai92},
  pages = {304-308}
}

@phdthesis{schaub92z,
  title = {Considerations on Default Logics},
  author = {T. Schaub},
  address = iki:adr,
  school = {Technische Hochschule Darmstadt},
  year = {1992}
}

@phdthesis{schaub92zz,
  title = {Considerations on Default Logics},
  author = {T. Schaub},
  address = iki:adr,
  school = {Technische Hochschule Darmstadt},
  type = {Dissertation},
  year = {1992}
}

@inproceedings{schaub93b,
  title = {Variations of constrained default logic},
  author = {T. Schaub},
  editor = {M. Clarke and R. Kruse and S. Moral},
  booktitle = {Proceedings of European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty},
  pages = {312-317},
  publisher = springer,
  year = {1993}
}

@techreport{schaub94a,
  title = {A new methodology for query-answering in default logics via structure-oriented theorem proving},
  author = {T. Schaub},
  address = irisa:adr,
  institution = {IRISA},
  year = {1994}
}

@article{schaub94b,
  title = {A new methodology for query-answering in default logics via structure-oriented theorem proving},
  author = {T. Schaub},
  journal = jar,
  number = {1},
  pages = {95-165},
  volume = {15},
  year = {1995}
}

@inproceedings{schaub94c,
  title = {Computing queries from prioritized default theories},
  author = {T. Schaub},
  editor = {Z. Ras and M. Zemankova},
  booktitle = {Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems (ISMIS'94)},
  pages = {584-593},
  publisher = springer,
  series = lnai,
  volume = {869},
  year = {1994}
}

@phdthesis{schaub95z,
  title = {Automating reasoning with incomplete information: From semantic foundations to efficient computation},
  author = {T. Schaub},
  address = irisa:adr,
  school = {University of Rennes},
  type = {Habilitation},
  year = {1995}
}

@phdthesis{schaub95zz,
  title = {Automatisation de raisonnements {\`a} partir d'informations incompl{\`e}tes: Des bases s{\'e}mantiques {\`a} une mise en {\oe}uvre efficace},
  author = {T. Schaub},
  address = irisa:adr,
  note = {In French.},
  school = {Universit{\'e} de Rennes I},
  type = {M{\'e}moire d'habilitation {\`a} diriger des recherches},
  year = {1995}
}

@phdthesis{schaub95zze,
  title = {Automatisation de raisonnements {\`a} partir d'informations incompl{\`e}tes: Des bases s{\'e}mantiques {\`a} une mise en {\oe}uvre efficace},
  author = {T. Schaub},
  address = irisa:adr,
  annote = {En anglais.},
  school = {Universit{\'e} de Rennes I},
  type = {Annexe technique d'habilitation {\`a} diriger des recherches (version anglaise)},
  year = {1995}
}

@book{schaub97z,
  title = {The Automation of Reasoning with Incomplete Information: From semantic foundations to efficient computation},
  author = {T. Schaub},
  publisher = springer,
  series = lnai,
  volume = {1409},
  year = {1998}
}

@inproceedings{schbec05a,
  title = {Lemma Exchange in a Microcontroller Based Parallel {SAT} Solver},
  author = {T. Schubert and B. Becker},
  crossref = {isvlsi05},
  pages = {142-147}
}

@inproceedings{schbru96a,
  title = {Prolog technology for default reasoning},
  author = {T. Schaub and S. Br{\"u}ning},
  editor = {W. Wahlster},
  booktitle = ecai,
  pages = {105-109},
  publisher = wiley,
  year = {1996}
}

@article{schbru98a,
  title = {Prolog technology for default reasoning: Proof theory and compilation techniques},
  author = {T. Schaub and S. Br{\"u}ning},
  journal = ai,
  number = {1},
  pages = {1-75},
  volume = {109},
  year = {1998}
}

@inproceedings{schfre06a,
  title = {Using Answer Set Programming for the Automatic Compilation of Assessment Tests},
  author = {P. Schwaiger and B. Freitag},
  crossref = {iclp06},
  pages = {300-314}
}

@inproceedings{schlechta90,
  title = {Reasoning With and About Defaults: Problems of Homogenousness and Independence},
  author = {K. Schlechta},
  crossref = {nmr90},
  pages = {209-222}
}

@article{schlipf95a,
  title = {The expressive powers of the logic programming semantics},
  author = {J. Schlipf},
  journal = jcss,
  pages = {64-86},
  volume = {51},
  year = {1995}
}

@inproceedings{schneeberger89a,
  title = {Logical Foundations of Planning {I}},
  author = {J. Schneeberger},
  editor = {G. {Morales Luna}},
  booktitle = {Second International Course on Expert Systems},
  organization = {Centro de Investigac{\`\i}on y de estudos Avancados del IPN},
  pages = {31-84},
  year = {1989}
}

@inproceedings{schneeberger90,
  title = {Zur Implementierung eines deduktiven Planers (Draft)},
  author = {J. Schneeberger},
  editor = {N. Kratz and A. G{\"u}nter and J. Hertzberg},
  address = {Helmholtzstr. 16, D-7900 Ulm},
  booktitle = {Beitr{\"a}ge zum 4. Workshop Planen und Konfigurieren},
  organization = faw,
  pages = {190-196},
  year = {1990}
}

@phdthesis{schneeberger92,
  title = {Plan Generation by Linear Deduction},
  author = {J. Schneeberger},
  address = iki:adr,
  school = iki,
  year = {1992}
}

@phdthesis{schneeberger92zz,
  title = {Plan Generation by Linear Deduction},
  author = {J. Schneeberger},
  address = iki:adr,
  school = iki,
  type = {Dissertation},
  year = {1992}
}

@inproceedings{schnic97a,
  title = {An implementation platform for query-answering in default logics: The {{\sf XRay}} system, its implementation and evaluation},
  author = {T. Schaub and P. Nicolas},
  crossref = {lpnmr97},
  pages = {442-453}
}

@inproceedings{schnic97b,
  title = {An implementation platform for query-answering in default logics: Theoretical Underpinnings},
  author = {T. Schaub and P. Nicolas},
  editor = {Z. Ras and A. Skowron},
  booktitle = {Proceedings of the Tenth International Symposium on Methodologies for Intelligent Systems},
  pages = {197-206},
  publisher = springer,
  series = lnai,
  year = {1997}
}

@book{schoening87,
  title = {Logik f{\"u}r Informatiker},
  author = {U. Sch{\"o}ning},
  publisher = bi,
  series = {Reihe Informatik},
  volume = {56},
  year = {1987}
}

@book{schrijver86a,
  title = {Theory of Linear and Integer Programming},
  author = {A. Schrijver},
  address = {New York, NY, USA},
  publisher = wiley,
  year = {1986}
}

@book{schrijver99a,
  title = {Theory of linear and integer programming},
  author = {A. Schrijver},
  publisher = wiley,
  series = {Discrete mathematics and optimization},
  year = {1999}
}

@inproceedings{schris91a,
  title = {A Tableaux-Based Characterization for Default Logic},
  author = {C. Schwind and V. Risch},
  editor = {R. Kruse},
  booktitle = {Proceedings of European Conference on Symbolic and Quantitative Approaches to Uncertainty},
  pages = {310-317},
  publisher = springer,
  year = {1991}
}

@article{schris95a,
  title = {Tableau-Based Characterization and Theorem Proving for Default Logic},
  author = {C. Schwind and V. Risch},
  journal = jar,
  pages = {223-242},
  volume = {13},
  year = {1994}
}

@article{schsie10a,
  title = {Testing, Diagnosing, Repairing, and Predicting from Regulatory Networks and Datasets},
  author = {T. Schaub and A. Siegel},
  journal = {{ERCIM} News},
  note = {Special Theme: Computational Biology},
  pages = {30-31},
  volume = {82},
  year = {2010}
}

@inproceedings{schsie92,
  title = {Modal Semantics for Hypothesis Theory},
  author = {C. Schwind and P. Siegel},
  crossref = {nmr92},
  pages = {200-217}
}

@inproceedings{schtac06a,
  title = {Views and Iterators for Generic Constraint Implementations},
  author = {C. Schulte and G. Tack},
  crossref = {cp05},
  pages = {118-132}
}

@inproceedings{schtau17a,
  title = {Techniques for Solving Large-Scale Product Configuration Problems with {ASP}},
  author = {G. Schenner and R. Taupe},
  crossref = {conf17},
  pages = {12-19}
}

@inproceedings{schthi09a,
  title = {Metabolic Network Expansion with {ASP}},
  author = {T. Schaub and S. Thiele},
  crossref = {iclp09},
  pages = {312-326}
}

@inproceedings{schthi09b,
  title = {Automated Theorem Proving for General Game Playing},
  author = {S. Schiffel and M. Thielscher},
  crossref = {ijcai09},
  pages = {911-916}
}

@inproceedings{schthi94a,
  title = {A method for skeptical reasoning in constrained default logic},
  author = {T. Schaub and M. Thielscher},
  editor = {G. Brewka and C. Witteveen},
  booktitle = {Second Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications},
  year = {1995}
}

@inproceedings{schthi96a,
  title = {Skeptical Query-Answering in Constrained Default Logic},
  author = {T. Schaub and M. Thielscher},
  editor = {D. Gabbay and H. Ohlbach},
  booktitle = {Proceedings of the International Conference on Formal and Applied Practical Reasoning},
  pages = {567-581},
  publisher = springer,
  series = lnai,
  volume = {1085},
  year = {1996}
}

@inproceedings{schtru93,
  title = {Subnormal modal logics for knowledge representation},
  author = {G. Schwarz and M. Truszczy{\'n}ski},
  booktitle = aaai,
  pages = {438-443},
  publisher = aaaimit,
  year = {1993}
}

@article{schubert76,
  title = {Extending the Expressive Power of Semantic Networks},
  author = {L. Schubert},
  journal = ai,
  keywords = {semantic networks},
  number = {2},
  pages = {163-198},
  volume = {7},
  year = {1976}
}

@article{schuma02a,
  title = {Completeness in the Polynomial-Time Hierarchy: A Compendium},
  author = {M. Schaefer and C. Umans},
  journal = {ACM SIGACT News},
  number = {3},
  pages = {32-49},
  url = {http://ovid.cs.depaul.edu/documents\%5Cphcom.ps},
  volume = {33},
  year = {2002}
}

@inproceedings{schwan00a,
  title = {A comparative study of logic programs with preference: {P}reliminary report},
  author = {T. Schaub and K. Wang},
  editor = {A. Provetti and T. Son},
  booktitle = {Proceedings of AAAI Spring Symposium on Answer Set Programming},
  pages = {151-157},
  publisher = {{AAAI} Press},
  year = {2001}
}

@inproceedings{schwan01b,
  title = {A comparative study of logic programs with preference},
  author = {T. Schaub and K. Wang},
  crossref = {ijcai01},
  pages = {597-602}
}

@article{schwan02a,
  title = {A semantic framework for preference handling in answer set programming},
  author = {T. Schaub and K. Wang},
  journal = tplp,
  number = {4-5},
  pages = {569-607},
  volume = {3},
  year = {2003}
}

@inproceedings{schwan02b,
  title = {Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary Report},
  author = {T. Schaub and K. Wang},
  booktitle = {Proceedings of the International Workshop on Nonmonotonic Reasoning},
  pages = {238-246},
  year = {2002}
}

@techreport{schwer87,
  title = {Tableau Calculus for Order Sorted Logic},
  author = {P. Schmitt and W. Wernecke},
  address = {IBM Deutschland GmbH, Heidelberg Scientific Center, Wilckenstr. 1a, D-6900 Heidelberg},
  institution = {IBM Deutschland GmbH},
  number = {IWBS Report 108},
  year = {1990}
}

@inproceedings{schwind90,
  title = {A Tableaux-Based Theorem Prover for a Decidable Subset of Default Logic},
  author = {C. Schwind},
  crossref = {cade90},
  pages = {528-542}
}

@inproceedings{schwind97a,
  title = {A Logic Based Framework for Action Theories},
  author = {C. Schwind},
  editor = {J. Ginzburg and Z. Khasidashvili and C. Vogel and J. L{\'e}vy and E. Vallduv{\'i}},
  booktitle = {Proceedings of the Tbilisi Symposium on Logic, Language and Computation},
  pages = {275-291},
  year = {1997}
}

@article{schwitter13a,
  title = {The jobs puzzle: Taking on the challenge via controlled natural language processing},
  author = {R. Schwitter},
  journal = tplp,
  number = {4-5},
  pages = {487-501},
  volume = {13},
  year = {2013}
}

@article{schwol18a,
  title = {Special Issue on Answer Set Programming},
  author = {T. Schaub and S. Woltran},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {101-103},
  volume = {32},
  year = {2018}
}

@article{schwol18b,
  title = {Answer set programming unleashed!},
  author = {T. Schaub and S. Woltran},
  journal = {K{\"u}nstliche Intelligenz},
  number = {2-3},
  pages = {105-108},
  volume = {32},
  year = {2018}
}

@inproceedings{sclebe05a,
  title = {{PaMira} - A Parallel {SAT} Solver with Knowledge Sharing},
  author = {T. Schubert and M. Lewis and B. Becker},
  crossref = {mtv05},
  pages = {29-36}
}

@article{sclebe09a,
  title = {{PaMiraXT}: Parallel {SAT} Solving with Threads and Message Passing},
  author = {T. Schubert and M. Lewis and B. Becker},
  journal = jsat,
  pages = {203-222},
  volume = {6},
  year = {2009}
}

@inproceedings{scleku90a,
  title = {High Performance Theorem Provers: Efficient Implementation and Parallelisation},
  author = {J. Schumann and R. Letz and F. Kurfe{\ss}},
  editor = {M. Stickel},
  booktitle = cade,
  publisher = springer,
  year = {1990}
}

@inproceedings{scluhate06a,
  title = {Improving system level design space exploration by incorporating SAT-solvers into multi-objective evolutionary algorithms},
  author = {T. Schlichter and M. Lukasiewycz and C. Haubelt and J. Teich},
  booktitle = {Proceedings of the IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI'06)},
  doi = {10.1109/ISVLSI.2006.57},
  pages = {309-316},
  year = {2006}
}

@article{scott79a,
  title = {Identity and existence in intuitionistic logic},
  author = {D. Scott},
  journal = {Lecture Notes in Mathematics},
  pages = {660-696},
  volume = {753},
  year = {1979}
}

@inproceedings{scrahath16a,
  title = {Numeric Planning with Disjunctive Global Constraints via {SMT}},
  author = {E. Scala and M. Ram{\'\i}rez and P. Haslum and S. Thi{\'e}baux},
  crossref = {icaps16},
  pages = {276-284}
}

@inproceedings{scscgekakasc09a,
  title = {Experiences Running a Parallel Answer Set Solver on {B}lue {G}ene},
  author = {L. Schneidenbach and B. Schnor and M. Gebser and R. Kaminski and B. Kaufmann and T. Schaub},
  crossref = {pvmmpi09},
  pages = {64-72}
}

@incollection{scsivi14a,
  title = {Reasoning on the response of logical signaling networks with Answer Set Programming},
  author = {T. Schaub and A. Siegel and S. Videla},
  editor = {K. Inoue and L. {Fari{\~n}as del Cerro}},
  booktitle = {Logical Modeling of Biological Systems},
  pages = {49-92},
  publisher = wiley,
  year = {2014}
}

@article{sebastiani07a,
  title = {Lazy Satisfiability Modulo Theories},
  author = {R. Sebastiani},
  journal = jsat,
  pages = {141-224},
  volume = {3},
  year = {2007}
}

@article{seforewi02a,
  title = {Nagging: A scalable fault-tolerant paradigm for distributed search},
  author = {A. Segre and S. Forman and G. Resta and A. Wildenberg},
  journal = ai,
  number = {1-2},
  pages = {71-106},
  volume = {140},
  year = {2002}
}

@inproceedings{sekaco94a,
  title = {Noise Strategies for Improving Local Search},
  author = {B. Selman and H. Kautz and B. Cohen},
  crossref = {aaai94},
  pages = {337-343}
}

@inproceedings{selemi92a,
  title = {A New Method for Solving Hard Satisfiability Problems},
  author = {B. Selman and H. Levesque and D. Mitchell},
  editor = {P. Rosenbloom and P. Szolovits},
  booktitle = aaai,
  pages = {440-446},
  publisher = {{AAAI} Press},
  year = {1992}
}

@article{selkau90a,
  title = {Model-Preference Default Theories},
  author = {B. Selman and H. Kautz},
  journal = ai,
  pages = {287-322},
  volume = {45},
  year = {1990}
}

@inproceedings{selkau91a,
  title = {Knowledge compilation using Horn approximations},
  author = {B. Selman and H. Kautz},
  booktitle = aaai,
  pages = {904-909},
  publisher = {{AAAI} Press},
  year = {1991}
}

@article{shanahan00a,
  title = {An abductive event calculus planner},
  author = {M. Shanahan},
  journal = jlp,
  number = {1-3},
  pages = {207-240},
  volume = {44},
  year = {2000}
}

@inproceedings{shanahan97a,
  title = {Event Calculus Planning Revisited},
  author = {M. Shanahan},
  crossref = {ecp97},
  pages = {390-402}
}

@inproceedings{shanahan99a,
  title = {The Ramification Problem in the Event Calculus},
  author = {M. Shanahan},
  crossref = {ijcai99},
  pages = {140-146}
}

@book{shapiro87a,
  title = {Encyclopedia of Artificial Intelligence},
  editor = {S. Shapiro},
  publisher = {Wiley-Interscience Publication},
  year = {1987}
}

@inproceedings{shaw98a,
  title = {Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems},
  author = {P. Shaw},
  crossref = {cp98},
  doi = {10.1007/3-540-49481-2\_30},
  pages = {417-431}
}

@article{shawit04a,
  title = {Event calculus planning through satisfiability},
  author = {M. Shanahan and M. Witkowski},
  doi = {10.1093/logcom/14.5.731},
  journal = jlc,
  number = {5},
  pages = {731-745},
  volume = {14},
  year = {2004}
}

@article{sheeit16a,
  title = {Evaluating Epistemic Negation in Answer Set Programming},
  author = {Y. Shen and T. Eiter},
  journal = ai,
  pages = {115-135},
  volume = {237},
  year = {2016}
}

@inproceedings{sheeit17a,
  title = {Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)},
  author = {Y. Shen and T. Eiter},
  crossref = {ijcai17},
  pages = {5060-5064},
  year = {2017}
}

@incollection{shepherson87a,
  title = {Negation in Logic Programming},
  author = {J. Shepherson},
  editor = {J. Minker},
  booktitle = {Foundations of Deductive Databases and Logic Programming},
  chapter = {1},
  pages = {19-88},
  publisher = m-k,
  year = {1987}
}

@inproceedings{shesak06a,
  title = {From Propositional Satisfiability to Satisfiability Modulo Theories},
  author = {H. Sheini and K. Sakallah},
  crossref = {sat06},
  pages = {1-9}
}

@inproceedings{shesak06b,
  title = {A Progressive Simplifier for Satisfiability Modulo Theories},
  author = {H. Sheini and K. Sakallah},
  crossref = {sat06},
  pages = {184-197}
}

@article{shesak06c,
  title = {Pueblo: A Hybrid Pseudo-{B}oolean {SAT} Solver},
  author = {H. Sheini and K. Sakallah},
  journal = jsat,
  pages = {165-189},
  volume = {2},
  year = {2006}
}

@inproceedings{sheyou07a,
  title = {A Generalized {G}elfond-{L}ifschitz Transformation for Logic Programs with Abstract Constraints},
  author = {Y. Shen and J. You},
  crossref = {aaai07},
  pages = {483-488}
}

@article{shidav05a,
  title = {Processes and Continuous Change in a {SAT}-Based Planner},
  author = {J. Shin and E. Davis},
  journal = ai,
  number = {1-2},
  pages = {194-253},
  volume = {166},
  year = {2005}
}

@inproceedings{shimazu01a,
  title = {ExpertClerk: Navigating Shoppers' Buying Process with the Combination of Asking and Proposing},
  author = {H. Shimazu},
  crossref = {ijcai01},
  pages = {1443-1448}
}

@book{shoenfield67,
  title = {Mathematical Logic},
  author = {J. Shoenfield},
  address = {Reading, Ma.},
  publisher = addison,
  year = {1967}
}

@phdthesis{shoham86,
  title = {Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence},
  author = {Y. Shoham},
  school = {Yale University},
  year = {1986}
}

@book{shoham88,
  title = {Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence},
  author = {Y. Shoham},
  publisher = {MIT Press},
  year = {1988}
}

@book{sholey09a,
  title = {Multiagent Systems --- Algorithmic, Game-Theoretic, and Logical Foundations},
  author = {Y. Shoham and K. Leyton-Brown},
  publisher = cup,
  year = {2009}
}

@article{shostak76,
  title = {Refutation Graphs},
  author = {R. Shostak},
  journal = ai,
  pages = {51-64},
  volume = {7},
  year = {1976}
}

@article{shpika13a,
  title = {A survey of point-based {POMDP} solvers},
  author = {G. Shani and J. Pineau and R. Kaplow},
  journal = {Autonomous Agents and Multi-Agent Systems},
  number = {1},
  pages = {1-51},
  volume = {27},
  year = {2013}
}

@inproceedings{shsist00a,
  title = {Checking Safety Properties Using Induction and a {SAT}-Solver},
  author = {M. Sheeran and S. Singh and G. St{\aa}lmarck},
  crossref = {fmcad00},
  pages = {108-125}
}

@article{shstfest15a,
  title = {Conflict-based search for optimal multi-agent pathfinding},
  author = {G. Sharon and R. Stern and A. Felner and N. Sturtevant},
  journal = ai,
  pages = {40-66},
  volume = {219},
  year = {2015}
}

@inproceedings{shvarts90,
  title = {Autoepistemic Modal Logic},
  author = {G. Shvarts},
  editor = {R. Parikh},
  booktitle = tarc,
  pages = {97-109},
  publisher = m-k,
  year = {1990}
}

@article{shwaeifirekrde14a,
  title = {{FLP} Answer Set Semantics without Circular Justifications for General Logic Programs},
  author = {Y. Shen and K. Wang and T. Eiter and M. Fink and C. Redl and T. Krennwallner and J. Deng},
  journal = ai,
  pages = {1-41},
  volume = {213},
  year = {2014}
}

@incollection{shwaha14a,
  title = {Sequential Pattern Mining},
  author = {W. Shen and J. Wang and J. Han},
  crossref = {fpm14},
  pages = {261-282}
}

@article{shysha18a,
  title = {Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling},
  author = {O. Shylo and H. Shams},
  journal = {CoRR},
  url = {https://arxiv.org/abs/1808.10813},
  volume = {abs/1808.10813},
  year = {2018}
}

@inproceedings{siblku01a,
  title = {{PaSAT} - Parallel {SAT}-Checking with Lemma Exchange: Implementation and Applications},
  author = {C. Sinz and W. Blochinger and W. K{\"u}chlin},
  crossref = {sat01},
  pages = {205-216}
}

@inproceedings{siddim10a,
  title = {Constraint Propagation in Propositional Planning},
  author = {A. Sideris and Y. Dimopoulos},
  crossref = {icaps10},
  pages = {153-160}
}

@inproceedings{siddim12a,
  title = {Propositional Planning as Optimization},
  author = {A. Sideris and Y. Dimopoulos},
  crossref = {ecai12},
  pages = {732-737}
}

@inproceedings{siddim14a,
  title = {Heuristic Guided Optimization for Propositional Planning},
  author = {A. Sideris and Y. Dimopoulos},
  crossref = {kr14},
  pages = {669-672}
}

@inproceedings{sidiqqi11a,
  title = {Computing Minimum-Cardinality Diagnoses by Model Relaxation},
  author = {S. Siddiqi},
  crossref = {ijcai11},
  pages = {1087-1092},
  year = {2011}
}

@phdthesis{siegel87,
  title = {Repr{\'e}sentation et utilisation de la connaissance en calcul propositionel},
  author = {P. Siegel},
  school = {Universit{\'e} d'Aix-Marseille II},
  type = {Th{\`e}se de doctorat d'{\'e}tat en informatique},
  year = {1987}
}

@article{sierra04a,
  title = {Heuristic planning: A declarative approach based on strategies for action selection},
  author = {J. Sierra-Santib{\'a}{\~n}ez},
  journal = ai,
  number = {1-2},
  pages = {307-337},
  volume = {153},
  year = {2004}
}

@article{siesch93,
  title = {Modal logic based theory for non-monotonic reasoning},
  author = {P. Siegel and C. Schwind},
  journal = jancl,
  number = {1},
  pages = {73-92},
  volume = {3},
  year = {1993}
}

@misc{sigmund91,
  title = {{\"U}ber Gleichheitsbehandlung in der Konnektionsmethode mit Hilfe Starrer Gleichheitstunifikation},
  author = {U. Sigmund},
  howpublished = {Unpublished.},
  institution = iki,
  keywords = {theorem proving, E-unification},
  year = {1991}
}

@inproceedings{silisc12a,
  title = {Surviving Solver Sensitivity: An {ASP} Practitioner's Guide},
  author = {B. Silverthorn and Y. Lierler and M. Schneider},
  crossref = {iclp-lipics12},
  pages = {164-175}
}

@inproceedings{silva99a,
  title = {The Impact of Branching Heuristics in Propositional Satisfiability Algorithms},
  author = {J. Marques-Silva},
  crossref = {epia99},
  pages = {62-74},
  year = {1999}
}

@inproceedings{silver05a,
  title = {Cooperative Pathfinding},
  author = {D. Silver},
  editor = {R. Young and J. Laird},
  booktitle = {Proceedings of the First Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE'05)},
  pages = {117-122},
  publisher = {{AAAI} Press},
  year = {2005}
}

@inproceedings{simagu05a,
  title = {Design and Implementation of {$\mathcal{A}_T$}: A Real-Time Action Description Language},
  author = {L. Simon and A. Mallya and G. Gupta},
  crossref = {lopstr05},
  pages = {44-60}
}

@inproceedings{simlou90,
  title = {Confluence of Argument Systems: Poole's Rules Revisited},
  author = {G. Simari and R. Loui},
  crossref = {nmr90},
  pages = {223-232}
}

@phdthesis{simons00a,
  title = {Extending and Implementing the Stable Model Semantics},
  author = {P. Simons},
  school = {Helsinki University of Technology},
  type = {Dissertation},
  year = {2000}
}

@inproceedings{simons99a,
  title = {Extending the Stable Model Semantics with More Expressive Rules},
  author = {P. Simons},
  crossref = {lpnmr99},
  pages = {305-316}
}

@phdthesis{simpson94a,
  title = {{The Proof Theory and Semantics of Intuitionistic Modal Logic}},
  author = {A. Simpson},
  school = {University of Edinburgh},
  url = {http://homepages.inf.ed.ac.uk/als/Research/thesis.ps.gz},
  year = {1994}
}

@inproceedings{sindie05a,
  title = {{DPvis} - A Tool to Visualize the Structure of {SAT} Instances},
  author = {C. Sinz and E. Dieringer},
  crossref = {sat05},
  pages = {257-268}
}

@inproceedings{sinise09a,
  title = {Problem-Sensitive Restart Heuristics for the {DPLL} Procedure},
  author = {C. Sinz and M. Iser},
  crossref = {sat09},
  pages = {356-362}
}

@article{siniso02a,
  title = {Extending and implementing the stable model semantics},
  author = {P. Simons and I. Niemel{\"a} and T. Soininen},
  journal = ai,
  number = {1-2},
  pages = {181-234},
  volume = {138},
  year = {2002}
}

@inproceedings{sinz05a,
  title = {Towards an Optimal {CNF} Encoding of {B}oolean Cardinality Constraints},
  author = {C. Sinz},
  crossref = {cp05},
  pages = {827-831}
}

@article{sinz07a,
  title = {Visualizing {SAT} Instances and Runs of the {DPLL} Algorithm},
  author = {C. Sinz},
  journal = jar,
  number = {2},
  pages = {219-243},
  volume = {39},
  year = {2007}
}

@article{siralevela06a,
  title = {Qualitative analysis of the relation between {DNA} microarray data and behavioral models of regulation networks},
  author = {A. Siegel and O. Radulescu and M. {L}e Borgne and P. Veber and J. Ouy and S. Lagarrigue},
  journal = {Biosystems},
  number = {2},
  pages = {153-174},
  volume = {84},
  year = {2006}
}

@article{siscla85a,
  title = {The complexity of propositional linear temporal logic},
  author = {A. Sistla and E. Clarke},
  journal = jacm,
  number = {3},
  pages = {733-749},
  volume = {32},
  year = {1985}
}

@inproceedings{sisima99a,
  title = {Algorithms for Solving {B}oolean Satisfiability in Combinational Circuits},
  author = {L. {Guerra e Silva} and L. Silveira and J. Marques-Silva},
  crossref = {date99},
  pages = {526-530}
}

@phdthesis{sistla83a,
  title = {Theoretical Issues in the Design and Verification of Distributed Systems},
  author = {A. Sistla},
  school = {Harvard University},
  year = {1983}
}

@article{sivawo87a,
  title = {The Complementation Problem for {B}{\"u}chi Automata with Appplications to Temporal Logic},
  author = {A. Sistla and M. Vardi and P. Wolper},
  journal = tcs,
  pages = {217-237},
  volume = {49},
  year = {1987}
}

@inproceedings{slaney93a,
  title = {{SCOTT}: A Model-Guided Theorem Prover},
  author = {J. Slaney},
  booktitle = ijcai,
  pages = {109-114},
  year = {1993}
}

@article{slathi01a,
  title = {Blocks World revisited},
  author = {J. Slaney and S. Thi{\'e}baux},
  journal = ai,
  number = {1-2},
  pages = {119-153},
  volume = {125},
  year = {2001}
}

@inproceedings{slolei10a,
  title = {On Semantic Update Operators for Answer-Set Programs},
  author = {M. Slota and J. Leite},
  crossref = {ecai10},
  pages = {957-962}
}

@inproceedings{smiwel98a,
  title = {Conformant {G}raphplan},
  author = {D. Smith and D. Weld},
  crossref = {aaai98},
  pages = {889-896}
}

@book{smmadupr88,
  title = {Non-Standard Logics for Automated Reasoning},
  editor = {P. Smets and E. Mamdani and D. Dubois and H. Prade},
  publisher = {Academic Press Limited},
  year = {1988}
}

@book{smullyan71,
  title = {First-Order Logic},
  author = {R. Smullyan},
  publisher = springer,
  series = {Ergebnisse der Mathematik und ihrer Grenzgebiete},
  year = {1971}
}

@inproceedings{sobamc01a,
  title = {Extending Answer Set Planning with Sequence, Conditional, Loop, Non-Deterministic Choice, and Procedure Constructs},
  author = {T. Son and C. Baral and S. McIlraith},
  editor = {A. Provetti and T. Son},
  booktitle = {Proceedings of AAAI Spring Symposium on Answer Set Programming},
  pages = {202-209},
  publisher = {{AAAI} Press},
  year = {2001}
}

@inproceedings{sobamc09a,
  title = {{HTN} Planning with Preferences},
  author = {S. Sohrabi and J. Baier and S. McIlraith},
  crossref = {ijcai09},
  pages = {1790-1797}
}

@article{sobanamc03a,
  title = {Domain-Dependent Knowledge in Answer Set Planning},
  author = {T. Son and C. Baral and T. Nam and S. McIlraith},
  doi = {10.1145/1183278.1183279},
  journal = tocl,
  number = {4},
  pages = {613-657},
  volume = {7},
  year = {2006}
}

@inproceedings{sobarmc03a,
  title = {Planning with different forms of domain-dependent control knowledge --- an answer set programming approach},
  author = {T. Son and C. Baral and S. McIlraith},
  crossref = {lpnmr01},
  pages = {226-239}
}

@inproceedings{sobatu04a,
  title = {Adding Time and Intervals to Procedural and Hierarchical Control Specifications},
  author = {T. Son and C. Baral and L. Tuan},
  crossref = {aaai04},
  pages = {92-97},
  url = {http://www.aaai.org/Library/AAAI/2004/aaai04-015.php}
}

@inproceedings{soberobata14a,
  title = {Incremental {SAT}-Based Method with Native {B}oolean Cardinality Handling for the {H}amiltonian Cycle Problem},
  author = {T. Soh and D. {L}e Berre and S. Roussel and M. Banbara and N. Tamura},
  crossref = {jelia14},
  pages = {684-693}
}

@inproceedings{sohino10a,
  title = {Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation},
  author = {T. Soh and K. Inoue},
  crossref = {ecai10},
  pages = {277-282}
}

@inproceedings{soigel99a,
  title = {Dynamic Constraint Satisfaction in Configuration},
  author = {T. Soininen and E. Gelle},
  booktitle = {Proceedings of the AAAI'99 Workshop on Configuration},
  pages = {95-100},
  year = {1999}
}

@inproceedings{soinie99a,
  title = {Developing a declarative rule language for applications in product configuration},
  author = {T. Soininen and I. Niemel{\"a}},
  editor = {G. Gupta},
  booktitle = {Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (PADL'99)},
  doi = {10.1007/3-540-49201-1\_21},
  pages = {305-319},
  publisher = springer,
  series = lncs,
  volume = {1551},
  year = {1999}
}

@article{sointabana10a,
  title = {A {SAT}-based method for solving the two-dimensional strip packing problem},
  author = {T. Soh and K. Inoue and N. Tamura and M. Banbara and H. Nabeshima},
  journal = {Fundamenta Informaticae},
  number = {3-4},
  pages = {467-487},
  volume = {102},
  year = {2010}
}

@inproceedings{solekale17a,
  title = {On Computing World Views of Epistemic Logic Programs},
  author = {T. Son and T. Le and P. Kahl and A. Leclerc},
  crossref = {ijcai17},
  pages = {1269-1275},
  year = {2017}
}

@article{sonbar01a,
  title = {Formalizing sensing actions - A transition function based approach},
  author = {T. Son and C. Baral},
  journal = ai,
  number = {1-2},
  pages = {19-91},
  volume = {125},
  year = {2001}
}

@article{sondos15a,
  title = {Scalable solutions of interactive POMDPs using generalized and bounded policy iteration},
  author = {E. Sonu and P. Doshi},
  journal = {Autonomous Agents and Multi-Agent Systems},
  number = {3},
  pages = {455-494},
  volume = {29},
  year = {2015}
}

@inproceedings{sonitisu01a,
  title = {Representing Configuration Knowledge With Weight Constraint Rules.},
  author = {T. Soininen and I. Niemel{\"a} and J. Tiihonen and R. Sulonen},
  crossref = {asp01},
  pages = {195-201}
}

@inproceedings{sonlob01a,
  title = {Reasoning about Policies using Logic Programs},
  author = {T. Son and J. Lobo},
  crossref = {asp01},
  pages = {210-216}
}

@inproceedings{sonoca09a,
  title = {Extending {SAT} Solvers to Cryptographic Problems},
  author = {M. Soos and K. Nohl and C. Castelluccia},
  crossref = {sat09},
  pages = {244-257}
}

@inproceedings{sonpon02a,
  title = {Reasoning about Actions in Prioritized Default Theory},
  author = {T. Son and E. Pontelli},
  crossref = {jelia02},
  pages = {369-381}
}

@inproceedings{sonpon04a,
  title = {Planning with Preferences in Logic Programming},
  author = {T. Son and E. Pontelli},
  crossref = {lpnmr04},
  pages = {247-260}
}

@article{sonpon06a,
  title = {Planning with Preferences using Logic Programming},
  author = {T. Son and E. Pontelli},
  journal = tplp,
  number = {5},
  pages = {559-608},
  volume = {6},
  year = {2006}
}

@inproceedings{sonpon07a,
  title = {Planning for Biochemical Pathways: A Case Study of Answer Set Planning in Large Planning Problem Instances},
  author = {T. Son and E. Pontelli},
  crossref = {sea07},
  pages = {116-130}
}

@article{sonpon07b,
  title = {A Constructive Semantic Characterization of Aggregates in Answer Set Programming},
  author = {T. Son and E. Pontelli},
  journal = tplp,
  number = {3},
  pages = {355-375},
  volume = {7},
  year = {2007}
}

@article{sontag05a,
  title = {Molecular systems biology and control},
  author = {E. Sontag},
  journal = {European Journal of Control},
  number = {4-5},
  pages = {396-435},
  volume = {11},
  year = {2005}
}

@inproceedings{sontu06a,
  title = {On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information},
  author = {T. Son and P. Tu},
  crossref = {kr06},
  pages = {481-491}
}

@inproceedings{soos10a,
  title = {Enhanced Gaussian Elimination in {DPLL}-based {SAT} Solvers},
  author = {M. Soos},
  crossref = {pos10},
  pages = {2-14}
}

@article{sopobasc23a,
  title = {Answer Set Planning: {A} Survey},
  author = {T. Son and E. Pontelli and M. Balduccini and T. Schaub},
  doi = {10.1017/S1471068422000072},
  journal = tplp,
  number = {1},
  pages = {226-298},
  volume = {23},
  year = {2023}
}

@article{sopoel06a,
  title = {An Unfolding-Based Semantics for Logic Programming with Aggregates},
  author = {T. Son and E. Pontelli and I. Elkabani},
  journal = {CoRR},
  url = {http://arxiv.org/abs/cs/0605038},
  volume = {abs/cs/0605038},
  year = {2006}
}

@inproceedings{sopong09a,
  title = {Planning for Multiagent Using {ASP-Prolog}},
  author = {T. Son and E. Pontelli and N. Nguyen},
  editor = {J. Dix and M. Fisher and P. Nov{\'a}k},
  booktitle = {Proceedings of the Tenth International Workshop on Computational Logic in Multi-Agent Systems},
  pages = {1-21},
  publisher = springer,
  series = lncs,
  volume = {6214},
  year = {2009}
}

@article{sopongsa14a,
  title = {Formalizing Negotiations Using Logic Programming},
  author = {T. Son and E. Pontelli and N. Nguyen and C. Sakama},
  journal = tocl,
  number = {2},
  pages = {12:1-12:30},
  volume = {15},
  year = {2014}
}

@article{sopoph07a,
  title = {Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms},
  author = {T. Son and E. Pontelli and H. Phan},
  journal = jair,
  pages = {353-389},
  volume = {29},
  year = {2007}
}

@inproceedings{soposa09a,
  title = {Logic Programming for Multiagent Planning with Negotiation},
  author = {T. Son and E. Pontelli and C. Sakama},
  crossref = {iclp09},
  pages = {99-114}
}

@inproceedings{sorbie09a,
  title = {Minimizing Learned Clauses},
  author = {N. S{\"o}rensson and A. Biere},
  crossref = {sat09},
  pages = {237-243}
}

@inproceedings{sosascscye16a,
  title = {Solving Goal Recognition Design Using {ASP}},
  author = {T. Son and O. Sabuncu and C. Schulz-Hanke and T. Schaub and W. Yeoh},
  crossref = {aaai16},
  pages = {3181-3187}
}

@article{sotimasu98a,
  title = {Towards a general ontology of configuration},
  author = {T. Soininen and J. Tiihonen and T. M{\"a}nnist{\"o} and R. Sulonen},
  doi = {10.1017/s0890060498124083},
  journal = aiedam,
  number = {4},
  pages = {357-372},
  volume = {12},
  year = {1998}
}

@inproceedings{sotuba04a,
  title = {Planning with Sensing Actions and Incomplete Information using Logic Programming},
  author = {T. Son and P. Tu and C. Baral},
  crossref = {lpnmr04},
  pages = {261-274}
}

@inproceedings{sotugemo05a,
  title = {Conformant Planning for Domains with Constraints --- A New Approach},
  author = {T. Son and P. Tu and M. Gelfond and A. Morales},
  crossref = {aaai05},
  pages = {1211-1216}
}

@inproceedings{sotugemo05b,
  title = {An Approximation of Action Theories of $\mathcal{AL}$ and Its Application to Conformant Planning},
  author = {T. Son and P. Tu and M. Gelfond and A. Morales},
  crossref = {lpnmr05},
  pages = {172-184}
}

@article{sotuzh05a,
  title = {Reasoning about Sensing Actions in Domains with Multi-Valued Fluents},
  author = {T. Son and P. Tu and X. Zhang},
  journal = {Studia Logica},
  number = {1},
  pages = {135-160},
  volume = {79},
  year = {2005}
}

@article{soule03a,
  title = {Graphic Requirements for Multistationarityi},
  author = {C. Soul{\'e}},
  journal = {Complexus},
  number = {3},
  pages = {123-133},
  volume = {1},
  year = {2003}
}

@article{soule06a,
  title = {Mathematical approaches to differentiation and gene regulation.},
  author = {C. Soul{\'e}},
  journal = {Comptes rendus biologies},
  number = {1},
  pages = {13-20},
  volume = {329},
  year = {2006}
}

@unpublished{stalnacker80,
  title = {A Note on Non-Monotonic Modal Logic},
  author = {R. Stalnacker},
  address = {Department of Philosophy, Cornell University},
  note = {Unpublished},
  year = {1980}
}

@inproceedings{standley10a,
  title = {Finding Optimal Solutions to Cooperative Pathfinding Problems},
  author = {T. Standley},
  crossref = {aaai10},
  pages = {173-178}
}

@article{stbomico83a,
  title = {Knowledge programming in {LOOPS}: Report on an experimental course},
  author = {M. Stefik and D. Bobrow and S. Mittal and L. Conway},
  journal = aim,
  number = {3},
  pages = {3-13},
  volume = {4},
  year = {1983}
}

@article{stbrsa96a,
  title = {Combinational Test Generation Using Satisfiability},
  author = {P. Stephan and R. Brayton and A. Sangiovanni-Vincentelli},
  journal = {{IEEE} Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  number = {9},
  pages = {1167-1176},
  volume = {15},
  year = {1996}
}

@book{steele84,
  title = {{COMMON LISP} --- The Language},
  author = {G. {Steele Jr.}},
  address = {Burlington},
  publisher = {Digital Equipment Corporation},
  year = {1984}
}

@inproceedings{stein90,
  title = {A Preference-Based Approach to Inheritance (Extended Abstract)},
  author = {L. Stein},
  crossref = {nmr90},
  pages = {233-246}
}

@article{stephens97a,
  title = {A Survey of Stream Processing},
  author = {R. Stephens},
  journal = acta,
  number = {7},
  pages = {491-541},
  volume = {34},
  year = {1997}
}

@article{stfrha98a,
  title = {Generative constraint-based configuration of large technical systems},
  author = {M. Stumptner and G. Friedrich and A. Haselb{\"o}ck},
  doi = {10.1017/s0890060498124046},
  journal = aiedam,
  number = {4},
  pages = {307-320},
  volume = {12},
  year = {1998}
}

@inproceedings{stgosm07a,
  title = {Combining Multiple Heuristics Online},
  author = {M. Streeter and D. Golovin and S. Smith},
  crossref = {aaai07},
  pages = {1197-1203}
}

@article{stickel84,
  title = {A {P}rolog Technology Theorem Prover},
  author = {M. Stickel},
  journal = ngc,
  keywords = {ATP},
  pages = {371-383},
  volume = {2},
  year = {1984}
}

@incollection{stickel86a,
  title = {An Introduction to Automated Deduction},
  author = {M. Stickel},
  editor = {W. Bibel and P. Jorrand},
  booktitle = {Fundamentals of Artificial Intelligence},
  pages = {75-132},
  publisher = springer,
  year = {1987}
}

@article{stickel88,
  title = {A {P}rolog Technology Theorem Prover: {I}mplementation by an Extended {P}rolog Compiler},
  author = {M. Stickel},
  journal = jar,
  keywords = {ATP},
  pages = {353-380},
  volume = {4},
  year = {1988}
}

@techreport{stickel89,
  title = {A {P}rolog Technology Theorem Prover: A New Exposition and Implementation in {P}rolog},
  author = {M. Stickel},
  institution = sri,
  number = {Technical Note 464},
  year = {1989}
}

@inproceedings{stickel90,
  title = {A {P}rolog technology theorem prover},
  author = {M. Stickel},
  editor = {M. Stickel},
  booktitle = cade,
  pages = {673-674},
  publisher = springer,
  series = lnai,
  volume = {449},
  year = {1990}
}

@inproceedings{stickel90b,
  title = {A {P}rolog Technology Theorem Prover: A New Exposition and Implementation in {P}rolog.},
  author = {M. Stickel},
  editor = {A. Miola},
  booktitle = {Proceedings of the International Symposium on Design and Implemetation of Symbolic Computation Systems},
  pages = {154-163},
  publisher = springer,
  series = lncs,
  volume = {429},
  year = {1990}
}

@inproceedings{stillman91,
  title = {It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics},
  author = {J. Stillman},
  crossref = {kr91},
  pages = {571-578}
}

@inproceedings{stimalsegetachzh23a,
  title = {Dispatching in Real Frontend Fabs With Industrial Grade Discrete-Event Simulations by Deep Reinforcement Learning with Evolution Strategies},
  author = {P. St{\"o}ckermann and A. Immordino and T. Altenm{\"u}ller and G. Seidel and M. Gebser and P. Tassel and C. Chan and F. Zhang},
  crossref = {wsc23},
  pages = {3047-3058}
}

@book{stoyan86,
  title = {Begr{\"u}ndungsverwaltung: Beitr{\"a}ge zu einem Workshop {\"u}ber Reason Maintenance},
  editor = {H. Stoyan},
  noneedauthor = {H. Stoyan},
  publisher = springer,
  series = {Informatik-Fachberichte},
  volume = {162},
  year = {1986}
}

@inproceedings{strdre94a,
  title = {Model-Based Diagnosis with the Default-Based Diagnosis Engine: Effective Control Strategies that Work in Practice},
  author = {O. Dressler and P. Struss},
  editor = {A. Cohn},
  booktitle = ecai,
  pages = {677-681},
  publisher = wiley,
  year = {1994}
}

@techreport{stream03a,
  title = {{STREAM}: The Stanford Stream Data Manager},
  author = {{The STREAM Group}},
  institution = {Stanford InfoLab},
  number = {2003-21},
  type = {Technical Report},
  year = {2003}
}

@article{ststfekomawaliatcokubabo19a,
  title = {Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks},
  author = {R. Stern and N. Sturtevant and A. Felner and S. Koenig and H. Ma and T. Walker and J. Li and D. Atzmon and L. Cohen and T. Kumar and R. Bart{\'a}k and E. Boyarski},
  journal = {CoRR},
  url = {http://arxiv.org/abs/1906.08291},
  volume = {abs/1906.08291},
  year = {2019}
}

@inproceedings{ststfekomawaliatcokubabo19b,
  title = {Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks},
  author = {R. Stern and N. Sturtevant and A. Felner and S. Koenig and H. Ma and T. Walker and J. Li and D. Atzmon and L. Cohen and T. Kumar and R. Bart{\'a}k and E. Boyarski},
  editor = {P. Surynek and W. Yeoh},
  booktitle = {Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS'19)},
  pages = {151-159},
  publisher = {{AAAI} Press},
  year = {2019}
}

@inproceedings{stubur05a,
  title = {Partial Pathfinding Using Map Abstraction and Refinement},
  author = {N. Sturtevant and M. Buro},
  crossref = {aaai05},
  pages = {1392-1397}
}

@article{sturtevant12a,
  title = {Benchmarks for Grid-Based Pathfinding},
  author = {N. Sturtevant},
  journal = {{IEEE} Transactions on Computational Intelligence and {AI} in Games},
  number = {2},
  pages = {144-148},
  volume = {4},
  year = {2012}
}

@inproceedings{subpra04a,
  title = {{N}i{VER}: Non Increasing Variable Elimination Resolution for Preprocessing {SAT} instances},
  author = {S. Subbarayan and D. Pradhan},
  crossref = {sat04},
  pages = {276-291}
}

@inproceedings{subzan95a,
  title = {Relating Stable Models and {AI} Planning Domains},
  author = {V. Subrahmanian and C. Zaniolo},
  booktitle = {Proceedings of the Twelfth International Conference on Logic Programming},
  pages = {233-247},
  publisher = {MIT Press},
  year = {1995}
}

@inproceedings{sudram91a,
  title = {Aggregation and Relevance in Deductive Databases},
  author = {S. Sudarshan and R. Ramakrishnan},
  crossref = {vldb91},
  pages = {501-511}
}

@article{sufahe20a,
  title = {Autoepistemic equilibrium logic and epistemic specifications},
  author = {E. {Iraz Su} and L. {Fari{\~n}as del Cerro} and A. Herzig},
  journal = ai,
  pages = {103249},
  volume = {282},
  year = {2020}
}

@inproceedings{sufestbo16a,
  title = {Efficient {SAT} Approach to Multi-Agent Path Finding Under the Sum of Costs Objective},
  author = {P. Surynek and A. Felner and R. Stern and E. Boyarski},
  crossref = {ecai16},
  pages = {810-818}
}

@inproceedings{sufestbo18a,
  title = {Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem},
  author = {P. Surynek and A. Felner and R. Stern and E. Boyarski},
  crossref = {socs18},
  pages = {90-105}
}

@article{suinnascsotaba24a,
  title = {Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming},
  author = {I. Sugimori and K. Inoue and H. Nabeshima and T. Schaub and T. Soh and N. Tamura and M. Banbara},
  journal = {CoRR},
  volume = {abs/2405.11305},
  year = {2024}
}

@inproceedings{suinnascsotaba24b,
  title = {Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming},
  author = {I. Sugimori and K. Inoue and H. Nabeshima and T. Schaub and T. Soh and N. Tamura and M. Banbara},
  crossref = {kr24},
  doi = {10.24963/KR.2024/72},
  note = {Available as \cite{suinnascsotaba24a}},
  url = {https://doi.org/10.24963/kr.2024/72}
}

@inproceedings{suinnascsotaba24c,
  title = {ASP-based Large Neighborhood Prioritized Search for Course Timetabling},
  author = {I. Sugimori and K. Inoue and H. Nabeshima and T. Schaub and T. Soh and N. Tamura and M. Banbara},
  crossref = {lpnmr24},
  doi = {10.1007/978-3-031-74209-5\_5},
  pages = {57-70}
}

@inproceedings{sulizhkiko21a,
  title = {Mutex Propagation for {SAT}-based Multi-agent Path Finding},
  author = {P. Surynek and J. Li and H. Zhang and T. Kumar and S. Koenig},
  crossref = {prima20},
  doi = {10.1007/978-3-030-69322-0\_16},
  pages = {248-258}
}

@inproceedings{sullivan10a,
  title = {Automated Modelling and Solving in Constraint Programming},
  author = {B. {O}'\relax Sullivan},
  crossref = {aaai10},
  pages = {1493-1497}
}

@article{sunava95a,
  title = {{WFS} + Branch and Bound = Stable Models},
  author = {V. Subrahmanian and D. Nau and C. Vago},
  journal = tkde,
  number = {3},
  pages = {362-377},
  volume = {7},
  year = {1995}
}

@inproceedings{surynek10a,
  title = {An Optimization Variant of Multi-Robot Path Planning Is Intractable},
  author = {P. Surynek},
  crossref = {aaai10},
  pages = {1261-1263},
  url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1768}
}

@inproceedings{surynek14a,
  title = {Compact Representations of Cooperative Path-Finding as {SAT} Based on Matchings in Bipartite Graphs},
  author = {P. Surynek},
  crossref = {ictai14},
  doi = {10.1109/ICTAI.2014.134},
  pages = {875-882}
}

@inproceedings{surynek19a,
  title = {Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories},
  author = {P. Surynek},
  crossref = {ijcai19},
  pages = {1177-1183}
}

@inproceedings{surynek19b,
  title = {Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories {(SMT)}},
  author = {P. Surynek},
  crossref = {socs19},
  pages = {200-201}
}

@inproceedings{surynek20a,
  title = {Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory {(SMT)} Approach},
  author = {P. Surynek},
  booktitle = {Proceedings of the International Conference on Intelligent Robots and Systems (IROS'20)},
  doi = {10.1109/IROS45743.2020.9341047},
  pages = {11631-11637},
  publisher = ieee,
  year = {2020}
}

@inproceedings{surynek23a,
  title = {Candidate Path Selection Heuristics for Multi-Agent Path Finding: {A} Novel Compilation-Based Method},
  author = {P. Surynek},
  crossref = {icaart23},
  doi = {10.5220/0011693900003393},
  pages = {517-524}
}

@inproceedings{surynek23b,
  title = {Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding},
  author = {P. Surynek},
  booktitle = {Proceedings of the Thirty-fifth {IEEE} International Conference on Tools with Artificial Intelligence (ICTAI'23)},
  doi = {10.1109/ICTAI59109.2023.00055},
  pages = {333-340},
  publisher = ieee,
  year = {2023}
}

@article{sustbofe22a,
  title = {Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach},
  author = {P. Surynek and R. Stern and E. Boyarski and A. Felner},
  doi = {10.1613/jair.1.13318},
  journal = jair,
  pages = {553-618},
  volume = {73},
  year = {2022}
}

@article{sutcliffe17a,
  title = {The {TPTP} Problem Library and Associated Infrastructure},
  author = {G. Sutcliffe},
  journal = jar,
  number = {4},
  pages = {483-502},
  volume = {59},
  year = {2017}
}

@manual{suwich71a,
  title = {Micro-{PLANNER} Reference Manual},
  author = {G. Sussman and T. Winograd and E. Charniak},
  institution = {The AI Laboratory, MIT, Cambridge, MA},
  note = {Memo no. 203A},
  year = {1971}
}

@inproceedings{svatstkasc24a,
  title = {Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends},
  author = {J. Svancara and D. Atzmon and K. Strauch and R. Kaminski and T. Schaub},
  crossref = {icaart24},
  doi = {10.5220/0012249400003636},
  pages = {23-33}
}

@inproceedings{svobhubasc23a,
  title = {Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?},
  author = {J. Svancara and P. Obermeier and M. Hus{\'a}r and R. Bart{\'a}k and T. Schaub},
  crossref = {icaart23},
  pages = {199-206}
}

@inproceedings{svtibascwaka23a,
  title = {Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question},
  author = {J. Svancara and E. Tignon and R. Bart{\'a}k and T. Schaub and P. Wanko and R. Kaminski},
  crossref = {socs23},
  doi = {10.1609/SOCS.V16I1.27306},
  pages = {185-186}
}

@inproceedings{syrjanen00a,
  title = {Including Diagnostic Information in Configuration Models},
  author = {T. Syrj{\"a}nen},
  crossref = {cl00},
  pages = {837-851}
}

@inproceedings{syrjanen01a,
  title = {Omega-Restricted Logic Programs},
  author = {T. Syrj{\"a}nen},
  crossref = {lpnmr01},
  pages = {267-279}
}

@inproceedings{syrjanen04a,
  title = {Cardinality Constraint Programs},
  author = {T. Syrj{\"a}nen},
  crossref = {jelia04},
  pages = {187-199}
}

@inproceedings{syrjanen06a,
  title = {Debugging inconsistent answer set programs},
  author = {T. Syrj{\"a}nen},
  crossref = {nmr06},
  pages = {77-83}
}

@phdthesis{syrjanen09a,
  title = {Logic Programs and Cardinality Constraints: Theory and Practice},
  author = {T. Syrj{\"a}nen},
  school = {Aalto University},
  type = {Dissertation},
  url = {http://lib.tkk.fi/Diss/2009/isbn9789512297634/isbn9789512297634.pdf},
  year = {2009}
}

@techreport{syrjanen99a,
  title = {A Rule-Based Formal Model for Software Configuration},
  author = {T. Syrj{\"a}nen},
  institution = {Helsinki University of Technology},
  number = {A55},
  type = {Technical Report},
  year = {1999}
}

@book{szabo69,
  title = {The collected papers of Gerhard Gentzen},
  editor = {M. Szabo},
  publisher = {North-Holland},
  year = {1969}
}

@article{szalas20a,
  title = {A Paraconsistent {ASP}-like Language with Tractable Model Generation},
  author = {A. Szalas},
  journal = {IfCoLog Journal of Logic and their Applications},
  number = {3},
  pages = {361-389},
  publisher = {College Publications},
  volume = {7},
  year = {2020}
}

@inproceedings{tabaso13a,
  title = {{PBS}ugar: Compiling Pseudo-{B}oolean Constraints to {SAT} with Order Encoding},
  author = {N. Tamura and M. Banbara and T. Soh},
  crossref = {pos13}
}

@inproceedings{tabatasc23a,
  title = {Solving Vehicle Equipment Specification Problems with Answer Set Programming},
  author = {R. Takeuchi and M. Banbara and N. Tamura and T. Schaub},
  crossref = {padl23},
  doi = {10.1007/978-3-031-24841-2\_15},
  pages = {232-249},
  year = {2023}
}

@inproceedings{tacezdchst03a,
  title = {Load Shedding in a Data Stream Manager},
  author = {N. Tatbul and U. {\c{C}}etintemel and S. Zdonik and M. Cherniack and M. Stonebraker},
  crossref = {vldb03},
  pages = {309-320}
}

@article{tachkamu06a,
  title = {Application of abductive ILP to learning metabolic network inhibition from temporal data.},
  author = {A. Tamaddoni-Nezhad and R. Chaleil and A. Kakas and S. Muggleton},
  journal = {Machine Learning},
  number = {1-3},
  pages = {209-230},
  volume = {64},
  year = {2006}
}

@inproceedings{tagerb20a,
  title = {An {ASP} Multi-Shot Encoding for the Aircraft Routing and Maintenance Planning Problem},
  author = {P. Tassel and M. Gebser and M. Rbaia},
  crossref = {aspocp20},
  url = {http://ceur-ws.org/Vol-2678/paper4.pdf}
}

@inproceedings{tagesc21a,
  title = {A Reinforcement Learning Environment For Job-Shop Scheduling},
  author = {P. Tassel and M. Gebser and K. Schekotihin},
  crossref = {prl21},
  url = {https://prl-theworkshop.github.io/prl2021/papers/PRL2021_paper_9.pdf}
}

@inproceedings{tagesc21b,
  title = {Lifting Symmetry Breaking Constraints with Inductive Logic Programming},
  author = {A. Tarzariol and M. Gebser and K. Schekotihin},
  crossref = {ijcai21},
  pages = {2062-2068}
}

@article{tagesc22a,
  title = {Lifting Symmetry Breaking Constraints with Inductive Logic Programming},
  author = {A. Tarzariol and M. Gebser and K. Schekotihin},
  journal = {Machine Learning},
  number = {4},
  pages = {1303-1326},
  volume = {111},
  year = {2022}
}

@inproceedings{tagesc23a,
  title = {An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming},
  author = {P. Tassel and M. Gebser and K. Schekotihin},
  crossref = {icaps23},
  pages = {614-622}
}

@inproceedings{tagescla23a,
  title = {Learning to Break Symmetries for Efficient Optimization in Answer Set Programming},
  author = {A. Tarzariol and M. Gebser and K. Schekotihin and M. Law},
  crossref = {aaai23},
  pages = {6541-6549}
}

@article{taillard93a,
  title = {Benchmarks for basic scheduling problems},
  author = {E. Taillard},
  journal = {European Journal of Operational Research},
  number = {2},
  pages = {278-285},
  publisher = elsevier,
  volume = {64},
  year = {1993}
}

@inproceedings{takogesckosc22a,
  title = {Reinforcement Learning of Dispatching Strategies for Large-Scale Industrial Scheduling},
  author = {P. Tassel and B. Kov{\'a}cs and M. Gebser and K. Schekotihin and W. Kohlenbrein and P. Schrott-Kostwein},
  crossref = {icaps22},
  pages = {638-646}
}

@inproceedings{takogescstse23a,
  title = {Semiconductor Fab Scheduling With Self-Supervised And Reinforcement Learning},
  author = {P. Tassel and B. Kov{\'a}cs and M. Gebser and K. Schekotihin and P. St{\"o}ckermann and G. Seidel},
  crossref = {wsc23},
  pages = {1924-1935}
}

@inproceedings{tammet03a,
  title = {Finite Model Building: Improvements and Comparisons},
  author = {T. Tammet},
  editor = {P. Baumgartner and C. Ferm{\"u}ller},
  booktitle = {Proceedings of the Workshop on Model Computation --- Principles, Algorithms, Applications (MODEL'03)},
  year = {2003}
}

@inproceedings{tantre92,
  title = {Constructive Default Logic and the Control of Defeasible Reasoning},
  author = {Y. Tan and J. Treur},
  editor = {B. Neumann},
  booktitle = ecai,
  pages = {299-303},
  publisher = wiley,
  year = {1992}
}

@article{tarjan72a,
  title = {Depth-first search and linear graph algorithms},
  author = {R. Tarjan},
  journal = sicomp,
  number = {2},
  pages = {146-160},
  volume = {1},
  year = {1972}
}

@article{tarski36,
  title = {Der {W}ahrheitsbegriff in formalisierten {S}prachen},
  author = {A. Tarski},
  journal = {Studia Philosophica},
  volume = {1},
  year = {1936}
}

@article{tarski55,
  title = {A lattice-theoretic fixpoint theorem and its applications},
  author = {A. Tarski},
  journal = {Pacific Journal of Mathematics},
  pages = {285-309},
  volume = {5},
  year = {1955}
}

@phdthesis{tarzariol23a,
  title = {Learning Efficient Constraints in Answer Set Programming},
  author = {A. Tarzariol},
  school = {University of Klagenfurt},
  type = {Dissertation},
  url = {https://netlibrary.aau.at/obvuklhs/download/pdf/9173612},
  year = {2023}
}

@article{tascgela22a,
  title = {Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems},
  author = {A. Tarzariol and K. Schekotihin and M. Gebser and M. Law},
  journal = tplp,
  number = {4},
  pages = {606-622},
  volume = {22},
  year = {2022}
}

@inproceedings{tasrba21a,
  title = {A Multi-shot {ASP} Encoding for the Aircraft Routing and Maintenance Planning Problem},
  author = {P. Tassel and M. Rbaia},
  crossref = {jelia21},
  pages = {442-457}
}

@inproceedings{tatakiba06a,
  title = {Compiling Finite Linear {CSP} into {SAT}},
  author = {N. Tamura and A. Taga and S. Kitagawa and M. Banbara},
  crossref = {cp06},
  pages = {590-603}
}

@article{tatakiba09a,
  title = {Compiling finite linear {CSP} into {SAT}},
  author = {N. Tamura and A. Taga and S. Kitagawa and M. Banbara},
  journal = {Constraints},
  number = {2},
  pages = {254-272},
  volume = {14},
  year = {2009}
}

@incollection{tatbul09a,
  title = {Load Shedding},
  author = {N. Tatbul},
  crossref = {EncyclopediaDB},
  pages = {1632-1636}
}

@inproceedings{tawefr19a,
  title = {Degrees of Laziness in Grounding - Effects of Lazy-Grounding Strategies on {ASP} Solving},
  author = {R. Taupe and A. Weinzierl and G. Friedrich},
  crossref = {lpnmr19},
  pages = {298-311}
}

@inproceedings{tedepale08a,
  title = {Enhancing a {DLP} System for Advanced Database Applications},
  author = {G. Terracina and E. {D}e Francesco and C. Panetta and N. Leone},
  crossref = {rr08},
  pages = {119-134}
}

@inproceedings{tefrpale08a,
  title = {Experiencing {ASP} with real world applications},
  author = {G. Terracina and E. {D}e Francesco and C. Panetta and N. Leone},
  editor = {M. Gavanelli and T. Mancini},
  booktitle = {Proceedings of the Fifteenth RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'08)},
  year = {2008}
}

@inproceedings{tenbee12a,
  title = {Knowledge Processing for Autonomous Robot Control},
  author = {M. Tenorth and M. Beetz},
  booktitle = {{AAAI} Spring Symposium on Designing Intelligent Robots: Reintegrating {AI}},
  year = {2012}
}

@article{tennant87,
  title = {Natural Deduction and Sequent Calculus for Intuitionistic Relevant Logic},
  author = {N. Tennant},
  journal = jsl,
  number = {3},
  pages = {665-680},
  volume = {52},
  year = {1987}
}

@inproceedings{tepfri13a,
  title = {Declarative Heuristics in Constraint Satisfaction},
  author = {E. Teppan and G. Friedrich},
  crossref = {ictai13},
  pages = {996-1003}
}

@inproceedings{thbawa04a,
  title = {Solving Non-clausal Formulas with {DPLL} Search},
  author = {C. Thiffault and F. Bacchus and T. Walsh},
  crossref = {cp04},
  pages = {663-678}
}

@book{thbufo05a,
  title = {Probabilistic Robotics: Intelligent Robotics and Autonomous Agents},
  author = {S. Thrun and W. Burgard and D. Fox},
  publisher = {The MIT Press},
  year = {2005}
}

@inproceedings{thcojekr96a,
  title = {Supply Restoration in Power Distribution Systems: {A} Case Study in Integrating Model-Based Diagnosis and Repair Planning},
  author = {S. Thi{\'e}baux and M. Cordier and O. Jehl and J. Krivine},
  editor = {E. Horvitz and F. Jensen},
  booktitle = {Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence (UAI'96)},
  pages = {525-532},
  publisher = m-k,
  year = {1996}
}

@inproceedings{thhone03a,
  title = {In Defense of {PDDL} Axioms},
  author = {S. Thiebaux and J. Hoffmann and B. Nebel},
  crossref = {ijcai03},
  pages = {961-968}
}

@techreport{thhoto86,
  title = {A Calculus for Inheritance in Monotonic Semantic Nets},
  author = {R. Thomason and J. Horty and D. Touretzky},
  institution = {Carnegie-Mellon University},
  number = {CMU-CS-86-138},
  year = {1986}
}

@article{thielscher01,
  title = {The Qualification Problem: A Solution to the Problem of Anomalous Models},
  author = {M. Thielscher},
  journal = ai,
  number = {1-2},
  pages = {1-37},
  self = {yes},
  volume = {131},
  year = {2001}
}

@inproceedings{thielscher04a,
  title = {Logic-Based Agents and the Frame Problem: A Case for Progression},
  author = {M. Thielscher},
  editor = {V. Hendricks},
  booktitle = {First-Order Logic Revisited: Proceedings of the Conference 75 Years of First Order Logic (FOL75)},
  pages = {323-336},
  year = {2004}
}

@book{thielscher05a,
  title = {Reasoning Robots - The Art and Science of Programming Robotic Agents},
  author = {M. Thielscher},
  publisher = kluwer,
  series = {Applied Logic Series},
  volume = {33},
  year = {2005}
}

@article{thielscher05b,
  title = {{FLUX}: A logic programming method for reasoning agents},
  author = {M. Thielscher},
  issue = {4-5},
  journal = tplp,
  pages = {533-565},
  volume = {5},
  year = {2005}
}

@inproceedings{thielscher09a,
  title = {Answer Set Programming for Single-Player Games in General Game Playing},
  author = {M. Thielscher},
  crossref = {iclp09},
  pages = {327-341}
}

@techreport{thielscher91,
  title = {Prognostizieren im {P}oole'schen {A}nsatz --- {A}rbeiten mit {THEORIST}},
  author = {M. Thielscher},
  institution = iki,
  keywords = {nonmonotonic reasoning, THEORIST, Poole},
  number = {18},
  type = {TASSO-Report},
  year = {1991}
}

@article{thielscher93,
  title = {On prediction in {T}heorist},
  author = {M. Thielscher},
  journal = ai,
  keywords = {nonmonotonic reasoning, THEORIST, Poole},
  number = {2},
  pages = {283-292},
  volume = {60},
  year = {1993}
}

@article{thielscher97a,
  title = {A Theory of Dynamic Diagnosis},
  author = {M. Thielscher},
  journal = etai,
  number = {4},
  pages = {73-104},
  volume = {1},
  year = {1997}
}

@article{thielscher98a,
  title = {Introduction to the Fluent Calculus},
  author = {M. Thielscher},
  journal = etai,
  pages = {179-192},
  volume = {2},
  year = {1998}
}

@article{thisch94b,
  title = {Default Reasoning by Deductive Planning},
  author = {M. Thielscher and T. Schaub},
  journal = jar,
  number = {1},
  pages = {1-40},
  volume = {15},
  year = {1995}
}

@inproceedings{thistu09a,
  title = {Lazy Clause Generation Reengineered},
  author = {F. Thibaut and P. Stuckey},
  crossref = {cp09},
  pages = {352-366}
}

@inproceedings{thivoi10a,
  title = {A Temporal Proof System for General Game Playing},
  author = {M. Thielscher and S. Voigt},
  crossref = {aaai10},
  pages = {1000-1005}
}

@inproceedings{thkljosebl10a,
  title = {Combinatorial Analysis of Transcription Regulation of Response to Oxidative Stresses in {E}.~coli},
  author = {S. Thiele and S. Klie and S. Jozefczuk and J. Selbig and S. Blachon},
  crossref = {eccb-posters10},
  pages = {23-23}
}

@article{thmemc85,
  title = {Advanced Theorem-Proving Techniques for Relevant Logics},
  author = {P. Thistlewaite and R. Meyer and M. McRobbie},
  journal = {Logique et Analyse},
  pages = {233-256},
  year = {1985}
}

@article{thopim13a,
  title = {Exploiting domain knowledge in system-level {MPSoC} design space exploration},
  author = {M. Thompson and A. Pimentel},
  doi = {10.1016/j.sysarc.2013.05.023},
  journal = {Journal of Systems Architecture},
  number = {7},
  pages = {351-360},
  volume = {59},
  year = {2013}
}

@inproceedings{thrbuc96a,
  title = {Integrating Grid-Based and Topological Maps for Mobile Robot Navigation},
  author = {S. Thrun and A. B{\"u}cken},
  crossref = {aaai96},
  pages = {944-950}
}

@inproceedings{thurley06a,
  title = {sharp{SAT} - Counting Models with Advanced Component Caching and Implicit {BCP}},
  author = {M. Thurley},
  crossref = {sat06},
  pages = {424-429}
}

@article{tiasquseba10a,
  title = {Early detection of bovine respiratory disease in young bulls using reticulo-rumen temperature boluses},
  author = {E. Timsit and S. Assi{\'e} and R. Quiniou and H. Seegers and N. Bareille},
  journal = {The Veterinary Journal},
  number = {1},
  pages = {136-142},
  publisher = elsevier,
  volume = {190},
  year = {2010}
}

@article{tiheanso13a,
  title = {{WeCoTin} -- {A} practical logic-based sales configurator},
  author = {J. Tiihonen and M. Heiskala and A. Anderson and T. Soininen},
  doi = {10.3233/aic-2012-0547},
  journal = aicom,
  number = {1},
  pages = {99-131},
  volume = {26},
  year = {2013}
}

@incollection{tiiand14a,
  title = {{VariSales}},
  author = {J. Tiihonen and A. Anderson},
  chapter = {26},
  crossref = {kbc14},
  doi = {10.1016/B978-0-12-415817-7.00026-8},
  pages = {309-318}
}

@inproceedings{tisonisu03a,
  title = {A Practical Tool for Mass-Customising Configurable Products},
  author = {J. Tiihonen and T. Soininen and I. Niemel{\"a} and R. Sulonen},
  crossref = {iced03},
  pages = {1290-1299}
}

@inproceedings{tobaho11a,
  title = {Captain {Jack} --- New Variable Selection Heuristics in Local Search for {SAT}},
  author = {D. Tompkins and A. Balint and H. Hoos},
  crossref = {sat11},
  pages = {302-316}
}

@inproceedings{tohoth87,
  title = {A Clash of Intuitions: The Current State Of Nonmonotonic Multiple Inheritance Systems},
  author = {D. Touretzky and J. Horty and R. Thomason},
  booktitle = ijcai,
  pages = {479-482},
  year = {1987}
}

@inproceedings{toonsa12a,
  title = {An approach to multi-agent planning with incomplete information},
  author = {A. Torre{\~n}o and E. Onaindia and {\'O}. Sapena},
  crossref = {ecai12},
  pages = {762-767}
}

@inproceedings{toposo09a,
  title = {A Conformant Planner with Explicit Disjunctive Representation of Belief States},
  author = {S. To and E. Pontelli and T. Son},
  crossref = {icaps09},
  pages = {305-312}
}

@inproceedings{toposo10a,
  title = {A New Approach to Conformant Planning Using CNF},
  author = {S. To and E. Pontelli and T. Son},
  crossref = {icaps10},
  pages = {169-176}
}

@inproceedings{toposo10b,
  title = {On the Use of Prime Implicates in Conformant Planning},
  author = {S. To and E. Pontelli and T. Son},
  crossref = {aaai10}
}

@inproceedings{torbai15a,
  title = {Polynomial-Time Reformulations of {LTL} Temporally Extended Goals into Final-State Goals},
  author = {J. Torres and J. Baier},
  crossref = {ijcai15},
  pages = {1696-1703}
}

@inproceedings{torjac07a,
  title = {Kodkod: a relational model finder},
  author = {E. Torlak and D. Jackson},
  booktitle = {Proceedings of the Thirteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07)},
  pages = {632-647},
  publisher = springer,
  year = {2007}
}

@inproceedings{tornquist06a,
  title = {Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms},
  author = {J. T{\"o}rnquist},
  editor = {L. Kroon and R. M{\"o}hring},
  booktitle = {Proceedings of Fifth Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  series = {OpenAccess Series in Informatics (OASIcs)},
  volume = {2},
  year = {2006}
}

@inproceedings{tour90a,
  title = {Minimizing the Number of Clauses by Renaming},
  author = {T. {Boy de la Tour}},
  crossref = {cade90},
  pages = {558-572}
}

@article{tour92a,
  title = {An Optimality Result for Clause Form Translation},
  author = {T. {Boy de la Tour}},
  journal = jsc,
  number = {4},
  pages = {283-302},
  volume = {14},
  year = {1992}
}

@inproceedings{touretzky84,
  title = {Implicit Ordering of Defaults in Inheritance Systems},
  author = {D. Touretzky},
  booktitle = aaai,
  pages = {322-325},
  year = {1984}
}

@book{touretzky86,
  title = {The Mathematics of Inheritance Systems},
  author = {D. Touretzky},
  publisher = m-k,
  year = {1986}
}

@inproceedings{trabar04a,
  title = {Reasoning about Triggered Actions in {A}ns{P}rolog and Its Application to Molecular Interactions in Cells},
  author = {N. Tran and C. Baral},
  crossref = {kr04},
  pages = {554-564}
}

@article{trakhtenbrot61a,
  title = {Finite automata and logic of monadic predicates},
  author = {B. Trakhtenbrot},
  journal = {Doklady Akademii Nauk SSSR},
  number = {326-329},
  pages = {122-123},
  volume = {140},
  year = {1961}
}

@phdthesis{tran06a,
  title = {Reasoning and hypothesing about signaling networks},
  author = {N. Tran},
  school = {Arizona State University},
  year = {2006}
}

@article{trbalo01a,
  title = {Formalizing and Reasoning About the Requirements Specifications of Workflow Systems},
  author = {G. Trajcevski and C. Baral and J. Lobo},
  journal = {International Journal of Cooperative Information Systems},
  number = {4},
  pages = {483-507},
  volume = {10},
  year = {2001}
}

@inproceedings{trbash05a,
  title = {Issues in Reasoning about Interaction Networks in Cells: Necessity of Event Ordering Knowledge},
  author = {N. Tran and C. Baral and C. Shankland},
  crossref = {aaai05},
  pages = {676-681}
}

@article{trebel20a,
  title = {A correctness result for synthesizing plans with loops in stochastic domains},
  author = {L. Treszkai and V. Belle},
  journal = {International Journal of Approximate Reasoning},
  pages = {92-107},
  volume = {119},
  year = {2020}
}

@techreport{trezac09a,
  title = {Common Upgradability Description Format ({CUDF}) 2.0},
  author = {R. Treinen and S. Zacchiroli},
  institution = {\textsf{mancoosi} --- managing software complexity},
  number = {003},
  year = {2009}
}

@inproceedings{trngposo09a,
  title = {Improving Performance of Conformant Planners: Static Analysis of Declarative Planning Domain Specifications},
  author = {D. Tran and H. Nguyen and E. Pontelli and T. Son},
  crossref = {padl09},
  pages = {239-253}
}

@article{trngsopo13a,
  title = {A conformant planner based on approximation: CpA(H)},
  author = {V. Tran and K. Nguyen and T. Son and E. Pontelli},
  journal = {ACM Transactions on Intelligent Systems and Technology},
  number = {2},
  pages = {36:1-36:38},
  volume = {4},
  year = {2013}
}

@inproceedings{truszczynski07a,
  title = {Comments on Modeling Languages for Answer-Set Programming},
  author = {M. Truszczy{\'n}ski},
  crossref = {sea07},
  pages = {3-11}
}

@article{truszczynski10a,
  title = {Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs},
  author = {M. Truszczy{\'n}ski},
  journal = ai,
  number = {16-17},
  pages = {1285-1306},
  volume = {174},
  year = {2010}
}

@article{truszczynski11a,
  title = {Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs},
  author = {M. Truszczy{\'n}ski},
  journal = tplp,
  number = {6},
  pages = {881-904},
  volume = {11},
  year = {2011}
}

@inproceedings{truszczynski11b,
  title = {Revisiting Epistemic Specifications},
  author = {M. Truszczynski},
  crossref = {mg65},
  pages = {315-333},
  year = {2011}
}

@incollection{truszczynski12a,
  title = {Connecting First-Order {ASP} and the Logic {FO(ID)} through Reducts},
  author = {M. Truszczy{\'n}ski},
  crossref = {vl65},
  pages = {543-559}
}

@incollection{truszczynski18a,
  title = {An introduction to the stable and well-founded semantics of logic programs},
  author = {M. Truszczy{\'n}ski},
  booktitle = {Declarative Logic Programming: Theory, Systems, and Applications},
  crossref = {DeclarativeLP},
  pages = {121-177},
  year = {2018}
}

@inproceedings{truszczynski91a,
  title = {Modal Interpretations of Default Logic},
  author = {M. Truszczy{\'n}ski},
  booktitle = ijcai,
  pages = {393-398},
  publisher = m-k,
  year = {1991}
}

@inproceedings{truszczynski91b,
  title = {Embedding Default Logic into Modal Nonmonotonic Logics},
  author = {M. Truszczy{\'n}ski},
  editor = {V. Marek and A. Nerode and V. Subrahmanian},
  booktitle = {Proceedings of the First International Workshop on Logic Programming and Nonmonotonic Reasoning},
  pages = {151-165},
  publisher = {MIT Press},
  year = {1991}
}

@article{tseitin68a,
  title = {On the complexity of derivation in the propositional calculus},
  author = {G. Tseitin},
  journal = {Zapiski nauchnykh seminarov LOMI},
  pages = {234-259},
  volume = {8},
  year = {1968}
}

@techreport{tsiknis88,
  title = {A Connection Method for Non-Monotonic and Autoepistemic Logic},
  author = {G. Tsiknis},
  institution = {Department of Computer Science, The University of British Columbia},
  number = {88-5},
  type = {Technical Report},
  year = {1988}
}

@inproceedings{tuliprya06a,
  title = {Load Shedding in Stream Databases: A Control-Based Approach},
  author = {Y. Tu and S. Liu and S. Prabhakar and B. Yao},
  crossref = {vldb06},
  pages = {787-798}
}

@inproceedings{turner02a,
  title = {Polynomial-length planning spans the polynomial hierarchy},
  author = {H. Turner},
  crossref = {jelia02},
  pages = {111-124}
}

@article{turner03a,
  title = {Strong equivalence made easy: nested expressions and weight constraints},
  author = {H. Turner},
  journal = tplp,
  number = {4-5},
  pages = {609-622},
  volume = {3},
  year = {2003}
}

@incollection{turner08a,
  title = {Nonmontonic Causal Logic},
  author = {H. Turner},
  chapter = {19},
  crossref = {KRHandbook},
  pages = {759-776}
}

@book{turner90a,
  title = {Truth and Modality for Knowledge Representation},
  author = {R. Turner},
  publisher = pitman,
  year = {1990}
}

@article{turner96a,
  title = {Representing actions in logic programs and default theories: A situation calculus approach,},
  author = {H. Turner},
  journal = jlp,
  number = {1-3},
  pages = {245-298},
  volume = {31},
  year = {1997}
}

@inproceedings{turner96b,
  title = {Splitting a Default Theory},
  author = {H. Turner},
  booktitle = aaai,
  pages = {645-651},
  year = {1996}
}

@article{turner97a,
  title = {Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach},
  author = {H. Turner},
  journal = jlp,
  number = {1-3},
  pages = {245-298},
  volume = {31},
  year = {1997}
}

@phdthesis{turner98a,
  title = {Causal action theories and satisfiability planning},
  author = {H. Turner},
  note = {Also: Technical Report CS-TR-98-26},
  school = {Department of Computer Sciences, University of Texas at Austin},
  year = {1998}
}

@article{turner99a,
  title = {A Logic of Universal Causation},
  author = {H. Turner},
  journal = ai,
  number = {1-2},
  pages = {87-123},
  volume = {113},
  year = {1999}
}

@article{tusoba07a,
  title = {Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming},
  author = {P. Tu and T. Son and C. Baral},
  journal = tplp,
  number = {4},
  pages = {377-450},
  volume = {7},
  year = {2007}
}

@article{tusogemo11a,
  title = {Approximation of action theories and its application to conformant planning},
  author = {P. Tu and T. Son and M. Gelfond and A. Morales},
  journal = ai,
  number = {1},
  pages = {79-119},
  volume = {175},
  year = {2011}
}

@book{tuswal94a,
  title = {Mathematische Logik - Kurzgefasst: Gundlagen, Modelltheorie Entscheidbarkeit, Mengenlehre},
  author = {H. Tuschik and H. Walter},
  publisher = {BI-Wissenschaftsverlag},
  year = {1994}
}

@book{ullman82a,
  title = {Principles of Database Systems},
  author = {J. Ullman},
  address = {Rockville MD},
  publisher = {Computer Science Press},
  year = {1982}
}

@book{ullman88a,
  title = {Principles of Database and Knowledge-Base Systems},
  author = {J. Ullman},
  publisher = {Computer Science Press},
  year = {1988}
}

@inproceedings{umrpit85,
  title = {An experiment in programming with full first-order logic},
  author = {Z. Umrigar and V. Pitchumani},
  booktitle = {IEEE 1985 Symposium on Logic Programming},
  pages = {40-47},
  year = {1985}
}

@inproceedings{unerom09a,
  title = {Stream Reasoning: A Survey and Further Research Directions},
  author = {G. {\"u}nel and D. Roman},
  crossref = {fqas09},
  pages = {653-662}
}

@article{vabrde21a,
  title = {Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory},
  author = {L. Vanbesien and M. Bruynooghe and M. Denecker},
  journal = {CoRR},
  url = {https://arxiv.org/abs/2104.14789},
  volume = {abs/2104.14789},
  year = {2021}
}

@article{vacevafe09a,
  title = {It's a Streaming World! Reasoning upon Rapidly Changing Information},
  author = {E. {Della Valle} and S. Ceri and F. van Harmelen and D. Fensel},
  journal = {IEEE Intelligent Systems},
  number = {6},
  pages = {83-89},
  volume = {24},
  year = {2009}
}

@inproceedings{vacoqu05a,
  title = {An Inductive Database for Mining Temporal Patterns in Event Sequences},
  author = {A. Vautier and M. Cordier and R. Quiniou},
  crossref = {ijcai05},
  pages = {1640-1641}
}

@inproceedings{vacoqu07a,
  title = {Towards Data Mining Without Information on Knowledge Structure},
  author = {A. Vautier and M. Cordier and R. Quiniou},
  crossref = {pkdd07},
  pages = {300-311}
}

@inproceedings{vafagehosa11a,
  title = {Generating Fast Domain-Specific Planners by Automatically Configuring a Generic Parameterised Planner},
  author = {M. Vallati and C. Fawcett and A. Gerevini and H. Hoos and A. Saetti},
  booktitle = {Proceedings of the Twenty-First ICAPS Workshop on Planning and Learning (PAL2011)},
  pages = {21-27},
  year = {2011}
}

@article{vangelder93a,
  title = {The alternating fixpoint of logic programs with negation},
  author = {A. {Van Gelder}},
  journal = jcss,
  pages = {185-221},
  volume = {47},
  year = {1993}
}

@article{vanwoo03a,
  title = {Towards a Logic of Rational Agency},
  author = {W. van der Hoek and M. Wooldridge},
  journal = {Logic Journal of the {IGPL}},
  number = {2},
  pages = {135-159},
  volume = {11},
  year = {2003}
}

@incollection{vanwoo08a,
  title = {Multi-agent Systems},
  author = {W. van der Hoek and M. Wooldridge},
  crossref = {KRHandbook},
  pages = {887-928}
}

@inproceedings{vardi95a,
  title = {An Automata-Theoretic Approach to Linear Temporal Logic},
  author = {M. Vardi},
  editor = {F. Moller and G. Birtwistle},
  booktitle = {Logics for Concurrency: Structure versus Automata},
  doi = {10.1007/3-540-60915-6\_6},
  pages = {238-266},
  publisher = springer,
  series = lncs,
  volume = {1043},
  year = {1995}
}

@inproceedings{vardi97a,
  title = {Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics},
  author = {M. Vardi},
  crossref = {cade97},
  doi = {10.1007/3-540-63104-6\_19},
  pages = {191-206}
}

@inproceedings{vardi98a,
  title = {Reasoning about the past with two-way automata},
  author = {M. Vardi},
  booktitle = {International Colloquium on Automata, Languages, and Programming},
  organization = springer,
  pages = {628-641},
  year = {1998}
}

@article{varwol86a,
  title = {Automata-Theoretic Techniques for Modal Logics of Programs},
  author = {M. Vardi and P. Wolper},
  journal = jcss,
  number = {2},
  pages = {183-221},
  volume = {32},
  year = {1986}
}

@inproceedings{vebicoro15a,
  title = {{CoBots}: Robust Symbiotic Autonomous Mobile Service Robots},
  author = {M. Veloso and J. Biswas and B. Coltin and S. Rosenthal},
  crossref = {ijcai15},
  pages = {4423-4429},
  year = {2015}
}

@article{vegide04a,
  title = {Splitting an operator: Algebraic modularity results for logics with fixpoint semantics},
  author = {J. Vennekens and D. Gilis and M. Denecker},
  journal = tocl,
  number = {4},
  pages = {765-797},
  volume = {7},
  year = {2006}
}

@inproceedings{velbry01a,
  title = {Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and {VLIW} Microprocessors},
  author = {M. Velev and R. Bryant},
  crossref = {dac01},
  pages = {226-231}
}

@phdthesis{videla14a,
  title = {Reasoning on the response of logical signaling networks with Answer Set Programming},
  author = {S. Videla},
  school = {University of Rennes and University of Potsdam},
  year = {2014}
}

@inproceedings{videsc15a,
  title = {An Implementation of Consistency-Based Multi-Agent Belief Change using {ASP}},
  author = {P. Vicol and J. Delgrande and T. Schaub},
  crossref = {lpnmr15},
  pages = {480-487}
}

@inproceedings{videsc16a,
  title = {A Minimization-Based Approach to Iterated Multi-Agent Belief Change},
  author = {P. Vicol and J. Delgrande and T. Schaub},
  crossref = {ecai16},
  pages = {1221-1229}
}

@article{vidgef06a,
  title = {Branching and pruning: An optimal temporal {POCL} planner based on constraint programming},
  author = {V. Vidal and H. Geffner},
  journal = ai,
  number = {3},
  pages = {298-335},
  volume = {170},
  year = {2006}
}

@article{viguedthgenisascsi14a,
  title = {Learning {B}oolean logic models of signaling networks with {ASP}},
  author = {S. Videla and C. Guziolowski and F. Eduati and S. Thiele and M. Gebser and J. Nicolas and J. Saez-Rodriguez and T. Schaub and A. Siegel},
  journal = tcs,
  pages = {79-101},
  volume = {599},
  year = {2015}
}

@inproceedings{viguedthgrsasi12a,
  title = {Revisiting the Training of Logic Models of Protein Signaling Networks with {ASP}},
  author = {S. Videla and C. Guziolowski and F. Eduati and S. Thiele and N. Grabe and J. Saez-Rodriguez and A. Siegel},
  crossref = {cmsb12},
  pages = {342-361}
}

@article{vikoalsascsigu15a,
  title = {Designing experiments to discriminate families of logic models},
  author = {S. Videla and I. Konokotina and L. Alexopoulos and J. Saez-Rodriguez and T. Schaub and A. Siegel and C. Guziolowski},
  doi = {10.3389/fbioe.2015.00131},
  journal = {Frontiers in Bioengineering and Biotechnology},
  number = {131},
  url = {http://www.frontiersin.org/bioinformatics_and_computational_biology/10.3389/fbioe.2015.00131/abstract},
  volume = {3},
  year = {2015}
}

@article{visagusi17a,
  title = {caspo: a toolbox for automated reasoning on the response of logical signaling networks families},
  author = {S. Videla and J. Saez-Rodriguez and C. Guziolowski and A. Siegel},
  doi = {10.1093/bioinformatics/btw738},
  journal = {Bioinformatics},
  number = {6},
  pages = {947-950},
  volume = {33},
  year = {2017}
}

@article{viwema15a,
  title = {Boolean Satisfiability Solvers and Their Applications in Model Checking},
  author = {Y. Vizel and G. Weissenbacher and S. Malik},
  journal = {Proceedings of the IEEE},
  number = {11},
  pages = {2021-2035},
  publisher = ieee,
  volume = {103},
  year = {2015}
}

@book{vlassis07a,
  title = {A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence},
  author = {N. Vlassis},
  publisher = {Morgan and Claypool Publishers},
  year = {2007}
}

@article{vlvedebr12a,
  title = {An approximative inference method for solving {$\exists\forall$SO} satisfiability problems},
  author = {H. Vlaeminck and J. Vennekens and M. Denecker and M. Bruynooghe},
  journal = jair,
  pages = {79-124},
  volume = {45},
  year = {2012}
}

@inproceedings{vogrdabicrorlalagiackljo14a,
  title = {Telemedicine System for Game-Based Rehabilitation of Stroke Patients in the {FP}7-``{S}troke{B}ack'' Project},
  author = {E. Vogiatzaki and Y. Gravezas and N. Dalezios and D. Biswas and A. Cranny and S. Ortmann and P. Langend{\"o}rfer and I. Lamprinos and G. Giannakopoulou and J. Achner and J. Klemke and H. Jost},
  booktitle = {European Conference on Networks and Communications (EuCNC 2014)},
  pages = {1-5},
  publisher = ieee,
  year = {2014}
}

@article{vostmo05a,
  title = {Incrementally Maintaining Materializations of Ontologies Stored in Logic Databases},
  author = {R. Volz and S. Staab and B. Motik},
  journal = jds,
  pages = {1-34},
  volume = {2},
  year = {2005}
}

@inproceedings{vosvei01a,
  title = {Logic Programming Agents and Game Theory},
  author = {M. {D}e Vos and D. Vermeir},
  crossref = {asp01},
  pages = {27-33}
}

@article{wagcho15a,
  title = {Subdimensional expansion for multirobot path planning},
  author = {G. Wagner and H. Choset},
  journal = ai,
  pages = {1-24},
  volume = {219},
  year = {2015}
}

@inproceedings{wagner91,
  title = {Ex contradictione nihil sequitur},
  author = {G. Wagner},
  editor = {J. Mylopoulos and R. Reiter},
  booktitle = ijcai,
  pages = {538-543},
  publisher = m-k,
  year = {1991}
}

@inproceedings{wagrkaka19a,
  title = {{DatalogMTL}: Computational Complexity and Expressive Power},
  author = {P. Wa{\l}ega and B. {Cuenca Grau} and M. Kaminski and E. Kostylev},
  crossref = {ijcai19},
  pages = {1886-1892},
  year = {2019}
}

@inproceedings{wagrkako20a,
  title = {Tractable Fragments of Datalog with Metric Temporal Operators},
  author = {P. Wa{\l}ega and B. {Cuenca Grau} and M. Kaminski and E. Kostylev},
  crossref = {ijcai20},
  pages = {1919-1925}
}

@inproceedings{wahuwagr22a,
  title = {{MeTeoR}: Practical Reasoning in Datalog with Metric Temporal Operators},
  author = {D. Wang and P. Hu and P. Wa{\l}ega and B. {Cuenca Grau}},
  crossref = {aaai22},
  doi = {10.1609/AAAI.V36I5.20535},
  pages = {5906-5913},
  url = {https://doi.org/10.1609/aaai.v36i5.20535}
}

@inproceedings{wakagr19a,
  title = {Reasoning over Streaming Data in Metric Temporal Datalog},
  author = {P. Wa{\l}ega and M. Kaminski and B. {Cuenca Grau}},
  crossref = {aaai19},
  pages = {3092-3099},
  year = {2019}
}

@incollection{walfre06a,
  title = {Comparative studies of constraint satisfaction and {D}avis-{P}utnam algorithms for maximum satisfiability problems},
  author = {R. Wallace and E. Freuder},
  editor = {D. Johnson and M. Trick},
  booktitle = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  pages = {587-615},
  publisher = {American Mathematical Society},
  volume = {26},
  year = {1996}
}

@book{wallen90,
  title = {Automated Deduction in Non-Classical Logics},
  author = {L. Wallen},
  address = {Cambridge, Mass.},
  publisher = {MIT Press},
  year = {1990}
}

@inproceedings{walsh00a,
  title = {{SAT} versus {CSP}},
  author = {T. Walsh},
  crossref = {cp00},
  pages = {441-456}
}

@techreport{walther82,
  title = {The Markgraf Karl Refutation Procedure, {PLL} --- A First-Order Language for an Automated Theorem Prover},
  author = {C. Walther},
  address = {Postfach 6380, D-7500 Karlsruhe 1},
  institution = {Institut f{\"u}r Informatik 1, Universit{\"a}t Karlsruhe},
  keywords = {theorem proving, connection graph},
  note = {SEKI-PROJEKT, SEKI-Memo},
  number = {35/82},
  type = {Interner Bericht},
  year = {1982}
}

@inproceedings{wamaguquco09a,
  title = {A general framework for adaptive and online detection of web attacks},
  author = {W. Wang and F. Masseglia and T. Guyet and R. Quiniou and M. Cordier},
  crossref = {www09},
  pages = {1141-1142}
}

@article{wanbot11a,
  title = {{MAPP} a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees},
  author = {K. Wang and A. Botea},
  journal = jair,
  pages = {55-90},
  volume = {42},
  year = {2011}
}

@inproceedings{wanlee19a,
  title = {Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language p\emph{BC}+},
  author = {Y. Wang and J. Lee},
  crossref = {lpnmr19},
  pages = {224-238}
}

@article{wanzho01,
  title = {An extension to {GCWA} and query evaluation for disjunctive deductive databases},
  author = {K. Wang and L. Zhou},
  journal = {Journal of Intelligent Information Systems},
  number = {3},
  pages = {229-253},
  volume = {16},
  year = {2001}
}

@phdthesis{ward04a,
  title = {Answer Set Programming with Clause Learning},
  author = {J. Ward},
  school = {Ohio State University},
  type = {Dissertation},
  year = {2004}
}

@article{ward63a,
  title = {Hierarchical Grouping to Optimize an Objective Function},
  author = {J. Ward},
  journal = {Journal of the American Statistical Association},
  number = {301},
  pages = {236-244},
  publisher = {American Statistical Association},
  volume = {58},
  year = {1963}
}

@article{warebealbaknky18a,
  title = {Optimization of Global Production Scheduling with Deep Reinforcement Learning},
  author = {B. Waschneck and A. Reichstaller and L. Belzner and T. Altenm{\"u}ller and T. Bauernhansl and A. Knapp and A. Kyek},
  journal = {Procedia CIRP},
  pages = {1264-1269},
  volume = {72},
  year = {2018}
}

@article{warners98a,
  title = {A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form},
  author = {J. Warners},
  journal = ipl,
  number = {2},
  pages = {63-69},
  volume = {68},
  year = {1998}
}

@inproceedings{warren76a,
  title = {Generating Conditional Plans and Programs},
  author = {D. Warren},
  booktitle = {Proceedings of the Summer Conference on Artificial Intelligence and Simulation of Behaviour (ECAI'76)},
  pages = {344-354},
  year = {1976}
}

@inproceedings{warsch04a,
  title = {Answer Set Programming with Clause Learning},
  author = {J. Ward and J. Schlipf},
  crossref = {lpnmr04},
  pages = {302-313}
}

@inproceedings{wasasu05a,
  title = {A Theory of Forgetting in Logic Programming},
  author = {K. Wang and A. Sattar and K. Su},
  crossref = {aaai05},
  pages = {682-688}
}

@inproceedings{watchi03a,
  title = {Modeling Hybrid Systems in Action Languages},
  author = {R. Watson and S. Chintabathina},
  crossref = {asp03},
  year = {2003}
}

@inproceedings{watekocu21a,
  title = {{DatalogMTL} with Negation under Stable Models Semantics},
  author = {P. Wa{\l}ega and D. {Tena~Cucala} and E. Kostylev and B. {Cuenca Grau}},
  crossref = {kr21},
  pages = {609-618}
}

@inproceedings{wayafalixu15a,
  title = {A Complete Epistemic Planner without the Epistemic Closed World Assumption},
  author = {H. Wan and R. Yang and L. Fang and Y. Liu and H. Xu},
  crossref = {ijcai15},
  pages = {3257-3263}
}

@inproceedings{wazhli00,
  title = {Alternating fixpoint theory for logic programs with priority},
  author = {K. Wang and L. Zhou and F. Lin},
  crossref = {cl00},
  pages = {164-178}
}

@inproceedings{weansm98a,
  title = {Extending Graphplan to Handle Uncertainty {\&} Sensing Actions},
  author = {D. Weld and C. Anderson and D. Smith},
  crossref = {aaai98},
  pages = {897-904}
}

@article{webotowi03a,
  title = {A Resource Logic for Multi-Agent Plan Merging},
  author = {M. de Weerdt and A. Bos and H. Tonino and C. Witteveen},
  journal = amai,
  number = {1-2},
  pages = {93-130},
  volume = {37},
  year = {2003}
}

@article{weecle09a,
  title = {Introduction to planning in multiagent systems},
  author = {M. de Weerdt and B. Clement},
  journal = {Multiagent and Grid Systems},
  number = {4},
  pages = {345-355},
  volume = {5},
  year = {2009}
}

@inproceedings{wehrin07a,
  title = {Planning as Satisfiability with Relaxed $\exists$-Step Plans},
  author = {M. Wehrle and J. Rintanen},
  crossref = {ausai07},
  pages = {244-253}
}

@inproceedings{weinzierl13a,
  title = {Learning Non-Ground Rules for Answer-Set Solving},
  author = {A. Weinzierl},
  crossref = {gttv13},
  pages = {25-37}
}

@article{weld94a,
  title = {An Introduction to Least Commitment Planning},
  author = {D. Weld},
  journal = aim,
  number = {4},
  pages = {27-61},
  volume = {15},
  year = {1994}
}

@article{wetafr20a,
  title = {Advancing Lazy-Grounding {ASP} Solving Techniques --- Restarts, Phase Saving, Heuristics, and More},
  author = {A. Weinzierl and R. Taupe and G. Friedrich},
  journal = tplp,
  number = {5},
  pages = {609-624},
  url = {http://arxiv.org/abs/2008.03526},
  volume = {20},
  year = {2020}
}

@inproceedings{whkisa01a,
  title = {{SATIRE}: a new incremental satisfiability engine},
  author = {J. Whittemore and J. Kim and K. Sakallah},
  crossref = {dac01},
  pages = {542-545}
}

@inproceedings{wibamobe12a,
  title = {Knowledge Enabled High-Level Task Abstraction and Execution},
  author = {J. Winkler and G. Bartels and L. M{\"o}senlechner and M. Beetz},
  booktitle = {First Annual Conference on Advances in Cognitive Systems},
  number = {1},
  pages = {131-148},
  volume = {2},
  year = {2012}
}

@article{widebr13a,
  title = {Constraint Propagation for First-Order Logic and Inductive Definitions},
  author = {J. Wittocx and M. Denecker and M. Bruynooghe},
  journal = tocl,
  number = {3},
  pages = {17:1-17:45},
  volume = {14},
  year = {2013}
}

@inproceedings{wigose03a,
  title = {Backdoors to typical case complexity},
  author = {R. Williams and C. Gomes and B. Selman},
  crossref = {ijcai03},
  pages = {1173-1178}
}

@inproceedings{williams02a,
  title = {Algorithms for Quantified {B}oolean Formulas},
  author = {R. Williams},
  crossref = {soda02},
  pages = {299-307}
}

@inproceedings{wilnay96a,
  title = {A Model-Based Approach to Reactive Self-Configuring Systems},
  author = {B. Williams and P. Nayak},
  crossref = {aaai96},
  pages = {971-978}
}

@article{wimade10a,
  title = {Grounding {FO} and {FO(ID)} with Bounds},
  author = {J. Wittocx and M. Mari{\"e}n and M. Denecker},
  journal = jair,
  pages = {223-269},
  volume = {38},
  year = {2010}
}

@article{wimowi14a,
  title = {Push and Rotate: a Complete Multi-agent Pathfinding Algorithm},
  author = {B. de Wilde and A. ter Mors and C. Witteveen},
  journal = jair,
  pages = {443-492},
  volume = {51},
  year = {2014}
}

@inproceedings{winihe09a,
  title = {Tarmo: A Framework for Parallelized Bounded Model Checking},
  author = {S. Wieringa and M. Niemenmaa and K. Heljanko},
  crossref = {pdmc09},
  pages = {62-76}
}

@inproceedings{winslett88,
  title = {Reasoning About Action Using a Possible Models Approach},
  author = {M. Winslett},
  booktitle = aaai,
  pages = {89-93},
  year = {1988}
}

@inproceedings{wiremabe17a,
  title = {{HQSpre} - {A}n Effective Preprocessor for {QBF} and {DQBF}},
  author = {R. Wimmer and S. Reimer and P. Marin and B. Becker},
  crossref = {tacas17},
  pages = {373-390}
}

@article{woje95a,
  title = {Intelligent agents: theory and practice},
  author = {M. Wooldridge and N. Jennings},
  journal = {Knowledge Engineering Review},
  number = {2},
  pages = {115-152},
  volume = {10},
  year = {1995}
}

@book{wolb84,
  title = {Automated Reasoning, Introduction and Applications},
  author = {L. Wos and R. Overbeek and E. Lusk and J. Boyle},
  publisher = {Prentice-Hall},
  year = {1984}
}

@article{wolper01a,
  title = {Constructing Automata from Temporal Logic Formulas: A Tutorial*},
  author = {P. Wolper},
  journal = {Lectures on Formal Methods and Performance Analysis: First EEF/Euro Summer School on Trends in Computer Science},
  pages = {261-277},
  publisher = springer,
  volume = {2090},
  year = {2001}
}

@article{wolper83a,
  title = {Temporal Logic Can Be More Expressive},
  author = {P. Wolper},
  journal = {Information and Control},
  number = {1/2},
  pages = {72-99},
  volume = {56},
  year = {1983}
}

@article{wolper85a,
  title = {The Tableau Method for Temporal Logic: An Overview},
  author = {P. Wolper},
  journal = {Logique et Analyse},
  pages = {119-136},
  volume = {28},
  year = {1985}
}

@inproceedings{woltran04a,
  title = {Characterizations for Relativized Notions of Equivalence in Answer Set Programming},
  author = {S. Woltran},
  crossref = {jelia04},
  pages = {161-173}
}

@inproceedings{woltran10a,
  title = {Equivalence between Extended Datalog Programs - A Brief Survey},
  author = {S. Woltran},
  crossref = {datalog10},
  pages = {106-119}
}

@inproceedings{wong07a,
  title = {A Stronger Notion of Equivalence for Logic Programs},
  author = {K. Wong},
  crossref = {iclp07},
  pages = {453-454}
}

@article{wong08a,
  title = {Sound and Complete Inference Rules for SE-Consequence},
  author = {K. Wong},
  journal = jair,
  pages = {205-216},
  volume = {31},
  year = {2008}
}

@inproceedings{woocia00a,
  title = {Agent-Oriented Software Engineering: The State of the Art},
  author = {M. Wooldridge and P. Ciancarini},
  crossref = {aose00},
  pages = {1-28}
}

@inproceedings{woojen98a,
  title = {Pitfalls of agent-oriented development},
  author = {M. Wooldridge and N. Jennings},
  booktitle = {Proceedings of the Second International Conference on Autonomous Agents (Agents'98)},
  pages = {385-391},
  publisher = acm,
  year = {1998}
}

@book{wooldridge00a,
  title = {Reasoning about rational agents},
  author = {M. Wooldridge},
  publisher = {MIT press},
  year = {2000}
}

@book{wooldrige02a,
  title = {Introduction to multiagent systems},
  author = {M. Wooldridge},
  pages = {348},
  publisher = wiley,
  year = {2002}
}

@book{woovlubo84,
  title = {Automated {R}easoning, {I}ntroduction and {A}pplications},
  author = {L. Wos and R. Overbeek and E. Lusk and J. Boyle},
  publisher = {Prentice-Hall},
  year = {1984}
}

@inproceedings{wotawa20a,
  title = {On the Use of Answer Set Programming for Model-Based Diagnosis},
  author = {F. Wotawa},
  editor = {H. Fujita and P. Fournier-Viger and M. Ali and J. Sasaki},
  booktitle = {Proceedings of the Thirty-third International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE'20)},
  pages = {518-529},
  publisher = springer,
  series = lncs,
  volume = {12144},
  year = {2020}
}

@article{wucaga09a,
  title = {Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming},
  author = {Y. and M. Caminada and D. Gabbay},
  journal = {Studia Logica},
  number = {2-3},
  pages = {383-403},
  volume = {93},
  year = {2009}
}

@article{wudamo08a,
  title = {Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses},
  author = {P. Wurman and R. D'Andrea and M. Mountz},
  journal = aim,
  number = {1},
  pages = {9-20},
  volume = {29},
  year = {2008}
}

@article{xigapelili19a,
  title = {Review on Flexible Job Shop Scheduling},
  author = {J. Xie and L. Gao and K. Peng and X. Li and H. Li},
  journal = {IET Collaborative Intelligent Manufacturing},
  number = {3},
  pages = {67-77},
  volume = {1},
  year = {2019}
}

@article{xishrehu22a,
  title = {A Survey of Job Shop Scheduling Problem: The Types and Models},
  author = {H. Xiong and S. Shi and D. Ren and J. Hu},
  journal = {Computers \& Operations Research},
  pages = {105731},
  volume = {142},
  year = {2022}
}

@article{xizh05a,
  title = {Max{S}olver: An Efficient Exact Algorithm for (Weighted) Maximum Satisfiability},
  author = {Z. Xing and W. Zhang},
  journal = ai,
  number = {1-2},
  pages = {47-80},
  volume = {164},
  year = {2005}
}

@inproceedings{xuhole07a,
  title = {Hierarchical Hardness Models for {SAT}},
  author = {L. Xu and H. Hoos and K. Leyton-Brown},
  crossref = {cp07},
  pages = {696-711}
}

@inproceedings{xuhole10a,
  title = {Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection},
  author = {L. Xu and H. Hoos and K. Leyton-Brown},
  crossref = {aaai10},
  pages = {210-216}
}

@article{xuhuhole08a,
  title = {{SAT}zilla: Portfolio-based Algorithm Selection for {SAT}},
  author = {L. Xu and F. Hutter and H. Hoos and K. Leyton-Brown},
  journal = jair,
  pages = {565-606},
  volume = {32},
  year = {2008}
}

@inproceedings{xuhuhole09a,
  title = {{SAT}zilla2009: An Automatic Algorithm Portfolio for {SAT}},
  author = {L. Xu and F. Hutter and H. Hoos and K. Leyton-Brown},
  crossref = {satbooklet09},
  pages = {53-55}
}

@article{yambor09a,
  title = {Evolution of biomolecular networks: lessons from metabolic and protein interactions},
  author = {T. Yamada and P. Bork},
  journal = {Nature Reviews Molecular Cell Biology},
  number = {11},
  pages = {791-803},
  volume = {10},
  year = {2009}
}

@article{yanopaer17a,
  title = {Hybrid Conditional Planning using Answer Set Programming},
  author = {I. Yalciner and A. Nouman and V. Patoglu and E. Erdem},
  journal = tplp,
  number = {5-6},
  pages = {1027-1047},
  volume = {17},
  year = {2017}
}

@inproceedings{youliu08a,
  title = {Loop Formulas for Logic Programs with Arbitrary Constraint Atoms},
  author = {J. You and G. Liu},
  crossref = {aaai08},
  pages = {584-589}
}

@article{yowayu01,
  title = {Nonmonotonic reasoning as prioritized argumentation},
  author = {J. You and X. Wang and L. Yuan},
  journal = tkde,
  number = {13},
  pages = {968-979},
  volume = {6},
  year = {2001}
}

@inproceedings{yoyulish07a,
  title = {Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities},
  author = {J. You and L. Yuan and G. Liu and Y. Shen},
  crossref = {lpnmr07},
  pages = {228-240}
}

@inproceedings{yoyuzh03a,
  title = {On the equivalence between answer sets and models of completion for nested logic programs},
  author = {J. You and L. Yuan and M. Zhang},
  crossref = {ijcai03}
}

@inproceedings{yulav12a,
  title = {Multi-agent Path Planning and Network Flow},
  author = {J. Yu and S. LaValle},
  editor = {E. Frazzoli and T. {Lozano-P{\'e}rez} and N. Roy and D. Rus},
  booktitle = {Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics (WAFR'12)},
  doi = {10.1007/978-3-642-36279-8_10},
  pages = {157-173},
  publisher = springer,
  series = {Springer Tracts in Advanced Robotics},
  volume = {86},
  year = {2012}
}

@article{yulav16a,
  title = {Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics},
  author = {J. Ju and S. LaValle},
  journal = {{IEEE} Transactions on Robotics},
  number = {5},
  pages = {1163-1177},
  volume = {32},
  year = {2016}
}

@inproceedings{yuneps12a,
  title = {Learning Algorithm Portfolios for Parallel Execution},
  author = {X. Yun and S. Epstein},
  crossref = {lion12},
  pages = {323-338}
}

@article{zadeh75,
  title = {Fuzzy Logic and Approximate Reasoning},
  author = {L. Zadeh},
  journal = {Synthese},
  pages = {407-428},
  volume = {30},
  year = {1975}
}

@article{zadeh83,
  title = {Commonsense Knowledge Representation Based on Fuzzy Logic},
  author = {L. Zadeh},
  journal = {IEEE Computer},
  number = {10},
  pages = {61-66},
  volume = {16},
  year = {1983}
}

@article{zaki01a,
  title = {{SPADE}: An Efficient Algorithm for Mining Frequent Sequences},
  author = {M. Zaki},
  journal = {Machine Learning},
  number = {1-2},
  pages = {31-60},
  volume = {42},
  year = {2001}
}

@inproceedings{zamamoma01a,
  title = {Efficient Conflict Driven Learning in a {B}oolean Satisfiability Solver},
  author = {L. Zhang and C. Madigan and M. Moskewicz and S. Malik},
  editor = {R. Ernst},
  booktitle = {Proceedings of the International Conference on Computer-Aided Design (ICCAD'01)},
  pages = {279-285},
  publisher = ieee,
  year = {2001}
}

@inproceedings{zaniolo12a,
  title = {Logical Foundations of Continuous Query Languages for Data Streams},
  author = {C. Zaniolo},
  crossref = {datalog12},
  pages = {177-189}
}

@inproceedings{zarpas05a,
  title = {Benchmarking {SAT} Solvers for Bounded Model Checking},
  author = {E. Zarpas},
  crossref = {sat05},
  pages = {340-354}
}

@inproceedings{zaverucha94a,
  title = {A Prioritized Contextual Default Logic: Curing Anomalous Extensions with a Simple Abnormality Default Theory},
  author = {G. Zaverucha},
  editor = {B. Nebel and L. Dreschler-Fischer},
  booktitle = {Proceedings of Eighteenth Annual German Conference on Artificial Intelligence (KI'94)},
  publisher = springer,
  year = {1994}
}

@article{zayadashcoin17a,
  title = {Fixpoint Semantics and Optimization of Recursive {D}atalog Programs with Aggregates},
  author = {C. Zaniolo and M. Yang and A. Das and A. Shkapsky and T. Condie and M. Interlandi},
  journal = tplp,
  number = {5-6},
  pages = {1048-1065},
  volume = {17},
  year = {2017}
}

@article{zdstchcebaba03a,
  title = {The {A}urora and {M}edusa Projects},
  author = {S. Zdonik and M. Stonebraker and M. Cherniack and U. {\c{C}}etintemel and M. Balazinska and H. Balakrishnan},
  journal = {IEEE Data Engineering Bulletin},
  number = {1},
  pages = {3-10},
  volume = {26},
  year = {2003}
}

@article{zenpal12a,
  title = {A road map for the development of community systems (CoSy) biology},
  author = {K. Zengler and B. Palsson},
  journal = {Nature Reviews Microbiology},
  number = {5},
  pages = {366-372},
  volume = {10},
  year = {2012}
}

@techreport{zetzsche88,
  title = {Einige Ergebnisse zur formalen Begr{\"u}ndung des {ATMS}},
  author = {F. Zetzsche},
  address = {Am R{\"o}merhof 35, 6000 Frankfurt},
  institution = {Battelle Institut e. V.},
  number = {43-88},
  type = {TEX-B Memo},
  year = {1988}
}

@inproceedings{zetzsche89,
  title = {Nonmonotonic Reasoning with the {ATMS}},
  author = {F. Zetzsche},
  editor = {J. Martins and E. Morgado},
  booktitle = {Proceedings of the Fourth Portugese Conference on Artificial Intelligence},
  pages = {119-128},
  publisher = springer,
  year = {1989}
}

@inproceedings{zhafoo05a,
  title = {A Unified Framework for Representing Logic Program Updates.},
  author = {Y. Zhang and N. Foo},
  crossref = {aaai05},
  pages = {707-713}
}

@article{zhafoo06a,
  title = {Solving logic program conflict through strong and weak forgettings},
  author = {Y. Zhang and N. Foo},
  journal = ai,
  number = {8-9},
  pages = {739-778},
  volume = {170},
  year = {2006}
}

@inproceedings{zhafoo97a,
  title = {Answer Sets for Prioritized Logic Programs},
  author = {Y. Zhang and N. Foo},
  editor = {J. Maluszynski},
  booktitle = {Proceedings of the International Symposium on Logic Programming (ILPS'97)},
  pages = {69-84},
  publisher = {MIT Press},
  year = {1997}
}

@article{zhahua05a,
  title = {Reducing Symmetries to Generate Easier {SAT} Instances},
  author = {J. Zhang and Z. Huang},
  journal = {Electronic Notes in Theoretical Computer Science},
  number = {3},
  pages = {149-164},
  volume = {125},
  year = {2005}
}

@inproceedings{zhamal03a,
  title = {Validating {SAT} Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications},
  author = {L. Zhang and S. Malik},
  crossref = {date03},
  pages = {10880-10885}
}

@article{zhamar90,
  title = {On the classification and existence of structures in default logic},
  author = {A. Zhang and V. Marek},
  journal = {Fundamenta Informaticae},
  number = {4},
  pages = {485-499},
  volume = {8},
  year = {1990}
}

@article{zhang02a,
  title = {Two results for prioritized logic programming},
  author = {Y. Zhang},
  journal = tplp,
  number = {2},
  pages = {223-242},
  volume = {3},
  year = {2003}
}

@article{zhang14a,
  title = {Product configuration: a review of the state-of-the art and future research},
  author = {L. Zhang},
  doi = {10.1080/00207543.2014.942012},
  journal = ijpr,
  number = {21},
  pages = {6381-6398},
  volume = {52},
  year = {2014}
}

@article{zhang96a,
  title = {Constructing finite algebras with {FALCON}},
  author = {J. Zhang},
  journal = jar,
  number = {1},
  pages = {1-22},
  volume = {17},
  year = {1996}
}

@inproceedings{zhang97a,
  title = {{SATO}: An Efficient Propositional Prover},
  author = {H. Zhang},
  crossref = {cade97},
  pages = {272-275}
}

@article{zhathi14a,
  title = {Representing and Reasoning about Game Strategies},
  author = {D. Zhang and M. Thielscher},
  journal = {Journal of Philosophical Logic},
  pages = {203-236},
  volume = {44},
  year = {2015}
}

@inproceedings{zhazha95a,
  title = {{SEM}: A System for Enumerating Models},
  author = {J. Zhang and H. Zhang},
  booktitle = {Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95)},
  pages = {298-303},
  publisher = m-k,
  year = {1995}
}

@article{zhbado15a,
  title = {Planning as Tabled Logic Programming},
  author = {N. Zhou and R. Bart{\'a}k and A. Dovier},
  journal = tplp,
  number = {4-5},
  pages = {543-558},
  volume = {15},
  year = {2015}
}

@article{zhbohs96a,
  title = {{PSATO}: a Distributed Propositional Prover and its Application to Quasigroup Problems},
  author = {H. Zhang and M. Bonacina and J. Hsiang},
  journal = jsc,
  number = {4},
  pages = {543-560},
  url = {citeseer.ist.psu.edu/zhang96psato.html},
  volume = {21},
  year = {1996}
}

@inproceedings{zhlisuko20a,
  title = {Multi-Agent Path Finding with Mutex Propagation},
  author = {H. Zhang and J. Li and P. Surynek and S. Koenig and T. Kumar},
  crossref = {icaps20},
  pages = {323-332}
}

@inproceedings{zhma02a,
  title = {Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified {B}oolean Formula Evaluation},
  author = {L. Zhang and S. Malik},
  crossref = {cp02},
  pages = {200-215}
}

@inproceedings{zhma02b,
  title = {Conflict Driven Learning in a Quantified {B}oolean Satisfiability Solver},
  author = {L. Zhang and S. Malik},
  crossref = {iccad02},
  pages = {442-449}
}

@misc{zhou13a,
  title = {The {SAT} Compiler in {B}-Prolog},
  author = {N. Zhou},
  howpublished = {The Association for Logic Programming Newsletter},
  month = mar,
  url = {http://www.cs.nmsu.edu/ALP/2013/03/the-sat-compiler-in-b-prolog/},
  year = {2013}
}

@inproceedings{zhpuva19a,
  title = {First-Order vs. Second-Order Encodings for {LTLf}-to-Automata Translation},
  author = {S. Zhu and G. Pu and M. Vardi},
  crossref = {tamc19},
  pages = {684-705}
}

@inproceedings{zhsuzhlicaxizh20a,
  title = {N{L}ocal{SAT}: Boosting Local Search with Solution Prediction},
  author = {W. Zhang and Z. Sun and Q. Zhu and G. Li and S. Cai and Y. Xiong and L. Zhang},
  crossref = {ijcai20},
  pages = {1177-1183}
}

@inproceedings{zhtalipuva17a,
  title = {Symbolic {LTLf} Synthesis},
  author = {S. Zhu and L. Tabajara and J. Li and G. Pu and M. Vardi},
  crossref = {ijcai17},
  pages = {1362-1369}
}

@incollection{zhugiv04a,
  title = {Heuristic Planning via Roadmap Deduction},
  author = {L. Zhu and R. Givan},
  booktitle = {{IPC-4}},
  pages = {64-66},
  year = {2004}
}

@inproceedings{zhutru13a,
  title = {On optimal solutions of answer set optimization problems},
  author = {Y. Zhu and M. Truszczy{\'n}ski},
  crossref = {lpnmr13},
  pages = {556-568}
}

@article{zithlafofo03a,
  title = {Performance assessment of multiobjective optimizers: an analysis and review},
  author = {E. Zitzler and L. Thiele and M. Laumanns and C. Fonseca and V. da Fonseca},
  doi = {10.1109/TEVC.2003.810758},
  journal = {IEEE Transactions on Evolutionary Computation},
  number = {2},
  pages = {117-132},
  volume = {7},
  year = {2003}
}

@article{zithlafogr03a,
  title = {Performance Assessment of Multiobjective Optimizers: An Analysis and Review},
  author = {E. Zitzler and L. Thiele and M. Laumanns and C. Fonseca and V. {Grunert da Fonseca}},
  journal = {IEEE Transactions on Evolutionary Computation},
  number = {2},
  pages = {117-132},
  volume = {7},
  year = {2003}
}

@inproceedings{zlapop90,
  title = {A Truth Maintenance Theory (Preliminary report)},
  author = {N. Zlatareva and I. Popchev},
  editor = {K. Konolige},
  booktitle = {Third International Workshop on Nonmonotonic Reasoning},
  pages = {259-271},
  year = {1990}
}