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

A Proof theoretic Study of Soft Concurrent Constraint programming

thEORY AND PRACTICE OF logic programming 2014年第4-5期14卷 649-663页

作者： Pimentel, Elaine Olarte, Carlos Nigam, Vivek Univ Fed Rio Grande do Norte BR-59072970 Natal RN Brazil Pontificia Univ Javeriana Cali Javeriana Colombia Univ Fed Paraiba BR-58059900 Joao Pessoa Paraiba Brazil

Concurrent Constraint programming (CCP) is a simple and powerful model for concurrency where agents interact by telling and asking constraints. Since their inception, CCP-languages have been designed for having a strong connection to logic. In fact, the underlying constraint system can be built from a suitable fragment of intuitionistic (linear) logic -ILL- and processes can be interpreted as formulas in ILL. Constraints as ILL formulas fail to represent accurately situations where "preferences" (called soft constraints) such as probabilities, uncertainty or fuzziness are present. In order to circumvent this problem, c-semirings have been proposed as algebraic structures for defining constraint systems where agents are allowed to tell and ask soft constraints. Nevertheless, in this case, the tight connection to logic and proof theory is lost. In this work, we give a proof theoretical meaning to soft constraints: they can be defined as formulas in a suitable fragment of ILL with subexponentials (SELL) where subexponentials, ordered in a c-semiring structure, are interpreted as preferences. We hence achieve two goals: (1) obtain a CCP language where agents can tell and ask soft constraints and (2) prove that the language in (1) has a strong connection with logic. Hence we keep a declarative reading of processes as formulas while providing a logical framework for soft-CCP based systems. An interesting side effect of (1) is that one is also able to handle probabilities (and other modalities) in SELL, by restricting the use of the promotion rule for non-idempotent c-semirings. this finer way of controlling subexponentials allows for considering more interesting spaces and restrictions, and it opens the possibility of specifying more challenging computational systems.

关键词： Concurrent Constraint programming Linear logic Soft Constraints

来源：评论

学校读者我要写书评

暂无评论

Causal Graph Justifications of logic Programs

Causal Graph Justifications of Logic Programs

引用

30th international conference on logic programming

作者： Cabalar, Pedro Fandinno, Jorge Fink, Michael Univ A Coruna Dept Comp Sci Coruna Spain Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. these justifications are expressed in terms of causal graphs formed by rule labels and edges that represent their application ordering. For positive programs, we show that the causal justifications obtained for a given atom have a direct correspondence to (relevant) syntactic proofs of that atom using the program rules involved in the graphs. the most interesting contribution is that this causal information is obtained in a purely semantic way, by algebraic operations (product, sum and application) on a lattice of causal values whose ordering relation expresses when a justification is stronger than another. Finally, for programs with negation, we define the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct. As a result, default negation behaves as "absence of proof" and no justification is derived from negative literals, something that turns out convenient for elaboration tolerance, as we explain with a running example.

关键词： Answer Set programming Causality Knowledge Representation Multi-valued logic programming

来源：评论

学校读者我要写书评

暂无评论

Magneto-Electric Magnetic Tunnel Junction Based Analog Circuit Options 30

Magneto-Electric Magnetic Tunnel Junction Based Analog Circu...

引用

30th IEEE international System-on-Chip conference (SOCC)

作者： Sharma, Nishtha Bird, Jonathan Dowben, Peter Marshall, Andrew Univ Texas Dallas Richardson TX 75083 USA Univ Buffalo Buffalo NY USA Univ Nebraska Lincoln NE USA

ISBN: (纸本)9781538640340

