Using domain knowledge to speed up learning is widely accepted but theory revision of such knowledge continues to use general syntactic operators. Using such operators for theory revision of teleoreactive logic progra...
详细信息
ISBN:
(纸本)9783642138393
Using domain knowledge to speed up learning is widely accepted but theory revision of such knowledge continues to use general syntactic operators. Using such operators for theory revision of teleoreactive logic programs is especially expensive in which proof of a top-level goal involves playing a game. In such contexts, one should have the option to complement general theory revision with domain-specific knowledge. Using American football as an example, we use Icarus' multi-agent teleoreactive logicprogramming ability to encode a coach agent whose concepts correspond to faults recognized in execution of the play and whose skills correspond to making repairs in the goals of the player agents. Our results show effective learning using as few as twenty examples. We also show that structural changes made by such revision can produce performance gains that cannot be matched by doing only numeric optimization.
Networks-on-chip need to survive to manufacturing faults in order to sustain yield. An effective testing and configuration strategy however implies two opposite requirements. On one hand, a fast and scalable built-in ...
详细信息
this volume contains the papers presented at the 19thinternationalconference on Automated Deduction (CADE-19) held 28 July–2 August 2003 in Miami Beach, Florida, USA. they are divided into the following categories:...
详细信息
ISBN:
(数字)9783540450856
ISBN:
(纸本)9783540405597
this volume contains the papers presented at the 19thinternationalconference on Automated Deduction (CADE-19) held 28 July–2 August 2003 in Miami Beach, Florida, USA. they are divided into the following categories: – 4 contributions by invited speakers: one full paper and three short abstracts; – 29 accepted technical papers; – 7 descriptions of automated reasoning systems. these proceedings also contain a short description of the automated theor- proving system competition (CASC-19) organized by Geo? Sutcli?e and Chr- tian Suttner. Despite many competing smaller conferences and workshops covering di?- entaspectsofautomateddeduction,CADEisstillthemajorforumfordiscussing new results on all aspects of automated deduction as well as presenting new s- tems and improvements of established systems. In contrast to the previous year, when CADE was one of the conferences participating in the third Federated logicconference (FLoC 2002), and next year, when CADE will be part of the Second international Joint conference on Automated Reasoning (IJCAR 2004), CADE-19 was organized as a stand-alone event.
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondis...
详细信息
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondis-junctive programs. this paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two different ways of SAT solver invocation used in nondisjunctive answer set programming. the algorithms are based on the definition of completion for disjunctive programs and the extension of loop formula to the disjunctive case. We propose the necessary modifications to the algorithms known for nondisjunctive programs in order to adapt them to the disjunctive case and demonstrate their implementation based on system CMODELS.
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so fa...
详细信息
In this paper we present an effective prover for mbC, a minimal inconsistency logic. the mbC logic is a paraconsistent logic of the family of logics of formal inconsistency. Paraconsistent logics have several philosop...
详细信息
ISBN:
(纸本)0387346546
In this paper we present an effective prover for mbC, a minimal inconsistency logic. the mbC logic is a paraconsistent logic of the family of logics of formal inconsistency. Paraconsistent logics have several philosophical motivations as well as many applications in Artificial Intelligence such as in belief revision, inconsistent knowledge reasoning, and logicprogramming. We have implemented the KEMS prover for mbC, a theorem prover based on the KE tableau method for mbC. We show here that the proof system on which this prover is based is sound, complete and analytic. To evaluate the KEMS prover for mbC, we devised four families of mbC-valid formulas and we present here the first benchmark results using these families.
this article describes an approach to parallelizing of data mining algorithms in logical programming framework, for distributed data processing in cluster. As an example Naive Bayes algorithm implementation in Prolog ...
详细信息
ISBN:
(纸本)9783030308599;9783030308582
this article describes an approach to parallelizing of data mining algorithms in logical programming framework, for distributed data processing in cluster. As an example Naive Bayes algorithm implementation in Prolog framework, its conversion into parallel type and execution on cluster with MPI system are described.
this book constitutes the refereed proceedings of the 9thinternationalconference on Typed Lambda Calculi and Applications, TLCA 2009, held in Brasilia, Brazil in July 2008 in conjunction with RTA 2007, the 19th Inte...
详细信息
ISBN:
(数字)9783642022739
ISBN:
(纸本)9783642022722
this book constitutes the refereed proceedings of the 9thinternationalconference on Typed Lambda Calculi and Applications, TLCA 2009, held in Brasilia, Brazil in July 2008 in conjunction with RTA 2007, the 19thinternationalconference on Rewriting Techniques and Applications as part of RDP 2009, the 5thinternationalconference on Rewriting, Deduction, and programming. the 27 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 53 submissions. the papers present original research results that are broadly relevant to the theory and applications of typed calculi and address a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.
In this paper, we introduce a general methodology of reverse engineering for Xilinx FPGA devices using flash memory for programming. Based on the structural analysis of the flash memory used for the most recent 7-Seri...
详细信息
ISBN:
(纸本)9781665459716
In this paper, we introduce a general methodology of reverse engineering for Xilinx FPGA devices using flash memory for programming. Based on the structural analysis of the flash memory used for the most recent 7-Series FPGA, data extraction for reverse engineering is carried out targeting the flash memory withthe help of a logic analyzer. the accuracy of the extracted bitstream is finally verified using the in-house reverse engineering tool.
High performance computing (HPC) is gaining popularity in solving scientific applications. Using the current programming standards, however, it takes an HPC expert to efficiently take advantage of HPC facilities;a ski...
详细信息
暂无评论