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

A truly concurrent semantics for a simple parallel programming language 13th

8th Annual conference of the European-Association-for-Computer-Science-logic (EACSL)/13th international Workshop on Computer Science logic (CSL 99)

作者： Gastin, P Mislove, M Univ Paris 07 LIAFA F-75251 Paris 05 France Tulane Univ Dept Math New Orleans LA 70118 USA

ISBN: (纸本)3540665366

this paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, paxallelism and choice. We present a simple programming language which includes (weakly) sequential composition, asynchronous and synchronous parallel composition, a restriction operator, and that supports recursion. We develop an operational and a denotational semantics for this language, and we obtain a theorem relating the behavior of a process as described by the transition system to the meaning of the process in the denotational model. this implies that the denotational model is adequate with respect to the operational model. Our denotational model is based on the resource traces of Gastin and Teodesiu, and since a single resource trace represents all possible executions of a concurrent process, we axe able to model each term of our concurrent language by a single trace. therefore we obtain a deterministic semantics for our language and we axe able to model parallelism without introducing nondeterminism.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Improving Multi-adjoint logic Programs by Unfolding Fuzzy Connective Definitions 13

引用

13th international Work-conference on Artificial Neural Networks (IWANN)

作者： Morcillo, Pedro J. Moreno, Gines Univ Castilla La Mancha Dept Comp Syst Albacete 02071 Spain

ISBN: (纸本)9783319192581;9783319192574

Declarative programming has been classically used for solving computational problems regarding AI, knowledge representation and so on. During the last decade, Soft-Computing has emerged as a new application area specially tempting for those new generation declarative languages integrating fuzzy logic into logic programming. In many fuzzy logic programming languages, both program clauses and connective definitions admit a clear declarative, rule-based representation inspired by the well-known logic and functional programming paradigms, respectively. A powerful and promising proposal in this area is represented by the multi-adjoint logic programming approach (for which we have developed the FLOPER tool), where a set of (logic) Prolog-like rules are accompanied with a set of (functional) Haskell-like fuzzy connective definitions for manipulating truth degrees beyond the simpler case of {true, false}. Since these definitions can be seen as a particular case of equations and/or rewrite rules typically used in functional programming, in this paper we focus on their optimization by reusing some variants of program transformation techniques based on unfolding with a functional taste, which have been largely exploited in this last crisp (not fuzzy) setting. We also show how our method rebounds in the simplification of some computational cost measures we proposed in the past. Our approach is accompanied with some implementation and practical issues in connection with the SYNth and FLOPER tools and the fuzzyX-Path application we have developed in the area of the semantic web.

关键词： Fuzzy logic programming Connectives Unfolding

来源：评论

学校读者我要写书评

暂无评论

SAT solving for argument filterings

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Codish, Michael Schneider-Kamp, Peter Lagoon, Vitaly thiemann, Rene Giesl, Juergen Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Rhein Westfal TH Aachen LuFG Informat 2 D-5100 Aachen Germany Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic Australia

ISBN: (纸本)3540482814

this paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. this facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues and encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (1) the combined search for a lexicographic path order together with an argument filtering to orient a set of inequalities;and (2) how the choice of the argument filtering influences the set of inequalities that have to be oriented. We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

An Alternative to SAT-Based Approaches for Bit-Vectors

An Alternative to SAT-Based Approaches for Bit-Vectors

引用

16th international conference on Tools and Algorithms for the Construction and Analysis of Systems held at the 13th Joint European conferences on theory and Practice of Software

作者： Bardin, Sebastien Herrmann, Philippe Perroud, Florian CEA LIST Software Safety Lab F-91191 Gif Sur Yvette France

ISBN: (纸本)9783642120015

the theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solvers for this theory are based on a bit-level encoding into propositional logic and SAT-based resolution techniques. In this paper, we investigate an alternative approach based on a word-level encoding into bounded arithmetic and Constraint logic programming (CLP) resolution techniques. We define an original CLP framework (domains and propagators) dedicated to bit-vector constraints. this framework is implemented in a prototype and thorough experimental studies have been conducted. the new approach is shown to perform much better than standard CLP-based approaches, and to considerably reduce the gap with the best SAT-based BV solvers.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Diagnostic reasoning for robotics using action languages 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Erdem, Esra Patoglu, Volkan Saribatur, Zeynep Gozen Sabanci University Istanbul Turkey Vienna University of Technology Vienna Austria

ISBN: (纸本)9783319232638

We introduce a novel diagnostic reasoning method for robotic systems with multiple robots, to find the causes of observed discrepancies relevant for plan execution. Our method proposes (i) a systematic modification of the robotic action domain description by utilizing defaults, and (ii) algorithms to compute a smallest set of diagnoses (e.g., broken robots) by means of hypothetical reasoning over the modified formalism. the proposed method is applied over various robotic scenarios in cognitive factories. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Flexible planning logic for technology planning

引用

JOURNAL OF MATERIALS PROCESSING TECHNOLOGY 1998年第1-3期76卷 76-81页

作者： Spath, D Agostini, A Univ Karlsruhe Inst Werkzuegmaschinen & Betriebstech D-76128 Karlsruhe Germany