the magneto-electric magnetic tunnel junction (ME-MTJ) is a voltage controlled beyond CMOS device based on the principle of ME anti-ferromagnetic (AFM) exchange biasing of chromia (Cr2O3) and the tunneling magneto resistance (TMR) of a magnetic tunnel junction (fixed/free ferromagnet (FM) stack). these devices have previously been demonstrated for the implementation of digital logic and memory applications. We here demonstrate their analog capabilities with a variety of analog functions adapted specifically to the characteristics of ME-MTJ based devices. the novel circuit options proposed in this paper includes a ME-MTJ based analog comparator and the two variations of an 8 level analog-to-digital converter (ADC) using serial and parallel ME-MTJ circuit configurations.

关键词： Spintronics Magneto-Electric Magnetic Tunnel Junction (ME-MTJ) logic Memory Analog-to-Digital converter (ADC) Verilog-A Magnetic Tunnel Junction (MTJ)

来源：评论

学校读者我要写书评

暂无评论

ASICs, processors, and configurable computing

ASICs, processors, and configurable computing

引用

the 1997 30th Annual Hawaii international conference on System Sciences, HICSS-30

作者： Hutchings, Brad L. Brigham Young Univ Provo UT United States

the relationships between configurable computing, ASICs, and microprocessors have several important implications. First, sequential programming languages and related compilation approaches are not likely to be a good match for highly parallel configurable-computing applications. While it may be possible to achieve moderate speedup, significant speedup will only be achieved by directly exploiting massive amounts of parallelism. this is currently done using low-level circuit design tools. Second, the architectural organization will be much more distributed than is commonly found in existing computer systems. Finally, hybrid systems of microprocessors and FPGAs are best coupled flexibly to fully exploit the best features of each device.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Resource Usage Analysis of logic Programs via Abstract Interpretation Using Sized Types

引用

thEORY AND PRACTICE OF logic programming 2014年第4-5期14卷 739-754页

作者： Serrano, A. Lopez-Garcia, P. Hermenegildo, M. V. Univ Utrecht Dept Informat & Comp Sci NL-3508 TC Utrecht Netherlands IMDEA Software Inst Madrid Spain CSIC Spanish Council Sci Res Madrid Spain Tech Univ Madrid UPM Madrid Spain

We present a novel general resource analysis for logic programs based on sized types. Sized types are representations that incorporate structural (shape) information and allow expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. they also allow relating the sizes of terms and subterms occurring at different argument positions in logic predicates. Using these sized types, the resource analysis can infer both lower and upper bounds on the resources used by all the procedures in a program as functions on input term (and subterm) sizes, overcoming limitations of existing resource analyses and enhancing their precision. Our new resource analysis has been developed within the abstract interpretation framework, as an extension of the sized types abstract domain, and has been integrated into the Ciao preprocessor, CiaoPP. the abstract domain operations are integrated with the setting up and solving of recurrence equations for inferring both size and resource usage functions. We show that the analysis is an improvement over the previous resource analysis present in CiaoPP and compares well in power to state of the art systems.

关键词： analysis programme Upper bound Formal logic logic programming

来源：评论

学校读者我要写书评

暂无评论

Modal logic for reasoning about belief

Modal logic for reasoning about belief

引用

the 1997 30th Annual Hawaii international conference on System Sciences, HICSS-30

作者： Zhang, Guo-Qiang Huang, Chang Rounds, William C. Univ of Georgia Athens GA United States

ISBN: (纸本)0818677430

A number of ideas from knowledge representation is integrated with ideas from the semantics of programming language in a basic logical system for belief. A knowledge-based system can be considered as, in a simplified way, an agent which, based on its current state of information, makes inference for purposes such as planning or taking an action that best suits the agent's goal. A modal-checking approach was taken to formalize the system. An agent's current state of knowledge was expressed by a semantic model, and the agent's belief or action as some logical formulas.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Evolutionary algorithms for the resource constrained scheduling problem

Evolutionary algorithms for the resource constrained schedul...

引用

30th international conference on Information Technology Interfaces

作者： Frankola, Toni Golub, Marin Jakobovic, Domagoj Univ Zagreb Fac Elect Engn & Comp Zagreb 41000 Croatia

ISBN: (纸本)9789537138127

