• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,431
Next 10 →

PAC-Learnability of Determinate Logic Programs

by Saso Dzeroski , Stephen Muggleton, Stuart Russell , 1992
"... The field of Inductive Logic Programming (ILP) is concerned with inducing logic programs from examples in the presence of background knowledge. This paper defines the ILP problem, and describes the various syntactic restrictions that are commonly used for learning first-order representations. We the ..."
Abstract - Cited by 75 (8 self) - Add to MetaCart
then derive some positive results concerning the learnability of these restricted classes of logic programs, by reducing the ILP problem to a standard propositional learning problem. More specifically, k-clause predicate definitions consisting of determinate, function-free, non-recursive Horn clauses

The Pac-Learnability of Recursive Logic Programs

by William W. Cohen , 1994
"... We analyze the learnability of function-free recursive logic programs in the models of polynomial predictability and identification from equivalence queries. Our ultimate goal is delineating the boundaries of efficient learnability for recursive logic programs. In the first ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We analyze the learnability of function-free recursive logic programs in the models of polynomial predictability and identification from equivalence queries. Our ultimate goal is delineating the boundaries of efficient learnability for recursive logic programs. In the first

First order jk-clausal theories are PAC-learnable

by Luc De Raedt - Artificial Intelligence , 1994
"... We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomialsample polynomial-time PAC-learnable with on ..."
Abstract - Cited by 71 (26 self) - Add to MetaCart
We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomialsample polynomial-time PAC-learnable

Representing Action and Change by Logic Programs

by Michael Gelfond, Vladimir Lifschitz - Journal of Logic Programming , 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract - Cited by 414 (25 self) - Add to MetaCart
We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a

HyTech: A Model Checker for Hybrid Systems

by Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-toi - Software Tools for Technology Transfer , 1997
"... A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete change with differential equations for capturing conti ..."
Abstract - Cited by 473 (6 self) - Add to MetaCart
for which a linear hybrid automaton satisfies a temporal-logic requirement. 1 Introduction A hybrid system typically consists of a collection of digital programs that interact with each other and with an analog environment. Examples of hybrid systems include manufacturing controllers, automotive and flight

Abstract interpretation and application to logic programs

by Patrick Cousot, Radhia Cousot , 1992
"... Abstract interpretation is a theory of semantics approximation which is usedfor the construction of semantics-basedprogram analysis algorithms (sometimes called“data flow analysis”), the comparison of formal semantics (e.g., construction of a denotational semantics from an operational one), the des ..."
Abstract - Cited by 317 (14 self) - Add to MetaCart
), the design of proof methods, etc. Automatic program analysers are used for determining statically conservative approximations of dynamic properties of programs. Such properties of the run-time behavior of programs are useful for debugging (e.g., type inference), code optimization (e.g., compile-time garbage

Adapting Golog for composition of semantic web Services

by Sheila Mcilraith , 2002
"... Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to building agent technology based on the notion of generic procedures and customizing user constraint. We argue that an augmented version of the logi ..."
Abstract - Cited by 381 (17 self) - Add to MetaCart
of the logic programming language Golog provides a natural formalism for automatically composing services on the Semantic Web. To this end, we adapt and extend the Golog language to enable programs that are generic, customizable and usable in the context of the Web. Further, we propose logical criteria

Retiming Synchronous Circuitry

by Charles E. Leiserson, James B. Saxe - ALGORITHMICA , 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract - Cited by 376 (3 self) - Add to MetaCart
circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph in which the vertex set Visa collection of combinational logic elements and the edge set E is the set of interconnections, each of which may pass through zero or more registers. We give an 0(|V

Specification Matching of Software Components

by Amy Moormann Zaremski, Jeannette M. Wing - ACM Transactions on Software Engineering and Methodology , 1996
"... Specification matching is a way to compare two software components based on descriptions of the components' behaviors. In the context of software reuse and library retrieval, it can help determine whether one component can be substituted for another or how one can be modified to fit the requ ..."
Abstract - Cited by 358 (4 self) - Add to MetaCart
the requirements of the other. In the context of object-oriented programming, it can help determine when one type is a behavioral subtype of another. We use formal specifications to describe the behavior of software components, and hence, to determine whether two components match. We give precise definitions

Domain Theory in Logical Form

by Samson Abramsky - Annals of Pure and Applied Logic , 1991
"... The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and system ..."
Abstract - Cited by 249 (8 self) - Add to MetaCart
and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic
Next 10 →
Results 1 - 10 of 1,431
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University