The proceedings contain 289 papers from the logic Based Program Synthesis and Transformation: 14th International Symposium, LOPSTER 2004. Revised Selected Papers. Topics discussed include searching semantically equiva...
详细信息
The proceedings contain 289 papers from the logic Based Program Synthesis and Transformation: 14th International Symposium, LOPSTER 2004. Revised Selected Papers. Topics discussed include searching semantically equivalent code fragments in logic programs;determinacy analysis for logic programs using mode and type information;mechanical verification of automatic synthesis of fault-tolerant programs;fully automatic binding-time analysis for prolog;logical mobility and locality types;negation elimination for finite PCFGs;specialization of concurrent guarded multi-set transformation rules;efficient local unfolding with ancestor stacks for full prolog;and natural rewriting for general term rewriting systems.
The proceedings contain 75 papers. The topics discussed include: statistical relational learning: an inductive logic programming perspective;recent advances in mining time series data;data streams and data synopses fo...
详细信息
ISBN:
(纸本)3540292446
The proceedings contain 75 papers. The topics discussed include: statistical relational learning: an inductive logic programming perspective;recent advances in mining time series data;data streams and data synopses for massive data sets;agglomerative hierarchical clustering with constraints: theoretical and empirical results;a correspondence between maximal complete bipartite subgraphs and closed patterns;mining model trees from spatial data;knowledge discovery from user preferences in conversational recommendation;non-stationary environment compensation using sequential EM algorithm for robust speech recognition;and a kernel based method for discovering market segments in beef meat.
This paper presents a framework which implements the common software functionalities. By using this framework, software designers focus on their activity on developing efficient data structures and algorithms. The log...
详细信息
This paper presents a framework which implements the common software functionalities. By using this framework, software designers focus on their activity on developing efficient data structures and algorithms. The logic programming introduced in this framework is an efficient technology for Object Constraint Language expressions. Errors made by the user when modeling a device are detected and prevented by the modeling guide.
作者：
Fitting, Melvin
Bronx NY 10468 United States
365 Fifth Avenue New York NY 10036 United States
The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the...
详细信息
The purpose of this paper is to give some insights to the use of vague (fuzzy) constants and similarity in logic programming. The basis of semantics for Similarity based logic programming (SbLP) is presented. S-unific...
详细信息
In this work we review and synthesize, in a selective way, a series of recent developments concerning the dynamics of the evolution of logic programs by means of updates. We do so because this comparatively new and ex...
详细信息
FlowUML is a logic-based system to validate information flow policies at the requirements specification phase of UML based designs. It uses Horn clauses to specify information flow polices that can be checked against ...
详细信息
ISBN:
(纸本)9728865252
FlowUML is a logic-based system to validate information flow policies at the requirements specification phase of UML based designs. It uses Horn clauses to specify information flow polices that can be checked against flow information extracted from UML sequence diagrams. FlowUML policies can be written at a coarse grain level of caller-callee relationships or at a finer level involving passed attributes.
In this paper we describe a language for reasoning about actions that can be used for modelling and for programming rational agents. We propose a modal approach for reasoning about dynamic domains in a logic programmi...
详细信息
In this paper we describe a language for reasoning about actions that can be used for modelling and for programming rational agents. We propose a modal approach for reasoning about dynamic domains in a logic programming setting. Agent behavior is specified by means of complex actions which are defined using modal inclusion axioms. The language is able to handle knowledge producing actions as well as actions which remove information. The problem of reasoning about complex actions with incomplete knowledge is tackled and the temporal projection and planning problems is addressed;more specifically, a goal directed proof procedure is defined, which allows agents to reason about complex actions and to generate conditional plans. We give a non-monotonic solution for the frame problem by making use of persistency assumptions in the context of an abductive characterization. The language has been used for implementing an adaptive web-based system.
Interactions among qubits are essential for performing two-qubit quantum logic operations. However, nature gives us only nearest neighbor interactions in simple and controllable settings. Here we propose a strategy to...
详细信息
Interactions among qubits are essential for performing two-qubit quantum logic operations. However, nature gives us only nearest neighbor interactions in simple and controllable settings. Here we propose a strategy to induce interactions among two atomic entities that are not necessarily neighbors of each other through their common coupling with a cavity field. This facilitates fast multiqubit quantum logic operations through a set of two-qubit operations. Using its explicit position dependence, this interaction can be employed for simulation of quantum spin systems. The ideas presented here are applicable to various quantum-information proposals for atom-based qubits such as trapped ions, atoms trapped in optical cavities, and optical lattices.
In logic programming, a variable is said to be local if it occurs in a clause body but not in its head atom. It is well-known that local variables are the main cause of inefficiency (sometimes even incompleteness) in ...
详细信息
In logic programming, a variable is said to be local if it occurs in a clause body but not in its head atom. It is well-known that local variables are the main cause of inefficiency (sometimes even incompleteness) in negative goal computation. The problem is twofold. First, the negation of a clause body that contains a local variables is not expressible without universal quantification, whereas the abscence of local variables guarantees that universal quantification can be avoided to compute negation. Second, computation of universal quantification is an intrinsically difficult task. In this paper, we introduce an effective method that takes a definite logic program and transforms it into a local variable free (definite) program. Source and target programs are equivalent w.r.t. three-valued logical consequences of program completion. In further work, we plan to extend our results to normal logic programs.
暂无评论