the ever-rising expectations of customers regarding quality and diversity of products require new products to be launched with a minimum of upheaval and consequently rapid, defect-free and economical processes. these goals can be attained and guaranteed in the planning departments of businesses through the sharing of secure and up-to-date planning data. leading to a high degree of flexibility and a minimum of interruptions in the production processes. In terms of technology planning, this results in a demand for economic methods of planning and NC programming, leading in turn to continuous, systematic acquisition of specialised in-house technological knowledge. However, most of the applications on the market are unsatisfactory in terms of acquisition of specialised knowledge of technology, only allowing specialised planning knowledge to be gathered or entered through costly procedures and for it to be organised statically. For rational processing and evaluation of planning knowledge, it is therefore sensible to systematically record technological discoveries made in the course of the planning and running-in process and to make them available for future planning processes. this processing of empirical knowledge along with rational and safe technology planning is supported by the use of DP systems, thus enabling planning knowledge to be kept constantly up-to-date, growing along with the data specific to the enterprise, Fur this purpose, a suitable information model must be devised that represents the integration point within the NC process chain. Using a feature-based product model introduced in the design departments as a starting point, the model is extended to take in a production-orientated view. the model should be designed in such a way that, above all, the technological interconnections are represented and that the technology planning, NC programming and running-in process are integrated through the model. In order to evaluate and process empirical knowledge? m

关键词： CAP CAM CNC feature-based manufacturing

来源：评论

学校读者我要写书评

暂无评论

Constructing Camin-Sokal phylogenies via answer set programming

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Kavanagh, Jonathan Mitchell, David Ternovska, Eugenia Manuch, Jan Zhao, Xiaohong Gupta, Arvind Simon Fraser Univ Burnaby BC V5A 1S6 Canada

ISBN: (纸本)3540482814

Constructing parsimonious phylogenetic trees from species data is a central problem in phylogenetics, and has diverse applications, even outside biology. Many variations of the problem, including the cladistic Camin-Sokal (CCS) version, are NP-complete. We present Answer Set programming (ASP) models for the binary CCS problem, as well as a simpler perfect phylogeny version, along with experimental results of applying the models to biological data. Our contribution is three-fold. First, we solve phylogeny problems which have not previously been tackled by ASP. Second, we report on variants of our CCS model which significantly. affect run time, including the interesting case of making the program "slightly tighter". this version exhibits some of the best performance, in contrast with a tight version of the model which exhibited poor performance. third, we are able to find proven-optimal solutions for larger instances of the CCS problem than the widely used branch-and-bound-based PHYLIP package.

关键词： phylogeny maximum parsimony Camin-Sokal answer set programming

来源：评论

学校读者我要写书评

暂无评论

On the connection between the phase transition of the covering test and the learning success rate in ILP

On the connection between the phase transition of the coveri...

引用

16th international conference of inductive logic programming

作者： Alphonse, Erick Osmani, Aomar Univ Paris 13 LIPN CNRS UMR 7030 Paris France

It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete and therefore exhibits a sharp phase transition in its coverage probability. As the heuristic value of a hypothesis depends on the number of covered examples, the regions "yes" and "no" represent plateaus that need to be crossed during search without an informative heuristic value. Several subsequent works have extensively studied this finding by running several learning algorithms on a large set of artificially generated problems and argued that the occurrence of this phase transition dooms every learning algorithm to fail to identify the target concept. We note however that only generate-and-test learning algorithms have been applied and that this conclusion has to be qualified in the case of data-driven learning algorithms. Mostly building on the pioneering work of Winston on near-miss examples, we show that, on the same set of problems, a top-down data-driven strategy can cross any plateau if near-misses are supplied in the training set, whereas they do not change the plateau profile and do not guide a generate-and-test strategy. We conclude that the location of the target concept with respect to the phase transition alone is not a reliable indication of the learning problem difficulty as previously thought.

关键词： inductive logic programming heuristic search plateau phenomena phase transition near-miss examples

来源：评论

学校读者我要写书评

暂无评论

Modeling and Solving the Soft Constraints for Supply Chain Problems Using the Hybrid Approach 13th

引用

13th international conference on Distributed Computing and Artificial Intelligence (DCAI)

作者： Sitek, Pawel Kielce Univ Technol Dept Informat Syst Kielce Poland

ISBN: (纸本)9783319401621;9783319401614

Many real-life problems in Supply Chain (SC) are over-constrained. Insufficient resources and time requirements result in an inability to all constraints. In some cases, their fulfillment requires very intensive computing. One way to overcome these difficulties is to soften some of the constraints. Natural environment for the modeling and solving of problems with constraints is constraint programming (CP), which is, however, ineffective on optimization problems and constraints containing a sum of many decision variables. this is when the idea to hybridize CP and other environments originated. the article presents the concept of modeling and solving soft constraints in SC problems using the hybrid approach. the illustrative example provided in the paper illustrates effectiveness and possibilities of this approach.

关键词： Soft constrains Constraint logic programming Optimization Mathematical programming Supply Chain

来源：评论

学校读者我要写书评

暂无评论

Stable models in generalized possibilistic logic

Stable models in generalized possibilistic logic

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Dubois, Didier Prade, Henri Schockaert, Steven Université Paul Sabatier CNRS IRIT Toulouse France Cardiff University School of Computer Science and Informatics Cardiff United Kingdom

ISBN: (纸本)9781577355601

Possibilistic logic is a well-known logic for reasoning under uncertainty, which is based on the idea that the epistemic state of an agent can be modeled by assigning to each possible world a degree of possibility, taken from a totally ordered, but essentially qualitative scale. Recently, a generalization has been proposed that extends possibilistic logic to a meta-epistemic logic, endowing it with the capability of reasoning about epistemic states, rather than merely constraining them. In this paper, we further develop this generalized possi-bilistic logic (GPL). We introduce an axiomatization showing that GPL is a fragment of a graded version of the modal logic KD, and we prove soundness and completeness w.r.t. a semantics in terms of possibility distributions. Next, we reveal a close link between the well-known stable model semantics for logic programming and the notion of minimally specific models in GPL. More generally, we analyze the relationship between the equilibrium logic of Pearce and GPL, showing that GPL can essentially be seen as a generalization of equilibrium logic, although its notion of minimal specificity is slightly more demanding than the notion of minimality underlying equilibrium logic. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：