检索结果-内蒙古大学图书馆

29th international conference on DNA Computing and Molecular programming, DNA 2023

ISBN: (纸本)9783959772976

the proceedings contain 10 papers. the topics discussed include: minimum free energy, partition function and kinetics simulation algorithms for a multistranded scaffolded DNA computer;DNA tile self-assembly for 3d-surfaces: towards genus identification;on the runtime of chemical reaction networks beyond idealized conditions;rational design of DNA sequences with non-orthogonal binding interactions;revisiting hybridization kinetics with improved elementary step simulation;reversible bond logic;accelerating self-assembly of crisscross slat systems;thermodynamically driven signal amplification;optimal information encoding in chemical reaction networks;and complexity of reconfiguration in surface chemical reaction networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semi-inversion of Conditional Constructor Term Rewriting Systems 29th

Semi-inversion of Conditional Constructor Term Rewriting Sys...

引用

29th international conference on logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Kirkeby, Maja Hanne Gluck, Robert Roskilde Univ Roskilde Denmark Univ Copenhagen DIKU Copenhagen Denmark

ISBN: (纸本)9783030452599;9783030452605

Inversion is an important and useful program transformation and has been studied in various programming language paradigms. Semi-inversion is more general than just swapping the input and output of a program;instead, parts of the input and output can be freely swapped. In this paper, we present a polyvariant semi-inversion algorithm for conditional constructor term rewriting systems. these systems can model logic and functional languages, which have the advantage that semi-inversion, as well as partial and full inversion, can be studied across different programming paradigms. the semi-inverter makes use of local inversion and a simple but effective heuristic and is proven to be correct. A Prolog implementation is applied to several problems, including inversion of a simple encrypter and of a program inverter for a reversible language.

关键词： Program transformation Program inversion Conditional term rewriting systems logic and functional programs

来源：评论

学校读者我要写书评

暂无评论

Negation in the head of CP-logic rules 6

Negation in the head of CP-logic rules

引用

6th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th international conference on logic programming, ICLP 2013

作者： Vennekens, Joost Dept. Computerscience Campus De Nayer KU Leuven Belgium

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the epistemic component of ASP, in which interpretations represent the beliefs or knowledge of a rational agent. Consequently, neither CP-logic nor FO(ID) have the need for two kinds of negations: there is only one negation, and its meaning is that of objective falsehood. Nevertheless, the formal semantics of this objective negation is mathematically more similar to ASP’s negation-as-failure than to its classical negation. the reason is that both CP-logic and FO(ID) have a constructive semantics in which all atoms start out as false, and may only become true as the result of a rule application. this paper investigates the possibility of adding the well-known ASP feature of allowing negation in the head of rules to CP-logic. Because CP-logic only has one kind of negation, it is of necessity this "negation-as-failure like" negation that will be allowed in the head. We investigate the intuitive meaning of such a construct and the benefits that arise from it. © 2013 ***. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Formal Techniques for Distributed Systems - Joint 11th IFIP WG 6.1 international conference, FMOODS 2009 and 29th IFIP WG 6.1 international conference, FORTE 2009, Proceedings

Formal Techniques for Distributed Systems - Joint 11th IFIP ...

引用

11th international conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2009 and 29th international conference on Formal Techniques for Networked and Distributed Systems, FORTE 2009

ISBN: (纸本)3642021379

the proceedings contain 19 papers. the topics discussed include: the Orc programming language;keep it small, keep it real: efficient run-time verification of web service compositions;approximated context-sensitive analysis for parameterized verification;verification of parameterized systems with combinations of abstract domains;on model-checking optimistic replication algorithms;a software platform for timed mobility and timed interaction;modeling, validation, and verification of PCEP using the IF language;distinguing non-deterministic timed finite state machines;system model-based definition of modeling language semantics;typing component-based communication systems;epistemic logic for the applied Pi calculus;on process-algebraic proof methods for fault tolerant distributed systems;using first-order logic to reason about submodule construction;a model-checking approach for service component architectures;and dynamic symbolic execution of distributed concurrent objects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Disjunctive logic programs with existential quantification in rule heads

Disjunctive logic programs with existential quantification i...

引用

29th international conference on logic programming ICLP

作者： You, Jia-Huai Zhang, Heng Zhang, Yan Univ Alberta Edmonton AB T6G 2E8 Canada Univ Western Sydney Penrith NSW 2751 Australia

We consider disjunctive logic programs without function symbols but with existential quantification in rule heads, under the semantics of general stable models. there are at least two interesting prospects in these programs. the first is that a program can be made more succinct by using existential variables, and the second is on the potential in representing defeasible ontological knowledge by these logic programs. this paper studies some of the properties of these programs. First, we show a simple yet intuitive definition of stable models for these programs that does not resort to second-order logic. Second, the stable models of these programs can be characterized by an extension of progression for disjunctive programs, which provides a native characterization of justification for stable models. We then study the decidability issue. While the stable model existence problem for safe disjunctive programs is decidable, with existential quantification allowed in rule heads the problem becomes undecidable. We identify an interesting decidable fragment by exploring a new notion of stratification over existential quantification.

关键词： disjunctive logic programs general stable models existential quantification

