標(biāo)題: Titlebook: Logic-Based Program Synthesis and Transformation; 30th International S Maribel Fernández Conference proceedings 2021 Springer Nature Switze [打印本頁] 作者: 畸齒矯正學(xué) 時(shí)間: 2025-3-21 20:09
書目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)
書目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度
書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation被引頻次
書目名稱Logic-Based Program Synthesis and Transformation被引頻次學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation年度引用
書目名稱Logic-Based Program Synthesis and Transformation年度引用學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation讀者反饋
書目名稱Logic-Based Program Synthesis and Transformation讀者反饋學(xué)科排名
作者: Seminar 時(shí)間: 2025-3-21 23:43 作者: 等待 時(shí)間: 2025-3-22 02:50
0302-9743 unification; types; verification; model checking and probabilistic programming; program analysis and testing; and logics..978-3-030-68445-7978-3-030-68446-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 柏樹 時(shí)間: 2025-3-22 07:19 作者: MEN 時(shí)間: 2025-3-22 09:07 作者: 閹割 時(shí)間: 2025-3-22 15:04
Symbolic Computation in Maude: Some Tapasols. These methods are very general: they apply not just to Maude, but to many other logics, languages and tools. This paper presents some . about these Maude-based symbolic methods in an informal way to make it easy for many other people to learn about, and benefit from, them.作者: inculpate 時(shí)間: 2025-3-22 19:56 作者: 慢跑鞋 時(shí)間: 2025-3-22 21:51
: Towards a Verified Implementation of Type Theory in Type Theoryrence and term synthesis engine for a language with dependent types that is based on the new approach and that is feasible to implement using a dependently typed language. We demonstrate the architecture by describing ., its particular implementation.作者: 狗窩 時(shí)間: 2025-3-23 02:55
Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Studylvers, by exploiting and extending the well-known . techniques that have been developed over the last decade. In this way, one can increase the coverage and sometimes even . the aggregate coverage achievable by running simultaneously all the solvers of the portfolio.作者: troponins 時(shí)間: 2025-3-23 07:05
Conference proceedings 2021ions. The book also contains two invited talks in full paper length. The contributions were organized in topical sections named: rewriting; unification; types; verification; model checking and probabilistic programming; program analysis and testing; and logics..作者: GRAZE 時(shí)間: 2025-3-23 09:49 作者: Climate 時(shí)間: 2025-3-23 16:44 作者: nonradioactive 時(shí)間: 2025-3-23 18:32 作者: Abrade 時(shí)間: 2025-3-24 01:49 作者: 不透氣 時(shí)間: 2025-3-24 06:11 作者: GOAT 時(shí)間: 2025-3-24 08:22
Reasoning in the Theory of Heap: Satisfiability and Interpolationroaches for heap-allocated data-structures to a language-independent level, and this way factor out the treatment of heap in verification tools. This paper gives an overview of the theory, and presents ongoing research on decision and interpolation procedures.作者: 摘要 時(shí)間: 2025-3-24 12:09 作者: HEW 時(shí)間: 2025-3-24 18:11
Runtime Complexity Analysis of Logically Constrained Rewritingamming paradigms, as well as simplification systems in compilers and SMT solvers. In this paper, we investigate techniques to analyse the worst-case runtime complexity of LCTRSs. For that, we exploit synergies between previously developed decomposition techniques for standard term rewriting by Avanz作者: 禁止 時(shí)間: 2025-3-24 22:17
Confluence and Commutation for Nominal Rewriting Systems with Atom-Variablesormat of nominal rewriting has been introduced where rewrite rules are defined with atom-variables rather than atoms. In this paper, we investigate the difference between the new format and the original nominal rewriting, and prove confluence and commutation for some classes of rewriting systems who作者: 哀悼 時(shí)間: 2025-3-25 00:56 作者: 彎曲道理 時(shí)間: 2025-3-25 04:12
Nominal Unification with Letrec and Environment-Variablesplicit environments could be treated in nominal unification and the use of abstract environments was restricted to nominal matching. This severely restricts the use of algorithms in applications. The following two restrictions permit a step forward and strongly improve the coverage of the applicatio作者: 極小量 時(shí)間: 2025-3-25 08:45
Terminating Non-disjoint Combined Unificationn practice in many fields such as automated reasoning, logic programming, declarative programming, and the formal analysis of security protocols. In this paper, we investigate the unification problem in the non-disjoint union of equational theories via the combination of hierarchical unification pro作者: ARBOR 時(shí)間: 2025-3-25 13:08 作者: JOT 時(shí)間: 2025-3-25 18:10
Resourceful Program Synthesis from Graded Linear Typesnotion, enabling fine-grained, quantitative specification of data use in programs. The information provided by graded modal types appears to be useful for type-directed program synthesis, where these additional constraints can be used to prune the search space of candidate programs. We explore one o作者: FEMUR 時(shí)間: 2025-3-25 23:37 作者: Acetabulum 時(shí)間: 2025-3-26 03:54
Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Studymbolic Execution (.) brings together concrete and symbolic execution to maximise the program coverage. . uses a constraint solver to solve the path conditions and generate new inputs to explore. In this paper we join these lines of research by introducing a model that combines . and . approaches. Th作者: 較早 時(shí)間: 2025-3-26 05:59
Translation of Interactive Datalog Programs for Microcontrollers to Finite State Machinesaches seem ideal to describe the behavior of the interactive systems. But managing input data and state is hard. With little choice of programming language, most code targeted at microcontrollers is written in imperative C or assembler..Microlog is a deductive database language with a strong logic f作者: Ringworm 時(shí)間: 2025-3-26 10:50 作者: 似少年 時(shí)間: 2025-3-26 14:17
Verification of Multiplayer Stochastic Games via Abstract Dependency Graphsh weighted transitions. This logic allows us to query about the existence of multiplayer strategies that aim to maximize the probability of game runs satisfying resource-bounded next and until logical operators, while requiring that the accumulated weight along the successful runs does not exceed a 作者: 強(qiáng)化 時(shí)間: 2025-3-26 17:08
tween their entities, regarding semantic equivalence, is determined. In order to identify these correspondences several methods have been proposed in literature. The most common features that these methods employ are string-, lexical-, structure- and semantic-based features for which several approac作者: 災(zāi)禍 時(shí)間: 2025-3-27 00:41
un is considered a challenging endeavor. From the perspective the social exchange theory and social capital theory, knowledge sharing is considered a primary driver to the organization innovativeness and employees’ innovation at individual level. The aim of this study is to examine how knowledge sha作者: 形狀 時(shí)間: 2025-3-27 01:33
José Mesegueressed in terms of distance between data points, either in full value space or value subspaces or in terms of correlations among attributes. However, distance-based clustering algorithms suffer the curse of dimensionality, where points tend to become equidistant from one another as the dimensionality作者: adipose-tissue 時(shí)間: 2025-3-27 06:26 作者: 殘忍 時(shí)間: 2025-3-27 13:23
Kentaro Kikuchi,Takahito Aotoe perceived or conceived world, including particular things (classes and individuals/instances), universal things (classes of classes), and assertions (expression classes) about both kinds of things and relations. Furthermore, ThingFO is placed at the top (foundational) level in the framework of a f作者: 健談 時(shí)間: 2025-3-27 14:22
Horatiu Cirstea,Pierre Lermusiaux,Pierre-Etienne Moreaule OntoClean provides a methodology for evaluating ontological hierarchies based on ontological meta-properties of the concepts in the hierarchy, it does not provide a method for determining the meta-properties of a given concept within an ontology. Rudify has been developed to help bridge this gap,作者: ULCER 時(shí)間: 2025-3-27 18:56 作者: antidote 時(shí)間: 2025-3-27 23:30
Manfred Schmidt-Schau?,Yunus Kutzo cope up with this fast pace of data generation effectively in future. Giving relevant, useful and close to accurate search results will be a big challenge given their current design and approach. Search Engines will be required to make a transit from keyword based search approach to semantic based作者: bile648 時(shí)間: 2025-3-28 06:02 作者: 針葉 時(shí)間: 2025-3-28 08:19
n a unified methodology.The methodology builds a maintenanceThis monograph describes a methodology for the design of knowledge-based systems. A knowledge-based system contains knowledge as well as information and data. The information and data in such a system can be modelled and imple- mented as a 作者: 爆米花 時(shí)間: 2025-3-28 11:30 作者: Demulcent 時(shí)間: 2025-3-28 16:16
Jack Hughes,Dominic Orchardanning problems, which otherwise would require much greater human planning efforts or much more computational resources. In this approach to plan generation, it is important to have effective plan visualization capabilities, as well to support the user with some interactive capabilities for the huma作者: HPA533 時(shí)間: 2025-3-28 19:58 作者: Strength 時(shí)間: 2025-3-29 02:40 作者: 幸福愉悅感 時(shí)間: 2025-3-29 04:57 作者: Hangar 時(shí)間: 2025-3-29 09:58
Mario Wenzel,Stefan Brassd social perspective. In the last decades, a wealth of georeferenced data is collected through sensors, mobile and web platforms from the crowd, providing rich information about people’s collective experiences and behaviors in cities. As a consequence, these new data sources require models able to m作者: 輕率的你 時(shí)間: 2025-3-29 12:59 作者: 敬禮 時(shí)間: 2025-3-29 16:21
Lutz Klinkenberg,Kevin Batz,Benjamin Lucien Kaminski,Joost-Pieter Katoen,Joshua Moerman,Tobias Winkl including governments, funding bodies, researchers, investors, and companies. To this purpose, we introduce ResearchFlow, an approach that integrates semantic technologies and machine learning to quantifying the diachronic behaviour of research topics across academia and industry. ResearchFlow expl作者: 捐助 時(shí)間: 2025-3-29 21:38 作者: allergy 時(shí)間: 2025-3-30 00:17
andards. In this paper, we investigate the impact of explicitly representing and processing uncertainty in RSP for the use in CEP. Additionally, we provide a representation for capturing the relevant notions of uncertainty in the RSP-QL. data model and describe query functions that can operate on th作者: deriver 時(shí)間: 2025-3-30 04:51
Pattern Eliminating Transformationse propose in this paper a less intrusive approach based on simply annotating the function symbols with the (anti-)patterns the corresponding transformations are supposed to eliminate. We show how this approach allows one to statically check that the rewrite system implementing the transformation is 作者: Inveterate 時(shí)間: 2025-3-30 09:12 作者: 舊病復(fù)發(fā) 時(shí)間: 2025-3-30 12:42
Terminating Non-disjoint Combined Unificationes are exemplified with various theories used in protocol analysis. Next, we look at modularity methods for combining theories already using a hierarchical approach. In addition, we consider a new complexity measure that allows us to obtain terminating (combined) hierarchical unification procedures.作者: DEMUR 時(shí)間: 2025-3-30 17:13
Translation of Interactive Datalog Programs for Microcontrollers to Finite State Machinesecked. By representing a possibly quite large number of facts as a single state number and a few parameter values, memory and computing time are saved. If no parameters are needed, the result of this compilation is basically a finite state machine.作者: 友好關(guān)系 時(shí)間: 2025-3-31 00:11
