標(biāo)題: Titlebook: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems; Essays Dedicated to Pedro Lopez-Garcia,John [打印本頁] 作者: 烹飪 時(shí)間: 2025-3-21 18:56
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems影響因子(影響力)
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems影響因子(影響力)學(xué)科排名
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems網(wǎng)絡(luò)公開度
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems被引頻次
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems被引頻次學(xué)科排名
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems年度引用
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems年度引用學(xué)科排名
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems讀者反饋
書目名稱Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems讀者反饋學(xué)科排名
作者: 去掉 時(shí)間: 2025-3-21 21:45 作者: PURG 時(shí)間: 2025-3-22 02:42 作者: 小蟲 時(shí)間: 2025-3-22 08:20
Book 2023Rey Pastor prize in Mathematics and Information Science and Technologyand the Aritmel prize in Computer Science; he is an elected member of the Academia Europaea; and in 2022 he was elected a Fellow of the ACM for contributions to program analysis, verification, parallelism, logic programming, and t作者: Nonporous 時(shí)間: 2025-3-22 10:35 作者: 憤慨一下 時(shí)間: 2025-3-22 16:41 作者: Obsessed 時(shí)間: 2025-3-22 18:15
,Towards Systematically Engineering Autonomous Systems Using Reinforcement Learning and?Planning,DL” life cycle and illustrate it with two case studies: simulation-based online planning and the PSyCo reinforcement learning approach for synthesizing agent policies from hard and soft requirements. Related work and potential avenues for future research are discussed.作者: 審問,審訊 時(shí)間: 2025-3-23 01:10
Theorising Technological Appropriationity and separation of concerns applied to the LPs domain. Furthermore, we set forth other notions necessary for top-down, call-graph oriented existential query answering with 2-valued semantics for LPs with Integrity Constraints.作者: 種族被根除 時(shí)間: 2025-3-23 04:49 作者: 連鎖,連串 時(shí)間: 2025-3-23 05:31
0302-9743 tures a broad range of academic research and implementation This Festschrift, dedicated to Manuel Hermenegildo on the occasion of his 60th birthday, contains papers written by many of his closest collaborators. Manuel received his Ph.D. degree in Computer Science and Engineering from the University 作者: faucet 時(shí)間: 2025-3-23 10:49
Lecture Notes in Computer Scienceommutativity, and identity. Both the strategies and the rewrite rules are allowed to be parameterized, i.e., they may have a set of common constants that are given a value as part of the solution of a problem. A proof tree based interpretation of the strategy language is used to prove the soundness and weak completeness of the calculus.作者: faction 時(shí)間: 2025-3-23 17:03
https://doi.org/10.1057/9780230511750ing non-deterministic search, interleaved with immediate evaluation of each generated network regarding its fitness. Furthermore, it can be used for finding solutions to planning problems. In this paper, we explain and demonstrate how these application problems are solved using Muli.作者: 小平面 時(shí)間: 2025-3-23 19:16
Defining Traumatic Events and PTSD the logical principle of extension by definition. We then provide an austere form of logic programs that may serve as a normalform for logic programs similar to conjunctive normalform in classical logic. Finally, we take the key ideas and propose a modeling methodology for ASP beginners and illustrate how it can be used.作者: 密碼 時(shí)間: 2025-3-24 02:15 作者: 極大痛苦 時(shí)間: 2025-3-24 03:02
,Strategies in?Conditional Narrowing Modulo SMT Plus Axioms,ommutativity, and identity. Both the strategies and the rewrite rules are allowed to be parameterized, i.e., they may have a set of common constants that are given a value as part of the solution of a problem. A proof tree based interpretation of the strategy language is used to prove the soundness and weak completeness of the calculus.作者: Obliterate 時(shí)間: 2025-3-24 06:54
Applications of Muli: Solving Practical Problems with Constraint-Logic Object-Oriented Programming,ing non-deterministic search, interleaved with immediate evaluation of each generated network regarding its fitness. Furthermore, it can be used for finding solutions to planning problems. In this paper, we explain and demonstrate how these application problems are solved using Muli.作者: 財(cái)政 時(shí)間: 2025-3-24 12:40 作者: GUILT 時(shí)間: 2025-3-24 17:02
,Reversible Debugging in?Logic Programming,heme for logic programs. For this purpose, we define an appropriate instrumented semantics (a so-called Landauer embedding) that makes SLD resolution reversible. An implementation of a reversible debugger for Prolog, ., has been developed and is publicly available...作者: Conjuction 時(shí)間: 2025-3-24 20:45 作者: Ethics 時(shí)間: 2025-3-25 03:08 作者: 紋章 時(shí)間: 2025-3-25 06:22
Am I Surviving, Existing, or Living?g abstraction to completely reuse the underlying model checkers. We have applied our ideas to different modelling and programming languages, tools and real applications. In this paper, we summarize some of these contributions.作者: Carcinogenesis 時(shí)間: 2025-3-25 10:17 作者: 成份 時(shí)間: 2025-3-25 15:03 作者: atopic-rhinitis 時(shí)間: 2025-3-25 19:26
Disconnecting with Social Networking Sitestake a look at the different ways a semantics may resolve cycles, and show how to implement two popular semantics, well-founded and stable models, as well as . model semantics. Finally, we present operational semantics as a parametrized goal-directed execution algorithm that allows us to determine how cycles are resolved.作者: Biguanides 時(shí)間: 2025-3-25 22:29
,Automated Synthesis of?Software Contracts with?, the specification error behavior. We summarize the main services provided by ., which also include a novel refinement facility that improves the quality and accuracy of the synthesized contracts. Finally, we provide an experimental evaluation that assesses its effectiveness.作者: 戲服 時(shí)間: 2025-3-26 03:46
,Grammar Induction for?Under-Resourced Languages: The Case of?Ch’ol,result serve to guide the production of the desired grammar. We present the main framework describing the model and the results of our experiments, inferring Ch’ol grammar from English grammar and suggest some future lines of research in the area.作者: investigate 時(shí)間: 2025-3-26 04:57 作者: Harbor 時(shí)間: 2025-3-26 12:18
SMT-Based Test-Case Generation and Validation for Programs with Complex Specifications,ent a system in which exhaustive black-box and white-box testing, result validation, and partial verification, can all be done automatically. The only extra effort required from programmers is to write formal specifications.作者: Temporal-Lobe 時(shí)間: 2025-3-26 14:23 作者: 侵略主義 時(shí)間: 2025-3-26 20:30 作者: 外來 時(shí)間: 2025-3-26 23:25
https://doi.org/10.1007/3-540-60627-0s the symbolic operational engine of Maude’s equational theories. We provide three instances of our specialization scheme that support distinct classes of theories that are relevant for many applications. The effectiveness of our method is finally demonstrated in some specialization examples.作者: seroma 時(shí)間: 2025-3-27 03:10
,Optimizing Maude Programs via?Program Specialization,s the symbolic operational engine of Maude’s equational theories. We provide three instances of our specialization scheme that support distinct classes of theories that are relevant for many applications. The effectiveness of our method is finally demonstrated in some specialization examples.作者: Deference 時(shí)間: 2025-3-27 07:03
Book 2023 Manuel received his Ph.D. degree in Computer Science and Engineering from the University of Texas at Austin, and among various positions he was an endowed chair in Information Science and Technology at the University of New Mexico. In 2007 he became the founding director of the IMDEA Software Insti作者: 復(fù)習(xí) 時(shí)間: 2025-3-27 12:08
,Strategies in?Conditional Narrowing Modulo SMT Plus Axioms,ing equational logic is composed of some theories solvable via a satisfiability modulo theories (SMT) solver plus some combination of associativity, commutativity, and identity. Both the strategies and the rewrite rules are allowed to be parameterized, i.e., they may have a set of common constants t作者: 禁止,切斷 時(shí)間: 2025-3-27 13:41 作者: 遵循的規(guī)范 時(shí)間: 2025-3-27 20:00 作者: troponins 時(shí)間: 2025-3-27 23:54
Abstract Interpretation of Graphs,st path algorithm this yields a na?ve . algorithm where . is the number of graph vertices. By over-approximating the elementary paths and cycles and generalizing the classical exact fixpoint abstraction, we constructively derive the classical . Roy-Floyd-Warshall algorithm.作者: Harness 時(shí)間: 2025-3-28 05:57 作者: Gudgeon 時(shí)間: 2025-3-28 07:15
,Grammar Induction for?Under-Resourced Languages: The Case of?Ch’ol,enerate grammars for different languages, much as human wombs can generate different races. The WGM is inferential, works for more than just specific tasks and needs neither a pre-specified model family, nor parallel corpora, nor any of the typical models of machine learning. It generates an underst作者: 植物茂盛 時(shí)間: 2025-3-28 11:33
Answer Set Programming Made Easy,s sufficient for ASP. We elaborate upon the foundations of this idea in the context of the logic of Here-and-There and show how it can be derived from the logical principle of extension by definition. We then provide an austere form of logic programs that may serve as a normalform for logic programs作者: 單調(diào)性 時(shí)間: 2025-3-28 14:48
,The Role of?Abstraction in?Model Checking,the use of abstract interpretation to reduce the well-known state space explosion problem in model checking was the first and most successful combination of these two techniques. However, this is not the only possible way both methods can collaborate to improve the software reliability. Along these 作者: 擋泥板 時(shí)間: 2025-3-28 19:12
,Justifications and?a?Reconstruction of?Parity Game Solving Algorithms,fines parametrized parity games and introduces an operation, ., that determines a winning strategy for a single node. By carefully ordering . steps, we reconstruct three algorithms well known from the literature.作者: perimenopause 時(shí)間: 2025-3-29 01:39
SMT-Based Test-Case Generation and Validation for Programs with Complex Specifications,x preconditions. The key of the approach is to translate a formal precondition into a set of constraints belonging to the decidable logics of SMT solvers. By checking the satisfiability of the constraints, then the models returned by the solver automatically synthesize the cases. We also show how to作者: Dislocation 時(shí)間: 2025-3-29 06:09
Layerings of Logic Programs - Layer Decomposable Semantics and Incremental Model Computation,er growing size and diversity of applications using logic programs as representations of knowledge bases, there is a corresponding growing need to optimize the efficiency of model computation. In this paper we define two graph-theoretical structures, which we dub the Rule Layering and the Atom Layer作者: affluent 時(shí)間: 2025-3-29 10:43 作者: FECK 時(shí)間: 2025-3-29 11:46
,Proof-Theoretic Foundations of?Normal Logic Programs,ion, and this realization can be used to develop a goal-directed method of computing models. In essence, the difference between these semantics is how they resolve the unstratified portions of a program. In this paper, restricting ourselves to the propositional case, we show how the semantics of nor作者: 胡言亂語 時(shí)間: 2025-3-29 19:10
,Reversible Debugging in?Logic Programming, where one can explore a computation from the observable misbehaviour . to the source of the error. In this work, we propose a reversible debugging scheme for logic programs. For this purpose, we define an appropriate instrumented semantics (a so-called Landauer embedding) that makes SLD resolution 作者: FID 時(shí)間: 2025-3-29 23:11 作者: 嫌惡 時(shí)間: 2025-3-30 01:16 作者: adipose-tissue 時(shí)間: 2025-3-30 07:22 作者: 業(yè)余愛好者 時(shí)間: 2025-3-30 11:50
,Justifications and?a?Reconstruction of?Parity Game Solving Algorithms,fines parametrized parity games and introduces an operation, ., that determines a winning strategy for a single node. By carefully ordering . steps, we reconstruct three algorithms well known from the literature.作者: Immobilize 時(shí)間: 2025-3-30 14:01 作者: cancellous-bone 時(shí)間: 2025-3-30 19:09
,A Discourse on?Guessing and?Reasoning,Computer Science studies the possibility of mechanizing reasoning, an activity of the human brain often confused with thinking, but more or less distinguished from guessing. This paper is devoted to considering, at not too much length, the links between thinking, guessing and reasoning.
