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

Relative expressiveness of defeasible logics II

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

作者： Maher, Michael J. Univ New S Wales Sch Engn & Informat Technol Canberra ACT 2600 Australia

Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. the second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. this completes the study of relative expressiveness in DL begun in Maher (2012).

关键词： defeasible logic non-monotonic reasoning relative expressiveness

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming for Single-Player Games in General Game Playing

Answer Set Programming for Single-Player Games in General Ga...

引用

25th international conference on logic programming (iclp)

作者： thielscher, Michael Tech Univ Dresden Dept Comp Sci Dresden Germany

ISBN: (纸本)9783642028458

As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human intervention. In this paper, we show how Answer Set programming can assist a general game player with the special class of single-player games. To this end, we present a translation from the general Game Description Language (GDL) into answer set programs (ASP). Correctness of this mapping is established by proving that the stable models of the resulting ASP coincide with the possible developments of the original GDL game. We report on experiments with single-player games from past AAAI General Game Playing Competitions which substantiate the claim that Answer Set programming can provide valuable support to general game playing systems for this type of games.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Geometric programming Formulation for Gate Sizing with Pipelining Constraints 28

Geometric Programming Formulation for Gate Sizing with Pipel...

引用

28th international conference on VLSI Design (VLSID) / 14th international conference on Embedded Systems

作者： Naidu, Srinath R. Int Inst Informat Technol Bangalore 560100 Karnataka India

ISBN: (纸本)9781479966585

We propose a novel framework to solve the combined retiming/gate sizing problem in the context of optimization of acyclic pipelines. the adjustment of sizes to gates in a combinational circuit is a continuous problem, solvable by a variety of convex optimization tools provided the delay model for each gate is placed in a convex framework. Retiming is a discrete problem since it involves physically moving registers from one location to another. In this paper, we enhance an existing convex optimization framework proposed by Boyd et al [1] to handle registers as 0-1 variables. We solve the relaxed formulation as a geometric program and glean valuable information about the circuit's performance. Another significant contribution of our paper is that we show that our problem is NP-hard.

关键词： combinational circuits computational complexity convex programming flip-flops geometric programming sizing (materials processing) NP-hard problems acyclic pipelining constraint optimization combinational circuit performance combined retiming-gate sizing problem convex optimization tool framework delay model geometric programming formulation glean valuable information physically moving registers Capacitance Delays Linear programming logic gates Pipeline processing Registers Resistance NP-hard convex optimization gate sizing retiming Nondeterministic polynomial-time hard GEOMETRIC programming Pipeline processing Combinational circuits Registers flip-flops convex programming logic gates linear programming Convex function capacitance gates complexity classes Gate dimension Circuit optimization

来源：评论

学校读者我要写书评

暂无评论

Relative expressiveness of defeasible logics II

Relative expressiveness of defeasible logics II

引用

29th international conference on logic programming iclp

作者： Maher, Michael J. Univ New S Wales Sch Engn & Informat Technol Canberra ACT 2600 Australia

关键词： defeasible logic non-monotonic reasoning relative expressiveness

来源：评论

学校读者我要写书评

暂无评论

Backdoors to normality for disjunctive logic programs 5

Backdoors to normality for disjunctive logic programs

引用

5th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th international conference on logic programming, iclp 2012

作者： Fichte, Johannes Klaus Szeider, Stefan Vienna University of Technology Austria

Over the last two decades, propositional satisfiability (Sat) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. the aim of this paper is to investigate theoretically how Sat can be utilized for the efficient solution of problems that are harder than NP or co-NP. In particular, we consider the fundamental reasoning problems in propositional disjunctive answer set programming (Asp), Brave Reasoning and Skeptical Reasoning, which ask whether a given atom is contained in at least one or in all answer sets, respectively. Both problems are located at the second level of the Polynomial Hierarchy and thus assumed to be harder than NP or co-NP. One cannot transform these two reasoning problems into Sat in polynomial time, unless the Polynomial Hierarchy collapses. We show that certain structural aspects of disjunctive logic programs can be utilized to break through this complexity barrier, using new techniques from Parameterized Complexity. In particular, we exhibit transformations from Brave and Skeptical Reasoning to Sat that run in time O(2kn2) where k is a structural parameter of the instance and n the input size. In other words, the reduction is fixed-parameter tractable for parameter k. As the parameter k we take the size of a smallest backdoor with respect to the class of normal (i.e., disjunction-free) programs. Such a backdoor is a set of atoms that when deleted makes the program normal. In consequence, the combinatorial explosion, which is expected when transforming a problem from the second level of the Polynomial Hierarchy to the first level, can now be confined to the parameter k, while the running time of the reduction is polynomial in the input size n, where the order of the polynomial is independent of k. We show that such a transformation is not possible if we consider backdoors with respect to tightness instead of normality. We think that our approach is applicable to many other hard combinatorial

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

