{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:59Z","timestamp":1747546919931},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1007\/bf02031716","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T15:24:17Z","timestamp":1123687457000},"page":"9-79","source":"Crossref","is-referenced-by-count":2,"title":["CoLab: A hybrid knowledge representation and compilation laboratory"],"prefix":"10.1007","volume":"55","author":[{"given":"Harold","family":"Boley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hanschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Knut","family":"Hinkelmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02031716_CR1","unstructured":"A. Abecker, TAXLOG: Taxonomische Wissensrepr\u00e4sentation und Logische Programmierung, Projektarbeit (1993), in German."},{"key":"BF02031716_CR2","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"J.F. Allen, Maintaining knowledge about temporal intervals, Commun. ACM 26 (1983) 832\u2013843.","journal-title":"Commun. ACM"},{"key":"BF02031716_CR3","series-title":"Technical Report","volume-title":"Concept logics","author":"F. Baader","year":"1990","unstructured":"F. Baader, H.-J. B\u00fcrckert, B. Hollunder, W. Nutt and J.H. Siekmann, Concept logics, Technical Report RR-90-10, DFKI, Kaiserslautern, Germany (1990)."},{"key":"BF02031716_CR4","unstructured":"F. Baader and P. Hanschke, A scheme for integrating concrete domains into concept languages, in:Proc. 12th Int. Joint Conf. on Artificial Intelligence (1991)."},{"key":"BF02031716_CR5","unstructured":"F. Baader and P. Hanschke, Extensions of concept languages for a mechanical engineering application, inProc. German Workshop on Artificial Intelligence. GWAI-92 (Springer, September 1992)."},{"key":"BF02031716_CR6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Commun. ACM 21 (1978) 613\u2013641.","journal-title":"Commun. ACM"},{"key":"BF02031716_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0743-1066(87)90004-5","volume":"4","author":"I. Balbin","year":"1987","unstructured":"I. Balbin and K. Ramamohanarao, A generalization of the differential approach to recursive query evaluation, J. Logic Progr. 4 (1987) 259\u2013262.","journal-title":"J. Logic Progr."},{"key":"BF02031716_CR8","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies, inProc. ACM SIGMOD Conf. (ACM, 1986) pp. 16\u201352.","DOI":"10.1145\/16856.16859"},{"key":"BF02031716_CR9","first-page":"441","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"F. Bancilhon","year":"1988","unstructured":"F. Bancilhon and R. Ramakrishnan, Performance evaluation of data intensive logic programs, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 441\u2013517."},{"key":"BF02031716_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrishnan, On the power of magic, J. Logic Progr. 10 (1991) 255\u2013299.","journal-title":"J. Logic Progr."},{"key":"BF02031716_CR11","first-page":"131","volume":"89","author":"H. Beringer","year":"1989","unstructured":"H. Beringer and F. Porcher, A relevant scheme for Prolog extensions: CLP(conceptual theory), in:Proc. ICLP 89 (1989) 131\u2013148.","journal-title":"Proc. ICLP"},{"key":"BF02031716_CR12","unstructured":"H. Boley, A relational\/functional language and its compilation into the WAM, SEKI Report SR-90-05, Universit\u00e4t Kaiserslautern, Fachbereich Informatik (April 1990)."},{"key":"BF02031716_CR13","doi-asserted-by":"crossref","unstructured":"H. Boley, Extended logic-plus-functional programming, in:Workshop on Extensions of Logic Programming, ELP '91, Stockholm 1991, LNAI (Springer, 1992).","DOI":"10.1007\/BFb0013603"},{"key":"BF02031716_CR14","doi-asserted-by":"crossref","unstructured":"H. Boley, A direct semantic characterization of RELFUN, in:Proc. 3rd Int. Workshop on ELP '92, eds. E. Lamma and P. Mello, vol. 660 of LNAI (Springer, 1993).","DOI":"10.1007\/3-540-56454-3_7"},{"key":"BF02031716_CR15","unstructured":"H. Boley, K. Elsbernd, H.-G. Hein and T. Krause, RFM manual: Compiling RELFUN into the relational\/functional machine, Document D-91-03, DFKI (1991)."},{"key":"BF02031716_CR16","unstructured":"H. Boley, P. Hanschke, M. Harm, K. Hinkelmann, T. Labisch, M. Meyer, J. Mueller, T. Oltzen, M. Sintek, W. Stein and F. Steinle, \u03bcCAD2NC: A declarative lathe-workplanning model transforming CAD-like geometries into abstract NC programs, Technical Report Document D-91-15, University of Kaiserslautern, DFKI (November 1991)."},{"key":"BF02031716_CR17","doi-asserted-by":"crossref","unstructured":"A. Borgida, R.J. Brachman, D.L. McGuinness and L.A. Resnick, CLASSIC: A structural data model for objects, in:Int. Conf. on Management of Data, ACM SIGMOD (1989).","DOI":"10.1145\/67544.66932"},{"key":"BF02031716_CR18","unstructured":"R.J. Brachman, V.P. Gilbert and H.J. Levesque, An essential hybrid reasoning system: knowledge and symbol level accounts in KRYPTON, in:Proc. 9th Int. Joint Conf. on Artificial Intelligence (August 1985) pp. 532\u2013539."},{"key":"BF02031716_CR19","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1207\/s15516709cog0902_1","volume":"9","author":"R.J. Brachman","year":"1985","unstructured":"R.J. Brachman and J.G. Schmolze, An overview of the KL-ONE knowledge representation system, Cognitive Sci. 9 (1985) 171\u2013216.","journal-title":"Cognitive Sci."},{"key":"BF02031716_CR20","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0004-3702(85)90016-5","volume":"27","author":"W.J. Clancey","year":"1985","unstructured":"W.J. Clancey, Heuristic classification, Art. Int. 27 (1985) 289\u2013350.","journal-title":"Art. Int."},{"key":"BF02031716_CR21","unstructured":"D. DeGroot and G. Lindstrom (eds.),Logic Programming: Functions, Relations, and Equations (Prentice-Hall, 1986)."},{"key":"BF02031716_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0004-3702(85)90053-0","volume":"27","author":"Y. Descotte","year":"1985","unstructured":"Y. Descotte and J.-C. Latombe, Making compromises among antagonist constraints in a planner, Art. Int. 27 (1985) 183\u2013217.","journal-title":"Art. Int."},{"key":"BF02031716_CR23","unstructured":"F. Donini, B. Hollunder, M. Lenzerini, A.M. Spaccamela, D. Nardi and W. Nutt, The complexity of existential quantificatoin in concept languages, Research Report RR-91-02, DFKI (January 1991)."},{"key":"BF02031716_CR24","unstructured":"C. Falter, Compilation von Vorw\u00e4rtsregeln in einer hybriden Expertensystem-Shell, Diploma thesis, University of Kaiserslautern, FB Informatik (1992), in German."},{"key":"BF02031716_CR25","doi-asserted-by":"crossref","DOI":"10.21236\/ADA106558","volume-title":"OPS5 User's Manual","author":"C.L. Forgy","year":"1981","unstructured":"C.L. Forgy,OPS5 User's Manual, Carnegie-Mellon University, Department of Computer Science, Pittsburgh, PA 15213 (1981)."},{"key":"BF02031716_CR26","unstructured":"F. Frayman and S. Mittal, COSSACK: A constraints-based expert system for configuration tasks, in:Knowledge Based Expert Systems in Engineering: Planning and Design, eds. D. Sriram and R. Adey, Computational Mechanics (1987)."},{"key":"BF02031716_CR27","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E. Freuder","year":"1978","unstructured":"E. Freuder, Synthesizing constraint expressions, Commun. ACM 21 (1978) 958\u2013966.","journal-title":"Commun. ACM"},{"key":"BF02031716_CR28","unstructured":"L. Fribourg, SLOG: A logic programming language interpreter based on clausal superposition and rewriting, in:1985 Symposium on Logic Programming (IEEE Computer Society Press, 1985) pp. 172\u2013184."},{"key":"BF02031716_CR29","unstructured":"M.R. Genesereth and R. Fikes, Knowledge interchange format version 3.0 reference manual, Technical Report Logic-92-1, Stanford University, Computer Science Department, Logic Group (June 1992)."},{"key":"BF02031716_CR30","unstructured":"P. Hanschke, Specifying role interaction in concept languages, in:3rd Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR '92) (October 1992)."},{"key":"BF02031716_CR31","unstructured":"P. Hanschke and K. Hinkelmann, Combining terminological and rule-based reasoning for abstraction processes, in:Proc. German Workshop on Artificial Intelligence, GWAI-92 (Springer, September 1992)."},{"key":"BF02031716_CR32","doi-asserted-by":"crossref","unstructured":"H.-G. Hein and M. Meyer, A WAM compilation scheme, in:Logic Programming: Proc. of the 1st and 2nd Russian Conf., ed. A. Voronkov, volume 592 of LNAI (Springer, 1992) pp. 201\u2013214.","DOI":"10.1007\/3-540-55460-2_15"},{"key":"BF02031716_CR33","doi-asserted-by":"crossref","unstructured":"R. Helm and K. Marriott, Declarative graphics, in:3rd Int. Conf. on Logic Programming (ICLP), ed. E. Shapiro, LNCS 225 (Springer, July 1986) pp. 513\u2013527.","DOI":"10.1007\/3-540-16492-8_99"},{"key":"BF02031716_CR34","unstructured":"K. Hinkelmann, Bidirectional reasoning of horn clause programs: Transformation and compilation, Technical Memo TM-91-02, DFKI (January 1991)."},{"key":"BF02031716_CR35","unstructured":"K. Hinkelmann, Forward logic evaluation: Developing a compiler from a partially evaluated meta interpreter, Technical Memo TM-91-13, DFKI (October 1991)."},{"key":"BF02031716_CR36","unstructured":"K. Hinkelmann, Forward logic evaluation: Compiling a partially evaluated meta-interpreter into the WAM, in:Proc. German Workshop on Artificial Intelligence, GWAI-92 (Springer, September 1992)."},{"key":"BF02031716_CR37","unstructured":"B. Hollunder, W. Nutt and M. Schmidt-Schau\u00df, Subsumption algorithms for concept description languages, in:9th European Conf. on Artificial Intelligence (ECAI'90) (Pitman Publishing, 1990) pp. 348\u2013353."},{"key":"BF02031716_CR38","unstructured":"C. Klauck, R. Legleitner and A. Bernardi, FEAT-REP: Representing features in CAD\/CAM, in:4th Int. Symp. on Artificial Intelligence: Applications in Informatics, Cancun, Mexico (1991). An extended version is also available as Research Report RR-91-20, DFKI."},{"key":"BF02031716_CR39","unstructured":"A. Kobsa, The SB-ONE knowledge representation workbench, in:Preprints of the Workshop on Formal Aspects of Semantic Networks, Two Harbors, CA (1989)."},{"key":"BF02031716_CR40","unstructured":"R. Kowalski, Logic as a computer language for children, in:European Conf. on Artificial Intelligence (ECAI) (1982) pp. 2\u201310."},{"key":"BF02031716_CR41","first-page":"118","volume":"1","author":"A. Mackworth","year":"1985","unstructured":"A. Mackworth, J. Mulder and W. Havens, Hierarchical are consistency: Exploiting structured domains in constraint satisfaction problems, Comp. Int. 1 (1985) 118\u2013126.","journal-title":"Comp. Int."},{"key":"BF02031716_CR42","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A.K. Mackworth","year":"1985","unstructured":"A.K. Mackworth and E.C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Art. Int. 25 (1985) 65\u201373.","journal-title":"Art. Int."},{"key":"BF02031716_CR43","unstructured":"E. Mays, C. Apt\u00e9, J. Griesmer and J. Kastner, Experience with K-Rep: an object centered knowledge representation language, in:Proc. IEEE CAIA-88 (1988) pp. 62\u201367."},{"key":"BF02031716_CR44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/AIC-1989-2101","volume":"2","author":"P. Meseguer","year":"1989","unstructured":"P. Meseguer, Constraint satisfaction problems: An overview, AI Commun. 2 (1989) 3\u201317.","journal-title":"AI Commun."},{"key":"BF02031716_CR45","first-page":"148","volume-title":"Proc. Int. Conf. on Parallel Computing Technologies (PaCT-91)","author":"M. Meyer","year":"1991","unstructured":"M. Meyer, Parallel constraint satisfaction in a logic programming framework, in:Proc. Int. Conf. on Parallel Computing Technologies (PaCT-91) (World Scientific, Singapore, 1991) pp. 148\u2013157."},{"key":"BF02031716_CR46","unstructured":"M. Meyer, Using hierarchical constraint satisfaction for lathe-tool selection in a CIM environment, in:5th Int. Symp. on Artificial Intelligence (ISAI'92) (AAAI Press, 1992) pp. 167\u2013177."},{"key":"BF02031716_CR47","doi-asserted-by":"crossref","unstructured":"M. Meyer, H.-G. Hein and J. M\u00fcller, FIDO: Finite domain consistency techniques in logic programming, in:Logic Programming: Proc. 1st and 2nd Russian Conf., ed. A. Voronkov, vol. 592 of LNAI (Springer, 1992) pp. 294\u2013301.","DOI":"10.1007\/3-540-55460-2_22"},{"key":"BF02031716_CR48","unstructured":"M. Meyer and J. M\u00fcller, Weak looking-ahead and its application in computer-aided production planning, in:7th Int. Symp. on Methodologies for Intelligent Systems (ISMIS'93), LNAI (Springer, 1993)."},{"key":"BF02031716_CR49","doi-asserted-by":"crossref","unstructured":"C. Moss, Commercial applications of large Prolog knowledge bases, in:Proc. of the Int. Workshop on Processing Declarative Knowledge (PDK'91), eds. H. Boley and M.M. Richter, vol. 567 in LNAI (Springer, 1991) pp. 32\u201340.","DOI":"10.1007\/BFb0013519"},{"key":"BF02031716_CR50","unstructured":"B. Nebel, Reasoning and revision in hybrid representation systems, PhD thesis, University of Saarbr\u00fccken (1989)."},{"key":"BF02031716_CR51","first-page":"16","volume":"11","author":"P.F. Patel-Schneider","year":"1990","unstructured":"P.F. Patel-Schneider, B. Owsnicki-Klewe, A. Kobsa, N. Guarino, R. McGregor, W.S. Mark, D. McGuiness, B. Nebel, A. Schmiedel and J. Yen. Report on the workshop on term subsumption languages in knowledge representation, AI Magazine 11 (1990) 16\u201323.","journal-title":"AI Magazine"},{"key":"BF02031716_CR52","volume-title":"ELP '91","author":"L.C. Paulson","year":"1991","unstructured":"L.C. Paulson and A.W. Smith, Logic programming, functional programming, and inductive definitions, in:ELP '91, ed. P. Schroeder-Heister, LNCS 475 (Springer, Berlin\/Heidelberg\/New York, 1991)."},{"key":"BF02031716_CR53","unstructured":"F. Pereira, Can drawing be liberated from the von Neumann style, in:Logic Programming and its Applications, eds. M. van Caneghem and H. Warren, vol. 2 of Ablex series in Artificial Intelligence (1986)."},{"key":"BF02031716_CR54","unstructured":"C. Reade,Elements of Functional Programming (Addison-Wesley, 1989)."},{"key":"BF02031716_CR55","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1080\/08839519108927932","volume":"5","author":"F. Schmalhofer","year":"1991","unstructured":"F. Schmalhofer, O. Kuehn and G. Schmidt, Integrated knowledge acquisition from text, previously solved cases, and expert memories, Appl. Art. Int. 5 (1991) 311\u2013337.","journal-title":"Appl. Art. Int."},{"key":"BF02031716_CR56","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schau\u00df and G. Smolka, Attributive concept descriptions with complements, J. Art. Int. 47 (1991).","DOI":"10.1016\/0004-3702(91)90078-X"},{"key":"BF02031716_CR57","first-page":"640","volume":"2","author":"A. Schmiedel","year":"1990","unstructured":"A. Schmiedel, A temporal terminological logic, in:Proc. 8th National Conf. on Artificial Intelligence, vol. 2 (AAAI, 1990) pp. 640\u2013645.","journal-title":"Proc. 8th National Conf. on Artificial Intelligence"},{"key":"BF02031716_CR58","unstructured":"W. Stein and M. Sintek, A generalized intelligent indexing method, in:Workshop \u201cSprachen f\u00fcr KI-Anwendungen, Konzepte \u2014 Methoden \u2014 Implementierungen\u201d, Bad Honnef (Institute of Applied Mathematics and Computer Science, University of M\u00fcnster, May 1992)."},{"key":"BF02031716_CR59","unstructured":"F. Steinle, HAMLET: Erweiterung eines Constraint-Systems um Negation und Disjunktion und dessen Anbindung an eine Konzeptbeschreibungssprache, Projektarbeit (1993), in German."},{"key":"BF02031716_CR60","series-title":"Technical Report","volume-title":"A mechanical solution of Schubert's steamroller by many-sorted resolution","author":"C. Walther","year":"1984","unstructured":"C. Walther, A mechanical solution of Schubert's steamroller by many-sorted resolution, Technical Report A31-84, Universit\u00e4t Karlsruhe, Institut f\u00fcr Informatik I, Karlsruhe, Germany (1984)."},{"key":"BF02031716_CR61","series-title":"Technical Report MAC","volume-title":"Generating semantic descriptions of scenes with shadows","author":"D.E. Waltz","year":"1972","unstructured":"D.E. Waltz, Generating semantic descriptions of scenes with shadows, Technical Report MAC AI-TR-271, MIT, Cambridge MA (1972)."},{"key":"BF02031716_CR62","volume-title":"An abstract Prolog instruction set","author":"D.H.D. Warren","year":"1983","unstructured":"D.H.D. Warren, An abstract Prolog instruction set, Technical Note 309, SRI International, Menlo Park, CA (October 1983)."},{"key":"BF02031716_CR63","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03037384","volume":"4","author":"A. Yamamoto","year":"1986","unstructured":"A. Yamamoto and H. Tanaka, Translating production rules into a forward reasoning Prolog program. New Generation Comp. 4 (1986) 97 105.","journal-title":"New Generation Comp."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02031716.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02031716\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02031716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T20:32:47Z","timestamp":1586377967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02031716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["BF02031716"],"URL":"https:\/\/doi.org\/10.1007\/bf02031716","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}