this research introduces a system that combines Graph Neural Networks and Machine Learning to accurately pinpoint logic errors in programming. Unlike syntax errors which compilers can easily identify, logic errors lac...
详细信息
ISBN:
(纸本)9798350344172
this research introduces a system that combines Graph Neural Networks and Machine Learning to accurately pinpoint logic errors in programming. Unlike syntax errors which compilers can easily identify, logic errors lack clear diagnostic feedback, making them harder to locate. To enhance error detection, our system incorporates pseudocode, enabling a structured connection between source code and its pseudocode through a code-pseudocode graph. By using a Graph Neural Network model, we can localize these logic errors with higher precision. To train and validate our model, we gather logically erroneous programs from the syntax error repair process, forming a unique dataset. Experiments reveal an impressive localization accuracy of 99.42% on this dataset with five-fold cross-validation. Future directions include expanding our dataset and devising a system to interpret diverse programming languages for efficient error localization.
A random access analog memory is designed without static power in this work. the analog memory appears the benefit on the great reduction of interconnections but suffers from the static power consumption and inaccurac...
详细信息
ISBN:
(纸本)9781538640340
A random access analog memory is designed without static power in this work. the analog memory appears the benefit on the great reduction of interconnections but suffers from the static power consumption and inaccuracy. As a hybrid, the hexadecimal signal processing is targeted in this paper. For storing hexadecimal values even implementing hexadecimal sequential logic, a master-slave structure is proposed with eighteen transistors, which is 28% of four pieces of binary master-slave flipflop. the hexadecimal voltage values are stored on the floating gate;and the read-out operations are executed by a comparator to protect the stored voltage. this comparator is powered only during the read-out operation. In this manner, the static power is eliminated. By using the proposed timing control mode, the master and slave stages are organized for hexadecimal sequential logic. As a demonstration, a sixteen-counter is designed on the basis of proposed analog memory without combinational logic circuits, in which the number of devices is reduced in contrast of binary approaches. From the circuit simulation results, the designed circuits maintain the hexadecimal values and execute hexadecimal functions correctly.
this book constitutes the refereed conference proceedings of the 30thinternationalconference on Inductive logicprogramming, ILP 2021, held in October 2021. Due to COVID-19 pandemic the conference was held virtually.
ISBN:
(数字)9783030974541
ISBN:
(纸本)9783030974534
this book constitutes the refereed conference proceedings of the 30thinternationalconference on Inductive logicprogramming, ILP 2021, held in October 2021. Due to COVID-19 pandemic the conference was held virtually.
this paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling withthe notion of p-box to gain additional quantifiable information on the data whereabouts. Unlike ...
详细信息
this paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling withthe notion of p-box to gain additional quantifiable information on the data whereabouts. Unlike existing approaches, the p-box envelops an unknown probability instead of approximating its representation. the p-box bounds are uniform cumulative distribution functions (cdf)in order to employ linear computations in the probabilistic domain. the reasoning by means of p-box cdf-intervals is an interval computation which is exerted on the real domain then it is projected onto the cdf domain. this operation conveys additional knowledge represented by the obtained probabilistic bounds. the empirical evaluation of our implementation shows that, with minimal overhead, the output solution set realizes a full enclosure of the data along with tighter bounds on its probabilistic distributions.
Incremental stack-copying is a technique which has been successfully used to support efficient parallel execution of a variety of search-based Al systems - e.g., logic-based and constraint-based systems. the idea of i...
详细信息
ISBN:
(纸本)0769512585
Incremental stack-copying is a technique which has been successfully used to support efficient parallel execution of a variety of search-based Al systems - e.g., logic-based and constraint-based systems. the idea of incremental stack-copying is to only copy the difference between the data areas of two agents, instead of copying them entirely, when distributing parallel work. In order to further reduce the communication during stack-copying and make its implementation efficient on message-passing platforms, a new technique, called stack-splitting, has recently been proposed. In this paper, we describe a scheme to effectively combine stack-splitting with incremental stack copying, to achieve superior parallel performance in a nonshared memory environment. We also describe a scheduling scheme for this incremental stack-splitting strategy. these techniques are currently being implemented in the PALS system-a parallel constraint logicprogramming system.
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 sem...
详细信息
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.
When developing a (web) interface for a deductive database, functionality required by the client is provided by means of HTTP handlers that wrap the logical data access predicates. these handlers are responsible for c...
详细信息
When developing a (web) interface for a deductive database, functionality required by the client is provided by means of HTTP handlers that wrap the logical data access predicates. these handlers are responsible for converting between client and server data representations and typically include options for paginating results. Designing the web accessible API is difficult because it is hard to predict the exact requirements of clients. Pengines changes this picture. the client provides a Prolog program that selects the required data by accessing the logical API of the server. the pengine infrastructure provides general mechanisms for converting Prolog data and handling Prolog non-determinism. the Pengines library is small (2000 lines Prolog, 150 lines JavaScript). It greatly simplifies defining an AJAX based client for a Prolog program and provides non-deterministic RPC between Prolog processes as well as interaction with Prolog engines similar to Paul Tarau's engines. Pengines are available as a standard package for SWI-Prolog 7.(1)
Efficient omission of symmetric solution candidates is essential for combinatorial problem solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Con...
详细信息
ISBN:
(纸本)9780999241196
Efficient omission of symmetric solution candidates is essential for combinatorial problem solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for each given problem instance. However, the application of such approaches to large-scale instances or advanced problem encodings might be problematic. Moreover, the computed SBCs are propositional and, therefore, can neither be meaningfully interpreted nor transferred to other instances. To overcome these limitations, we introduce a new modeloriented approach for Answer Set programmingthat lifts the SBCs of small problem instances into a set of interpretable first-order constraints using the Inductive logicprogramming paradigm. Experiments demonstrate the ability of our framework to learn general constraints from instance-specific SBCs for a collection of combinatorial problems. the obtained results indicate that our approach significantly outperforms a state-of-the-art instancespecific method as well as the direct application of a solver.
Answer Set programming is a declarative problem solving approach, initially tailored to modelling problems in the area of Knowledge Representation and Reasoning. In this article, we provide a knowledge-based system, c...
详细信息
ISBN:
(纸本)9781538674499
Answer Set programming is a declarative problem solving approach, initially tailored to modelling problems in the area of Knowledge Representation and Reasoning. In this article, we provide a knowledge-based system, capable of representing and reasoning about legal knowledge in the context of Answer Set programmingthus, modelling non-monotonicity that is inherent in legal arguments. the work, although limited to a specific indicative domain, namely, university regulations, has a variety of extensions. the overall approach constitutes a representative implementation of the Answer Set programming's modelling methodology, as well as an enhancing of the bond between Artificial Intelligence and Legal Science, bringing us a step closer to a successful development of an automated legal reasoning system for real-world applications.
暂无评论