28th international Workshop on Functional and Constraint logic programming, WFLP 2020

28th International Workshop on Functional and Constraint Log...

引用

28th international Workshop on Functional and Constraint logic programming, WFLP 2020

ISBN: (纸本)9783030753320

the proceedings contain 8 papers. the special focus in this conference is on Functional and Constraint logic programming. the topics include: On the Performance of Bytecode Interpreters in Prolog;memoized Pull-Tabbing for Functional logic programming;effectiveness of Annotation-Based Static Type Inference;a Framework for Generating Diverse Haskell-I/O Exercise Tasks;formally Verified Transformation of Non-binary Constraints into Binary Constraints;constraint-logic Object-Oriented programming with Free Arrays.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the Fusemate logic programming System 28th

The Fusemate Logic Programming System

引用

28th international conference on Automated Deduction (CADE)

作者： Baumgartner, Peter Data61 CSIRO Canberra ACT Australia Australian Natl Univ Canberra ACT Australia

ISBN: (纸本)9783030798765;9783030798758

Fusemate is a logic programming system that implements the possible model semantics for disjunctive logic programs. Its input language is centered around a weak notion of stratification with comprehension and aggregation operators on top of it. Fusemate is implemented as a shallow embedding in the Scala programming language. this enables using Scala data types natively as terms, a tight interface with external systems, and it makes model computation available as an ordinary container data structure constructor. the paper describes the above features and implementation aspects. It also demonstrates them with a non-trivial use-case, the embedding of the description logic ALCIF into Fusemate's input language.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Bridging Representations of Laws, of Implementations and of Behaviours 28

Bridging Representations of Laws, of Implementations and of ...

引用

28th Annual international conference on Legal Knowledge and Information Systems (JURIX)

作者： Sileno, Giovanni Boer, Alexander Van Engers, Tom Univ Amsterdam Leibniz Ctr Law Amsterdam Netherlands

To align representations of law, of implementations of law and of concrete behaviours, we designed a common ground representational model for the three domains, based on the notion of position, building upon Petri net... 详细信息

ISBN: (纸本)9781614996095;9781614996088

关键词： Representational alignment Positional programming logic programming Petri Nets Subsumption

来源：评论

学校读者我要写书评

暂无评论

An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional logic 28

An ASP Approach to Generate Minimal Countermodels in Intuiti...

引用

28th international Joint conference on Artificial Intelligence

作者： Fiorentini, Camillo Univ Milan Dept Comp Sci Milan Italy

ISBN: (纸本)9780999241141

Intuitionistic Propositional logic is complete w.r.t. Kripke semantics: if a formula is not intuitionistically valid, then there exists a finite Kripke model falsifying it. the problem of obtaining concise models has been scarcely investigated in the literature. We present a procedure to generate minimal models in the number of worlds relying on Answer Set programming (ASP).

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Fast and Accurate Logarithm Accelerator for Scientific Applications 28

A Fast and Accurate Logarithm Accelerator for Scientific App...

引用

28th IEEE international conference on Application-specific Systems, Architectures and Processors (ASAP)

作者： Chen, Jing Liu, Xue McGill Univ Sch Comp Sci Montreal PQ Canada

ISBN: (纸本)9781509048250

Many scientific applications rely on evaluation of elementary functions. Nowadays, high-level programming languages provide their own elementary function libraries in software by using lookup table and/or polynomial approximation. However, one downside is slow since lookup tables could keep cache thrashing and polynomial approximations require a number of iterations to converge. thus, elementary functions evaluation becomes bottleneck for most scientific applications. With this motivation, we propose a generalized pipelined hardware architecture for elementary functions to accelerate scientific applications. this paper presents a pipelined, single precision logarithm hardware accelerator (SP-LHA). throughput of SP-LHA is at least 2.5GFLOPS in 65nm ASICs, while the circuit consists of approximate to 60,000 logic gates. Average accuracy of SP-LHA is 22.5 out of 23 bits, which is achieved by using 7.8KB lookup table and parabolic interpolation.

关键词： throughput Hardware logic gates Pipelines Delays Read only memory Libraries

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：