A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
On Filter Logics for 'Most' and Special Predicates *
unpublished
Preserved Fulltext
Filter logic is intended to address (some versions) of 'most'. We show that filter logic can be faithfully embedded into a first-order theory of compatible predicates. ...
We also use representative predicates to eliminate the generalized quantifier. ...
As special predicates enable using any available classical proof methods, we expect to have paved the way for theorem proving in FL for 'most'. ...
fatcat:rgdjvprqcbe5fbkqe2pxbe6vaq
Logical composition of object-oriented interfaces
1987
Conference proceedings on Object-oriented programming systems, languages and applications - OOPSLA '87
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A filter is a package of constraints and associated typed objects that express the relationship of data and representation objects. Conceptually our system is completely based on constraints. ...
In our user interface management systern we use logic and filters to declaratively specify and control a space of ways that objects may be composed to create interfaces. ...
The logic part of our system views these interface components as special evaluable predicates that are implemented as independent processes. ...
doi:10.1145/38765.38834
dblp:conf/oopsla/GrossmanE87
fatcat:p5yloibi3vabfk3fq55pxpbh7i
Compiling Control as Offline Partial Deduction
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a new approach to a technique known as compiling control, whose aim is to compile away special mechanisms for non-standard atom selection in logic programs. ...
However, the exact nature of such an interpreter and of the required technique for specialization were never specified. ...
The arguments of other filters can be left dynamic: some values will be known at specialization time, but if the calls to an annotated predicate are never used as the root of a derivation tree (and they ...
arXiv:1808.05360v2
fatcat:b7mti2omrvae5cddsffemqszyi
Extensible logic program schemata
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In addition to Prolog's support of predicate variables and -terms, the most notable difference between the syntax of the Prolog and Prolog is that Prolog uses a curried notation. ...
One of the shortcomings of schema-based transformation approaches is their reliance on a large (possibly incomplete) set of logic program schemata that is required in order to capture all of the minor ...
-terms are used in Prolog to represent predicate application and anonymous predicates. Predicate application is denoted in Prolog by juxtaposition. ...
doi:10.1007/3-540-62718-9_15
fatcat:okzjnx44zbanfiveujhldkej2i
On classes of program schemata
1971
12th Annual Symposium on Switching and Automata Theory (swat 1971)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Program schemata and programming techniques provide a mechanism for representing the essential characteristics of logic programs. ...
Prolog is a higher-order logic programming language that extends Prolog by incorporating higher-order unification and -terms, making it an ideal logic programming language for representing logic program ...
Another common higher-order predicate is filter/3. The predicate filter/3 takes a unary predicate and a list and filters out all elements from the list that do not satisfy the predicate. ...
doi:10.1109/swat.1971.19
dblp:conf/focs/ConstableG71
fatcat:33uojq5mhvc2ze2fshvpzefzuu
Forward chaining in HALO: An implementation strategy for history-based logic pointcuts
2009
Computer languages, systems & structures
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a logic-based pointcut language that allows interaction with the base program as well as pointcuts over a history of join points. ...
While some pointcut languages only allow conditions on the current execution event, more recent proposals have demonstrated the need for expressing conditions over a history of join points. ...
Several pointcut languages are also based on logic programming. In that approach, join points are represented as logic facts and pointcuts as logic queries over these facts. ...
doi:10.1016/j.cl.2008.06.002
fatcat:mfvytgd64ne5rj7hjxhds2spu4
Forward chaining in HALO
2007
Proceedings of the 2007 international conference on Dynamic languages in conjunction with the 15th International Smalltalk Joint Conference 2007 - ICDL '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a logic-based pointcut language that allows interaction with the base program as well as pointcuts over a history of join points. ...
While some pointcut languages only allow conditions on the current execution event, more recent proposals have demonstrated the need for expressing conditions over a history of join points. ...
Several pointcut languages are also based on logic programming. In that approach, join points are represented as logic facts and pointcuts as logic queries over these facts. ...
doi:10.1145/1352678.1352689
dblp:conf/smalltalk/HerzeelGCRD07
fatcat:54huo7ncnbfxxmbsxn2wunnihq
An application of abstract interpretation in source level program transformation
[chapter]
1989
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Also, a first description of the use of abstract interpretation in program transformation -more particularly in program specialization is presented by J.Gallagher and M.Codish [16]. ...
Gener~ reformulations have been presented by C.S.Mellish [22], N.D.Jones and H.Sondergaard [20],T.Kanamari and T.Kawamura [21] and M.Bruynooghe [6], applications in code optimization for logic programs ...
As for most applications, representing the abstraction can be performed in many different ways. ...
doi:10.1007/3-540-50820-1_39
fatcat:v3bwjopefzgmnggf6mtax3owuu
Enhancing Visual Analysis of Network Traffic Using a Knowledge Representation
2006
2006 IEEE Symposium On Visual Analytics And Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we will present a traffic analysis system that couples visual analysis with a declarative knowledge representation based on first order logic. ...
We will show how the knowledge base can be used to improve both the visual representations and the basic analytical tasks of filtering and changing level of detail. ...
This Center is supported by the National Visualization and Analytics Center (NVAC(tm)), a U.S. ...
doi:10.1109/vast.2006.261436
dblp:conf/ieeevast/XiaoGH06
fatcat:c5xiawyjvvgl3lirkwi3fkekom
Track-Person Association Using a First-Order Probabilistic Model
2012
2012 IEEE 24th International Conference on Tools with Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a probabilistic model, based on Markov Logic Networks, that aims at associating the individual tracks emerging from a person tracking algorithm to the correct persons. ...
We discuss the engineered model in detail and give an empirical evaluation using an indoor setting. ...
Usually functions are simulated by specially marked predicates, which enforce a functional dependency of one or more arguments on the remaining arguments. ...
doi:10.1109/ictai.2012.118
dblp:conf/ictai/GeierBRD12
fatcat:7abxuowwube3dhs2j4cykr7dya
A Portable and Efficient Implementation of Coinductive Logic Programming
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We describe the portable and efficient implementation of coinductive logic programming found in Logtalk, discussing its features and limitations. ...
As Logtalk uses as a back-end compiler a compatible Prolog system, we also discuss the status of key Prolog features for an efficient and usable implementation of coinduction. ...
We also thank Jan Wielemaker and Vitor Santos Costa for feedback on using destructive assignment primitives for representing coinduction stacks and on representing and printing rational terms. ...
doi:10.1007/978-3-642-45284-0_6
fatcat:4sf7ue274bfkrgkplwfyqdsrby
EVA: A Symbolic Approach to Accelerating Exploratory Video Analytics with Materialized Views
2022
Proceedings of the 2022 International Conference on Management of Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We demonstrate that the reuse algorithm in EVA complements the specialized filters adopted in SOTA VDBMSs. ...
First, it focuses on reusing the results of UDFs as opposed to those of sub-plans. Second, it takes a symbolic approach to analyze predicates and identify the degree of overlap between queries. ...
We thank colleagues in Georgia Tech Database Group and Embedded Pervasive Lab for their constructive feedback in improving the system. ...
doi:10.1145/3514221.3526142
fatcat:ac32ayjgenaktl4e3j7pzxzgve
Aspect-Oriented Programming in Higher-Order and Linear Logic
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause Prolog provide richer abstraction and control mechanisms. ...
Definite clauses that pertain to a common aspect, and which crosscut other program components, can be encapsulated using the connectives of higher-order intuitionistic logic. ...
Acknowledgments The author wishes to acknowledge Dale Miller for valuable advice and discussion. ...
doi:10.1007/978-3-540-69611-7_20
fatcat:qmm4i7o6n5gybfg65zkzy3yhce
Deductive parsing with multiple levels of representation
1988
Proceedings of the 26th annual meeting on Association for Computational Linguistics -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
PAD2 uses an inference control strategy based on the "freeze" predicate of Prolog-II, while PAD3 -5 utilize the Unfold-Fold transformation to transform the original axiomatization into a form that functions ...
This paper discusses a sequence of deductive parsers, called PAD1 -PAD5, that utilize an axiomatization of the principles and parameters of GB theory, including a restricted transformational component ...
Fourth, one might attempt to develop specialized logical languages that are capabale of expressing knowledge of languages and knowledge of utterances in a more succinct and computationally useful fashion ...
doi:10.3115/982023.982053
dblp:conf/acl/Johnson88
fatcat:acyb77z6cbhxjcps6cro5wdkki
Algebra-Based Optimization of XML-Extended OLAP Queries
2006
International Conference on Management of Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce the novel query optimization techniques specialized for the federation system including a query optimizer and plan transformation rules. ...
In today's OLAP systems, integrating fast changing data physically into a cube is complex and time-consuming. ...
Acknowledgements This work was supported by the Danish Research Council for Technology and Production Sciences under grant no. 26-02-0277. ...
dblp:conf/comad/YinP06
fatcat:64dkcrqbfre5nj3c7nce6opapu
« Previous
Showing results 1 — 15 out of 29,891 results