Functional networks is a powerful and recently introduced artificialintelligence paradigm which generalizes the standard neural networks. In this paper functional networks are used to fit a given set of data from a t...
详细信息
ISBN:
(纸本)3540420711
Functional networks is a powerful and recently introduced artificialintelligence paradigm which generalizes the standard neural networks. In this paper functional networks are used to fit a given set of data from a tensor product parametric surface. the performance of this method is illustrated for the case of Bezier surfaces. Firstly, we build the simplest functional network representing such a surface, and then we use it to determine the degree and the coefficients of the bivariate polynomial surface that fits the given data better. To this aim, we calculate the mean and the root mean squared errors for different degrees of the approximating polynomial surface, which are used as our criterion of a good fitting. In addition, functional networks provide a procedure to describe parametric tensor product surfaces in terms of fan-lilies of chosen basis functions. We remark that this new approach is very general and can be applied not only to Bezier but also to any other interesting family of tensor product surfaces.
NoMoRe implements answer set semantics for normal logic programs. It realizes a novel paradigm to compute answer sets by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a label...
ISBN:
(纸本)3540425934
NoMoRe implements answer set semantics for normal logic programs. It realizes a novel paradigm to compute answer sets by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a labeled digraph) associated with a given program P (see [5] for details). Intuitively, an a-coloring reflects the set of generating rules for an answer set, which means that noMoRe is rule-based and not atom-based like most of the other known systems. Since the core system was designed for propositional programs only, we have integrated lparse [8] as a grounder in order to deal with variables. Furthermore, we have included an interface to the graph drawing tool DaVinci [6] for visualization of block graphs. this allows for a structural analysis of programs.
the proceedings contain 26 papers. the special focus in this conference is on theorem Proving in Higher Order logics. the topics include: Javacard program verification;view from the fringe of the fringe;using decision...
ISBN:
(纸本)354042525X
the proceedings contain 26 papers. the special focus in this conference is on theorem Proving in Higher Order logics. the topics include: Javacard program verification;view from the fringe of the fringe;using decision procedures with a higher-order logic;computer algebra meets automated theorem proving;HELM and the semantic math-web;calculational reasoning revisited;mechanical proofs about a non-repudiation protocol;proving hybrid protocols correct;nested general recursion and partiality in type theory;a higher-order calculus for categories;certifying the fast fourier transform with coq;a generic library for floating-point numbers and its application to exact computing;abstraction and refinement in higher order logic;representing hierarchical automata in interactive theorem provers;refinement calculus for logicprogramming in isabelle/HOL;predicate subtyping with predicate sets;a structural embedding of ocsid in PVS;a certified polynomial-based decision procedure for propositional logic;formalizing convex hull algorithms;experiments with finite tree automata in coq and mizar light for HOL light.
logic programs P and Q are strongly equivalent if, given any logic program R, programs P ∩ R and Q ∩ R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalen...
详细信息
We investigate the relationship amongst some solutions to the frame problem. We encode Pednault's syntax-based solution [20], Baker's state-minimization policy [1], and Gelfond & Lifchitz's Action Lang...
详细信息
the problem of computing X-minimal models, that is, models minimal with respect to a subset X of all the atoms in a theory, is very relevant for computing circumscriptions and diagnosis. Unfortunately, the problem is ...
详细信息
An intermediate-level specification notation, Logs, is presented for PRAM/BSP-style programming. It extends pre-post style semantics to reveal state at points of global synchronization before termination (if that occu...
详细信息
In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchica...
详细信息
Schlipf [Sch95] proved that Stable logicprogramming (SLP) solves all NP decision problems. We extend Schlipf's result to prove that SLP solves all search problems in the class NP. Moreover, we do this in a unifor...
详细信息
Data integration is the problem of combining the data residing at different sources, and providing a unified view of these data, called global schema, which can be queried by the user. the interest in this kind of sys...
详细信息
暂无评论