来源：评论

学校读者我要写书评

暂无评论

Towards inductive Learning of Domain-Specific Heuristics for ASP 1

Towards Inductive Learning of Domain-Specific Heuristics for...

引用

1st international Workshop on HYbrid Models for Coupling Deductive and inductive ReAsoning and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, HYDRA-RCRA 2022

作者： Comploi-Taupe, Richard Siemens AG Österreich Vienna Austria

Domain-specific heuristics are a crucial technique for the efficient solving of problems that are large or computationally hard. Answer Set programming (ASP) systems support declarative specifications of domain-specific heuristics to improve solving performance. However, such heuristics must be invented manually so far. Inventing domain-specific heuristics for answer-set programs requires expertise with the domain under consideration and familiarity with ASP syntax, semantics, and solving technology. the process of inventing useful heuristics would highly profit from automatic support. this paper presents a first step in this direction. We use inductive logic programming (ILP) to learn declarative domain-specific heuristics from examples stemming from (near-)optimal answer sets of small but representative problem instances. Our experimental results indicate that the learned heuristics improve solving performance and solution quality when solving larger, harder problem instances. © 2022 Copyright for this paper by its authors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach

Finding optimal plans for multiple teams of robots through a...

引用

29th international conference on logic programming ICLP

作者： Erdem, Esra Patoglu, Volkan Saribatur, Zeynep G. Schuller, Peter Uras, Tansel Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA

We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator) do not know about each other's workspace or tasks (e.g., for privacy purposes);2) every team can lend or borrow robots, but not both (e.g., transportation/calibration of robots between/for different workspaces is usually costly). We present a mathematical definition of this problem and analyze its computational complexity. We introduce a novel, logic-based method to solve this problem, utilizing action languages and answer set programming for representation, and the state-of-the-art ASP solvers for reasoning. We show the applicability and usefulness of our approach by experiments on various scenarios of responsive and energy-efficient cognitive factories.

关键词： answer set programming decoupled planning cognitive robotics

来源：评论

学校读者我要写书评

暂无评论

Distributing and-work and or-work in parallel logic programming systems 29

Distributing and-work and or-work in parallel logic programm...

引用

29th Hawaii international conference on System Sciences, HICSS 1996

作者： De Castro Dutra, Inis COPPE/Sistemas Federal University of Rio de Janeiro Brazil

ISBN: (纸本)0818673249

In parallel logic programming systems that exploit both and-parallelism and or-parallelism, a problem arises that is how to distribute processors between the dynamically varying amounts of and-work and or-work that are available. Solutions have been reported for distributing only or-work, or distributing only and-work, but the issue of distributing processors between both kinds of work has not yet been addressed. In this work we discuss the problem of distributing and-work and or-work in the context of Andorra-I, a parallel logic programming system that exploits determinate and-parallelism and or-parallelism. We describe dynamic scheduling strategies that aim at efficiently distributing processors between and-work and or-work, and compare their performance with the performance prodwed by a static scheduling strategy, for a wide range of benchmarks. © 1996 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Stable model semantics for founded bounds

引用

thEORY AND PRACTICE OF logic programming 2013年第4-5期13卷 517-532页

作者： Aziz, Rehan Abdul Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Victoria Lab Natl ICT Australia Melbourne Vic 3010 Australia

Answer Set programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics, which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving problems involving cyclic dependencies between multiple integer or continuous quantities effectively. In this paper, we generalize the notion of stable models to bound founded variables with arbitrary domains, where bounds on such variables need to be justified by some rule in the program in order for the model to be stable. We show how to handle significantly more general rule forms where bound founded variables can act as head or body variables, and where head and body variables can be related via complex constraints subject to certain monotonicity requirements. We describe a new unfounded set detection algorithm which allows us to enforce this generalization of the stable model semantics. We also show how these unfounded sets can be explained in order to allow effective conflict-directed clause learning. the new solver merges the best features of CP, SAT and ASP solvers and allows new types of problems to be solved very efficiently.

关键词： answer set programming stable model semantics finite domain solving

来源：评论

学校读者我要写书评

暂无评论

Toward an improved downward refinement operator for inductive logic programming 29

Toward an improved downward refinement operator for inductiv...

引用

29th Italian conference on Computational logic, CILC 2014

作者： Ferilli, S. Dipartimento di Informatica Università di Bari Italy Centro Interdipartimentale per la Logica E Sue Applicazioni Università di Bari Italy

In real-world supervised Machine Learning tasks, the learned theory can be deemed as valid only until there is evidence to the contrary (i.e., new observations that are wrongly classified by the theory). In such a case, incremental approaches allow to revise the existing theory to account for the new evidence, instead of learning a new theory from scratch. In many cases, positive and negative examples are provided in a mixed and unpredictable order, which requires generalization and specialization refinement opearators to be available for revising the hypotheses in the existing theory when it is inconsistent with the new examples. the space of Datalog Horn clauses under the OI assumption allows the existence of refinement operators that fulfill desirable properties. However, the versions of these operators currently available in the literature are not able to handle some refinement tasks. the objective of this work is paving the way for an improved version of the specialization operator, aimed at extending its applicability.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：