this paper investigates the use of evolutionary algorithms for solving resource constrained scheduling problem which belongs to the class of NP complete problems. the problem involves finding optimal sequence of activities with given resource constraints. Evolutionary algorithms used in this paper are genetic algorithms and genetic programming, for which adequate scheduling mechanisms are defined. Presented solutions are compared with existing heuristics or optimal results.

关键词： resource constrained scheduling priority scheduling genetic programming

来源：评论

学校读者我要写书评

暂无评论

Programmable Clock Delay for Hysteresis Adjustment in Dynamic Comparators 30

Programmable Clock Delay for Hysteresis Adjustment in Dynami...

引用

30th international conference on Microelectronics (ICM)

作者： Khanfir, Leila Mouine, Jaouhar Univ Tunis El Manar Natl Engn Sch Tunis Anal Concept & Control Syst Lab Tunis Tunisia Prince Sattam Bin Abdulaziz Univ Dept Elect Engn Al Kharj Saudi Arabia

ISBN: (纸本)9781538681671

the comparator hysteresis adjustment has allowed emerging new application fields including peak detectors and spectrum analyzers. However, hysteresis programming techniques has been mainly developed for static comparators. Hence, when high speed operation and reduced silicon area are desired, such techniques should also be developed for dynamic comparators. this paper presents a new hysteresis programming technique in dynamic comparators based on the digital programming of the clock delay. For this purpose and to ensure optimal circuit performance, a new delay circuit has been designed. To validate the design, a dynamic comparator with 4-bit hysteresis programming has been implemented and simulated using a commercially available 0.18 m CMOS process. the comparator hysteresis is then adjusted form 200 V to 17mV. the whole circuit consumes 1.1pJ at 500MHz while consuming less than 65 W of static power.

关键词： Dual-clock comparator hysteresis programming clock delay programming programmable delay circuit.

来源：评论

学校读者我要写书评

暂无评论

A Module System for Domain-Specific Languages

A Module System for Domain-Specific Languages

引用

30th international conference on logic programming

作者： Jackson, Ethan K. Microsoft Res Res Software Engn RiSE Redmond WA 98052 USA

Domain-specific languages (DSLs) are routinely created to simplify difficult or specialized programming tasks. they expose useful abstractions and design patterns in the form of language constructs, provide static semantics to eagerly detect misuse of these constructs, and dynamic semantics to completely define how language constructs interact. However, implementing and composing DSLs is a non-trivial task, and there is a lack of tools and techniques. We address this problem by presenting a complete module system over LP for DSL construction, reuse, and composition. LP is already useful for DSL design, because it supports executable language specifications using notations familiar to language designers. We extend LP with a module system that is simple (with a few concepts), succinct (for key DSL specification scenarios), and composable (on the level of languages, compilers, and programs). these design choices reflect our use of LP for industrial DSL design. Our module system has been implemented in the formula language, and was used to build key Windows 8 device drivers via DSLs. though we present our module system as it actually appears in our formula language, our emphasis is on concepts adaptable to other LP languages.

关键词： module systems domain-specific languages logic programming

来源：评论

学校读者我要写书评

暂无评论

slepice: Towards a Verified Implementation of Type theory in Type theory 30th

slepice: Towards a Verified Implementation of Type Theory in...

引用

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

作者： Farka, Frantisek IMDEA Software Inst Madrid Spain

ISBN: (纸本)9783030684457;9783030684464

Dependent types have proven a useful technique for development of verified software. Despite the existence of many systems based in dependent type theory, mostly interactive theorem provers but also programming languages, there is no system that would itself be implemented using dependent types. Recently, a new approach to type inference and term synthesis for type theory with dependent types emerged that separates the process into an analysis phase that is carried out in type theory, and a search phase that is carried out in a logic programming engine. We describe an architecture of type inference 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 slepice, its particular implementation.

关键词： Dependent types Type inference Horn clause logic Term synthesis Proof-relevant resolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：