{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T10:04:23Z","timestamp":1761905063360,"version":"build-2065373602"},"reference-count":46,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.434.4","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T12:41:30Z","timestamp":1761741690000},"page":"10-26","source":"Crossref","is-referenced-by-count":0,"title":["Semantic Properties of Computations Defined by Elementary Inference Systems"],"prefix":"10.4204","volume":"434","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[{"name":"Universitat Politecnica de Valencia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2720","published-online":{"date-parts":[[2025,10,30]]},"reference":[{"key":"AveLor_ConditionalRewriteSystemsWithExtraVariablesAndDeterministicLogicPrograms_LPAR94","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-58216-9_40","article-title":"On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs","volume-title":"Logic Programming and Automated Reasoning, 5th International Conference, LPAR'94, Proceedings","volume":"822","author":"Avenhaus","year":"1994"},{"key":"BaaNip_TermRewritingAndAllThat_1998","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"volume-title":"Some extensional term models for combinatory logics and \u03bb-calculi","year":"1971","author":"Barendregt","key":"Barendregt_SomeExtensionalTermModelsForCombinatoryLogicsAndLambdaCalculi_PhD71"},{"key":"BruMes_SemanticFoundationsForGeneralizedRewriteTheories_TCS06","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.tcs.2006.04.012","article-title":"Semantic foundations for generalized rewrite theories","volume":"360","author":"Bruni","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"ChaLee_symbolicLogicAndMechanicalTheoremProving_1973","series-title":"Computer science classics","volume-title":"Symbolic logic and mechanical theorem proving","author":"Chang","year":"1973"},{"volume-title":"Predicate logic as a computational formalism","year":"1980","author":"Clark","key":"Clark_PredicateLogicAsAComputationalFormalism_TR79"},{"key":"Comon_InductionlessInduction_HAR01","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/B978-044450813-3\/50016-3","article-title":"Inductionless Induction","volume-title":"Handbook of Automated Reasoning (in 2 volumes)","author":"Comon","year":"2001"},{"key":"ComNiu_InductionIAxiomatizationFirstOrderConsistency_IC00","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/INCO.2000.2875","article-title":"Induction=I-Axiomatization+First-Order Consistency","volume":"159","author":"Comon","year":"2000","journal-title":"Inf. Comput."},{"key":"Dauchet_RewritingAndTreeAutomata_TCSschool93","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-59340-3_8","article-title":"Rewriting and Tree Automata","volume-title":"Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course","volume":"909","author":"Dauchet","year":"1993"},{"key":"DauTis_TheTheoryOfGroundRewriteSystemsIsDecidable_LICS90","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/LICS.1990.113750","article-title":"The Theory of Ground Rewrite Systems is Decidable","volume-title":"Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), Philadelphia, Pennsylvania, USA, June 4-7, 1990","author":"Dauchet","year":"1990"},{"key":"Despeyroux_ProofOfTranslationInNaturalSemantics_LICS86","first-page":"193","article-title":"Proof of Translation in Natural Semantics","volume-title":"Proceedings of the Symposium on Logic in Computer Science (LICS '86), Cambridge, Massachusetts, USA, June 16-18, 1986","author":"Despeyroux","year":"1986"},{"issue":"4","key":"EmdKow_TheSemanticsOfPredicateLogicAsAProgrammingLanguage_JACM76","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"issue":"1","key":"FalLevMarPal_AModelTheoreticReconstructionOfTheOperationalSemanticsOfLogicPrograms_IC93","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/INCO.1993.1015","article-title":"A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs","volume":"103","author":"Falaschi","year":"1993","journal-title":"Inf. Comput."},{"issue":"3","key":"FalLevPalMar_DeclarativeModelingOfTheOperationalBehaviorOfLogicLanguages_TCS89","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative Modeling of the Operational Behavior of Logic Languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theor. Comput. Sci."},{"key":"Fitting_FirstOrderLogicAndAutomatedTheoremProving_1997","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2360-3","volume-title":"First-Order Logic and Automated Theorem Proving, Second Edition","author":"Fitting","year":"1996"},{"key":"Gentzen_UntersuchungenUberDasLogischeSchliessenPart1_MZ35","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","article-title":"Untersuchungen \u00fcber das logische schliessen, I","volume":"39","author":"Gentzen","year":"1935","journal-title":"Mathematische Zeitschrift"},{"key":"GreRap_TheUseOfTheoremProvingTechniquesInQuestionAnsweringSystems_ACMNC68","series-title":"ACM \u201968","doi-asserted-by":"publisher","DOI":"10.1145\/800186.810578","article-title":"The Use of Theorem-Proving Techniques in Question-Answering Systems","volume-title":"Proceedings of the 1968 23rd ACM National Conference","author":"Green","year":"1968"},{"key":"GutLuc_AutomaticGenerationOfLogicalModelsWithAGES_CADE19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-29436-6_17","article-title":"Automatic Generation of Logical Models with AGES","volume-title":"Automated Deduction - CADE 27 - 27th International Conference on Automated Deduction, Proceedings","volume":"11716","author":"Guti\u00e9rrez","year":"2019"},{"key":"HanMil_DerivingMixedEvaluationFromStandardEvaluationForASimpleFunctionalLanguage_MPC89","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-51305-1_13","article-title":"Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language","volume-title":"Mathematics of Program Construction, 375th Anniversary of the Groningen University, International Conference, Groningen, The Netherlands, June 26-30, 1989, Proceedings","volume":"375","author":"Hannan","year":"1989"},{"key":"HanMil_FromOperationalSemanticsToAbstractMachinesPreliminaryResults_LFP90","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/91556.91680","article-title":"From Operational Semantics to Abstract Machines: Preliminary Results","volume-title":"Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990, Nice, France, 27-29 June 1990","author":"Hannan","year":"1990"},{"volume-title":"Introduction to Combinators and Lambda-Calculus","year":"1986","author":"Hindley","key":"HinSel_IntroductionToCombinatorsAndLambdaCalculus_1986"},{"volume-title":"A Shorter Model theory","year":"1997","author":"Hodges","key":"Hodges_AShorterModelTheory_1997"},{"key":"Kahn_NaturalSemantics_STACS87","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/BFB0039592","article-title":"Natural Semantics","volume-title":"STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings","volume":"247","author":"Kahn","year":"1987"},{"key":"Kaplan_ConditionalRewriteRules_TCS84","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","article-title":"Conditional Rewrite Rules","volume":"33","author":"Kaplan","year":"1984","journal-title":"Theor. Comput. Sci."},{"key":"Lalement_ComputationAsLogic_1993","series-title":"Prentice Hall International series in computer science","volume-title":"Computation as logic","author":"Lalement","year":"1993"},{"key":"LevPal_TheDeclarativeSemanticsOfLogicalReadOnlyVariables_SLP85","first-page":"128","article-title":"The Declarative Semantics of Logical Read-Only Variables","volume-title":"Proceedings of the 1985 Symposium on Logic Programming, Boston, Massachusetts, USA, July 15-18, 1985","author":"Levi","year":"1985"},{"key":"Lloyd_FoundationsOfLogicProgramming_1987","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming, 2nd Edition","author":"Lloyd","year":"1987"},{"key":"Lucas_AnalysisOfRewritingBasedSystemsAsFirstOrderTheories_LOPSTR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-94460-9_11","article-title":"Analysis of Rewriting-Based Systems as First-Order Theories","volume-title":"Logic-Based Program Synthesis and Transformation - 27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers","volume":"10855","author":"Lucas","year":"2017"},{"key":"Lucas_ProvingSemanticPropertiesAsFirstOrderSatisfiability_AI19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103174","article-title":"Proving semantic properties as first-order satisfiability","volume":"277","author":"Lucas","year":"2019","journal-title":"Artif. Intell."},{"issue":"4","key":"Lucas_ContextSensitiveRewriting_CSUR20","doi-asserted-by":"publisher","DOI":"10.1145\/3397677","article-title":"Context-sensitive Rewriting","volume":"53","author":"Lucas","year":"2020","journal-title":"ACM Comput. Surv."},{"key":"Lucas_LocalConfluenceOfConditionalAndGeneralizedTermRewritingSystems_JLAMP24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2023.100926","article-title":"Local confluence of conditional and generalized term rewriting systems","volume":"136","author":"Lucas","year":"2024","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"key":"Lucas_TerminationOfGeneralizedTermRewritingSystems_FSCD24","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSCD.2024.29","article-title":"Termination of Generalized Term Rewriting Systems","volume-title":"9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)","volume":"299","author":"Lucas","year":"2024"},{"issue":"4","key":"LucMarMes_OperationalTerminationOfConditionalTermRewritingSystems_IPL05","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","article-title":"Operational termination of conditional term rewriting systems","volume":"95","author":"Lucas","year":"2005","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"Manna_PropertiesOfProgramsAndTheFirstOrderLogicCalculus_JACM69","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/321510.321516","article-title":"Properties of Programs and the First-Order Predicate Calculus","volume":"16","author":"Manna","year":"1969","journal-title":"J. ACM"},{"volume-title":"Introduction to mathematical logic (4. ed.)","year":"1997","author":"Mendelson","key":"Mendelson_IntroductionToMathematicalLogicFourtEd_1997"},{"issue":"1","key":"Meseguer_ConditionalRewritingLogicAsAUnifiedModelOfConcurrency_TCS92","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional Rewriting Logic as a Unified Model of Concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theor. Comput. Sci."},{"key":"Meseguer_TwentyYearsOfRewritingLogic_JLAP12","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jlap.2012.06.003","article-title":"Twenty years of rewriting logic","volume":"81","author":"Meseguer","year":"2012","journal-title":"J. Log. Algebr. Program."},{"key":"Ohlebusch_AdvancedTopicsInTermRewriting_2002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"Ohlebusch","year":"2002"},{"key":"Plotkin_TheOriginsOfStructuralOperationalSemantics_JLAP04","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/J.JLAP.2004.03.009","article-title":"The origins of structural operational semantics","volume":"60-61","author":"Plotkin","year":"2004","journal-title":"J. Log. Algebraic Methods Program."},{"key":"Plotkin_AStructuralApproachToOperationalSemantics_JLAP04","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","article-title":"A structural approach to operational semantics","volume":"60-61","author":"Plotkin","year":"2004","journal-title":"J. Log. Algebraic Methods Program."},{"key":"Prawitz_NaturalDeductionAProofTheoreticalStudy_1965","series-title":"Stockholm Studies in Philosophy","volume-title":"Natural deduction. A proof theoretical study","author":"Prawitz","year":"1965"},{"key":"RapMid_AutomatingTheFirstOrderTheoryOfRewritingForLeftLinearRightGroundRewriteSystems_FSCD16","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSCD.2016.36","article-title":"Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems","volume-title":"1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal","volume":"52","author":"Rapp","year":"2016"},{"key":"RapMid_FORT2_0_IJCAR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-94205-6_6","article-title":"FORT 2.0","volume-title":"Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings","volume":"10900","author":"Rapp","year":"2018"},{"key":"Smullyan_TheoryOfFormalSystems_1961","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of Formal Systems","author":"Smullyan","year":"1961"},{"key":"Gentzen_InvestigationsIntoLogicalDeduction_SLFM69","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)70822-X","article-title":"The Collected Papers of Gerhard Gentzen","volume":"55","author":"Szabo","year":"1969"},{"key":"Terese_TermRewritingSystems_2003","series-title":"Cambridge tracts in theoretical computer science","volume-title":"Term rewriting systems","volume":"55","author":"Terese","year":"2003"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T10:01:55Z","timestamp":1761904915000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2510.26429v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,30]]},"references-count":46,"URL":"https:\/\/doi.org\/10.4204\/eptcs.434.4","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,10,30]]}}}