{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T18:21:09Z","timestamp":1747592469125},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030467135"},{"type":"electronic","value":"9783030467142"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46714-2_11","type":"book-chapter","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T19:29:02Z","timestamp":1588620542000},"page":"160-177","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Wernhard","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,5]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W Ackermann","year":"1935","unstructured":"Ackermann, W.: Untersuchungen \u00fcber das Eliminationsproblem der mathematischen Logik. Math. Ann. 110, 390\u2013413 (1935)","journal-title":"Math. Ann."},{"key":"11_CR2","unstructured":"Alassaf, R., Schmidt, R.: DLS-Forgetter: an implementation of the DLS forgetting calculus for first-order logic. In: GCAI 2019. EPiC, vol. 65, pp. 127\u2013138 (2019)"},{"issue":"3\u20134","key":"11_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01457985","volume":"86","author":"H Behmann","year":"1922","unstructured":"Behmann, H.: Beitr\u00e4ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem. Math. Ann. 86(3\u20134), 163\u2013229 (1922)","journal-title":"Math. Ann."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Kostylev, E.V., Mogavero, F., Tsamoura, E.: Reformulating queries: theory and practice. In: IJCAI 2017, pp. 837\u2013843. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/116"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Leblay, J., ten Cate, B., Tsamoura, E.: Generating Plans from Proofs: The Interpolation-Based Approach to Query Reformulation. Morgan & Claypool, San Rafael (2016)","DOI":"10.2200\/S00703ED1V01Y201602DTM043"},{"issue":"11","key":"11_CR6","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/182.183","volume":"26","author":"W Bibel","year":"1983","unstructured":"Bibel, W.: Matings in matrices. Commun. ACM 26(11), 844\u2013852 (1983)","journal-title":"Commun. ACM"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10817-014-9314-0","volume":"54","author":"MP Bonacina","year":"2015","unstructured":"Bonacina, M.P., Johansson, M.: On interpolation in automated theorem proving. J. Autom. Reason. 54(1), 69\u201397 (2015)","journal-title":"J. Autom. Reason."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-18275-4_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Brillout","year":"2011","unstructured":"Brillout, A., Kroening, D., R\u00fcmmer, P., Wahl, T.: Beyond quantifier-free interpolation in extensions of Presburger arithmetic. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 88\u2013102. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-18275-4_8"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10817-011-9237-y","volume":"47","author":"A Brillout","year":"2011","unstructured":"Brillout, A., Kroening, D., R\u00fcmmer, P., Wahl, T.: An interpolating sequent calculus for quantifier-free Presburger arithmetic. J. Autom. Reason. 47(4), 341\u2013367 (2011)","journal-title":"J. Autom. Reason."},{"issue":"3\u20134","key":"11_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.3166\/jancl.16.279-296","volume":"16","author":"W Conradie","year":"2006","unstructured":"Conradie, W.: On the strength and scope of DLS. J. Appl. Non-Classsical Logics 16(3\u20134), 279\u2013296 (2006)","journal-title":"J. Appl. Non-Classsical Logics"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Craig, W.: Linear reasoning. A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic 22(3), 250\u2013268 (1957)","DOI":"10.2307\/2963593"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/2963594","volume":"22","author":"W Craig","year":"1957","unstructured":"Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic 22(3), 269\u2013285 (1957)","journal-title":"J. Symbolic Logic"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1613\/jair.5530","volume":"60","author":"JP Delgrande","year":"2017","unstructured":"Delgrande, J.P.: A knowledge level account of forgetting. J. Artif. Intell. Res. 60, 1165\u20131213 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P Doherty","year":"1997","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing circumscription revisited: a reduction algorithm. J. Autom. Reason. 18(3), 297\u2013338 (1997)","journal-title":"J. Autom. Reason."},{"key":"11_CR15","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing strongest necessary and weakest sufficient conditions of first-order formulas. In: IJCAI-01, pp. 145\u2013151. Morgan Kaufmann (2001)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1093\/logcom\/exv059","volume":"27","author":"S Eberhard","year":"2017","unstructured":"Eberhard, S., Hetzl, S., Weller, D.: Boolean unification with predicates. J. Logic Comput. 27(1), 109\u2013128 (2017)","journal-title":"J. Logic Comput."},{"key":"11_CR17","unstructured":"Engel, T.: Quantifier elimination in second-order predicate logic. Master\u2019s thesis, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken (1996)"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Fitting, M.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-2360-3","DOI":"10.1007\/978-1-4612-2360-3"},{"key":"11_CR19","unstructured":"Gabbay, D., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. In: KR 1992, pp. 425\u2013435. Morgan Kaufmann (1992)"},{"key":"11_CR20","unstructured":"Gabbay, D.M., Schmidt, R.A., Sza\u0142as, A.: Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications. College Publications (2008)"},{"key":"11_CR21","unstructured":"Ghilardi, S., Lutz, C., Wolter, F.: Did I damage my ontology? A case for conservative extensions in description logics. In: KR 2006, pp. 187\u2013197. AAAI Press (2006)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1613\/jair.2375","volume":"31","author":"BC Grau","year":"2008","unstructured":"Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: Modular reuse of ontologies: theory and practice. J. Artif. Intell. Res. 31(1), 273\u2013318 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR23","unstructured":"Gustafsson, J.: An implementation and optimization of an algorithm for reducing formulae in second-order logic. Technical report LiTH-MAT-R-96-04, Univ. Link\u00f6ping (1996)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-35182-2_11","volume-title":"Programming Languages and Systems","author":"K Hoder","year":"2012","unstructured":"Hoder, K., Holzer, A., Kov\u00e1cs, L., Voronkov, A.: Vinter: a Vampire-based tool for interpolation. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 148\u2013156. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35182-2_11"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-14203-1_16","volume-title":"Automated Reasoning","author":"K Hoder","year":"2010","unstructured":"Hoder, K., Kov\u00e1cs, L., Voronkov, A.: Interpolation and symbol elimination in Vampire. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS (LNAI), vol. 6173, pp. 188\u2013195. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14203-1_16"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-24312-2_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C.: Efficient low-level connection tableaux. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 102\u2013111. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24312-2_8"},{"key":"11_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-662-48899-7_7","volume-title":"LPAR 2015","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C., Urban, J.: FEMaLeCoP: fairly efficient machine learning connection prover. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 88\u201396. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48899-7_7"},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/comjnl\/27.2.97","volume":"27","author":"DE Knuth","year":"1984","unstructured":"Knuth, D.E.: Literate programming. Comput. J. 27(2), 97\u2013111 (1984)","journal-title":"Comput. J."},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-40885-4_7","volume-title":"Frontiers of Combining Systems","author":"P Koopmann","year":"2013","unstructured":"Koopmann, P., Schmidt, R.A.: Uniform interpolation of $$\\cal{ALC}$$-ontologies using fixpoints. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 87\u2013102. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40885-4_7"},{"key":"11_CR30","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order interpolation and interpolating proof systems. In: LPAR-21, pp. 49\u201364. EasyChair (2017)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Letz, R.: First-order tableau methods. In: D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 125\u2013196. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-94-017-1754-0_3"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0004-3702(01)00070-4","volume":"128","author":"F Lin","year":"2001","unstructured":"Lin, F.: On strongest necessary and weakest sufficient conditions. Artif. Intell. 128, 143\u2013159 (2001)","journal-title":"Artif. Intell."},{"key":"11_CR33","unstructured":"Lin, F., Reiter, R.: Forget It! In: Working Notes, AAAI Fall Symposium on Relevance, pp. 154\u2013159 (1994)"},{"key":"11_CR34","unstructured":"Ludwig, M., Konev, B.: Practical uniform interpolation and forgetting for $$\\cal{ALC}$$ TBoxes with applications to logical difference. In: KR 2014. AAAI Press (2014)"},{"key":"11_CR35","unstructured":"Lutz, C., Wolter, F.: Foundations for uniform interpolation and forgetting in expressive description logics. In: IJCAI 2011, pp. 989\u2013995. AAAI Press (2011)"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01458217","volume":"76","author":"L L\u00f6wenheim","year":"1915","unstructured":"L\u00f6wenheim, L.: \u00dcber M\u00f6glichkeiten im Relativkalk\u00fcl. Math. Ann. 76, 447\u2013470 (1915)","journal-title":"Math. Ann."},{"issue":"5","key":"11_CR37","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0020-0190(88)90119-6","volume":"29","author":"W McCune","year":"1988","unstructured":"McCune, W.: Un-Skolemizing clause sets. Inf. Process. Lett. 29(5), 257\u2013263 (1988)","journal-title":"Inf. Process. Lett."},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-31980-1_1","volume-title":"TACAS 2005","author":"KL McMillan","year":"2005","unstructured":"McMillan, K.L.: Applications of Craig interpolants in model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005, pp. 1\u201312. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31980-1_1"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"McMillan, K.L.: Interpolation and model checking. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 421\u2013446. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10575-8_14","DOI":"10.1007\/978-3-319-10575-8_14"},{"issue":"2\u20133","key":"11_CR40","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3233\/AIC-2010-0464","volume":"23","author":"J Otten","year":"2010","unstructured":"Otten, J.: Restricting backtracking in connection calculi. AI Commun. 23(2\u20133), 159\u2013182 (2010)","journal-title":"AI Commun."},{"key":"11_CR41","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-73595-3_37","volume-title":"Automated Deduction \u2013 CADE-21","author":"B Pelzer","year":"2007","unstructured":"Pelzer, B., Wernhard, C.: System description: E-KRHyper. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 508\u2013513. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73595-3_37"},{"key":"11_CR42","unstructured":"Rudeanu, S.: Boolean Functions and Equations. Elsevier (1974)"},{"issue":"1","key":"11_CR43","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.jal.2012.01.001","volume":"10","author":"RA Schmidt","year":"2012","unstructured":"Schmidt, R.A.: The Ackermann approach for modal logic, correspondence theory and second-order reduction. J. Appl. Logic 10(1), 52\u201374 (2012)","journal-title":"J. Appl. Logic"},{"key":"11_CR44","unstructured":"Schr\u00f6der, E.: Vorlesungen \u00fcber die Algebra der Logik. Teubner (1890\u20131905)"},{"key":"11_CR45","unstructured":"Smullyan, R.M.: First-Order Logic. Dover Publications, New York (1995). Corrected republication of the original edition by Springer-Verlag, New York (1968)"},{"issue":"4","key":"11_CR46","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"ME Stickel","year":"1988","unstructured":"Stickel, M.E.: A Prolog technology theorem prover: implementation by an extended Prolog compiler. J. Autom. Reason. 4(4), 353\u2013380 (1988)","journal-title":"J. Autom. Reason."},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0. J. Autom. Reason. 59(4), 483\u2013502 (2017)","DOI":"10.1007\/s10817-017-9407-7"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Toman, D., Weddell, G.: Fundamentals of Physical Design and Query Compilation. Morgan and Claypool, San Rafael (2011)","DOI":"10.2200\/S00363ED1V01Y201105DTM018"},{"key":"11_CR49","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-540-30227-8_46","volume-title":"Logics in Artificial Intelligence","author":"C Wernhard","year":"2004","unstructured":"Wernhard, C.: Semantic knowledge partitioning. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 552\u2013564. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30227-8_46"},{"key":"11_CR50","unstructured":"Wernhard, C.: Circumscription and projection as primitives of logic programming. In: Technical Communications ICLP 2010. LIPIcs, vol. 7, pp. 202\u2013211. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"11_CR51","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/j.jsc.2011.12.034","volume":"47","author":"C Wernhard","year":"2012","unstructured":"Wernhard, C.: Projection and scope-determined circumscription. J. Symbolic Comput. 47, 1089\u20131108 (2012)","journal-title":"J. Symbolic Comput."},{"key":"11_CR52","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-40885-4_8","volume-title":"Frontiers of Combining Systems","author":"C Wernhard","year":"2013","unstructured":"Wernhard, C.: Abduction in logic programming as second-order quantifier elimination. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 103\u2013119. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40885-4_8"},{"key":"11_CR53","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-41524-1_17","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"C Wernhard","year":"2013","unstructured":"Wernhard, C.: Computing with logic as operator elimination: the ToyElim system. In: Tompits, H., et al. (eds.) INAP\/WLP -2011. LNCS (LNAI), vol. 7773, pp. 289\u2013296. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41524-1_17"},{"key":"11_CR54","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-24312-2_18","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C Wernhard","year":"2015","unstructured":"Wernhard, C.: Second-order quantifier elimination on relational monadic formulas \u2013 a basic method and some less expected applications. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 253\u2013269. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24312-2_18"},{"key":"11_CR55","unstructured":"Wernhard, C.: The PIE system for proving, interpolating and eliminating. In: PAAR 2016, pp. 125\u2013138. CEUR-WS.org (2016)"},{"key":"11_CR56","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-66167-4_19","volume-title":"Frontiers of Combining Systems","author":"C Wernhard","year":"2017","unstructured":"Wernhard, C.: The Boolean solution problem from the perspective of predicate logic. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 333\u2013350. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66167-4_19"},{"key":"11_CR57","unstructured":"Wernhard, C.: Craig interpolation and access interpolation with clausal first-order tableaux. ArXiv e-prints (2018). \nhttps:\/\/arxiv.org\/abs\/1802.04982"},{"issue":"1\u20132","key":"11_CR58","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory Practice Logic Program. 12(1\u20132), 67\u201396 (2012)","journal-title":"Theory Practice Logic Program."}],"container-title":["Lecture Notes in Computer Science","Declarative Programming and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46714-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T19:29:58Z","timestamp":1588620598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-46714-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030467135","9783030467142"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46714-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WLP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wlp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.declare19.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}