Relevant bibliographies by topics / Higher-order logic

Academic literature on the topic 'Higher-order logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 31 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Higher-order logic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Higher-order logic"

1

Bruce, Kim, Johan van Benthem, and Kees Doets. "Higher-order Logic." Journal of Symbolic Logic 54, no. 3 (September 1989): 1090. http://dx.doi.org/10.2307/2274769.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Forster, Thomas. "A Consistent Higher-Order Theory Without a (Higher-Order) Model." Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 35, no. 5 (1989): 385–86. http://dx.doi.org/10.1002/malq.19890350502.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Andrews, James H. "An untyped higher order logic with Y combinator." Journal of Symbolic Logic 72, no. 4 (December 2007): 1385–404. http://dx.doi.org/10.2178/jsl/1203350794.

Full text
Abstract:
AbstractWe define a higher order logic which has only a notion of sort rather than a notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory, a proof system which is sound with respect to the model theory, and a cut-elimination proof for the proof system. We also give examples showing what formulas can and cannot be used in the logic.
APA, Harvard, Vancouver, ISO, and other styles
4

Audenaert, Pieter. "The Higher-Order-Logic Formath." Bulletin of the Belgian Mathematical Society - Simon Stevin 15, no. 2 (May 2008): 335–67. http://dx.doi.org/10.36045/bbms/1210254829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Czajka, Łukasz. "Higher-Order Illative Combinatory Logic." Journal of Symbolic Logic 78, no. 3 (September 2013): 837–72. http://dx.doi.org/10.2178/jsl.7803080.

Full text
Abstract:
AbstractWe show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.
APA, Harvard, Vancouver, ISO, and other styles
6

Charalambidis, Angelos, Konstantinos Handjopoulos, Panagiotis Rondogiannis, and William W. Wadge. "Extensional Higher-Order Logic Programming." ACM Transactions on Computational Logic 14, no. 3 (August 2013): 1–40. http://dx.doi.org/10.1145/2499937.2499942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cropper, Andrew, Rolf Morel, and Stephen Muggleton. "Learning higher-order logic programs." Machine Learning 109, no. 7 (December 3, 2019): 1289–322. http://dx.doi.org/10.1007/s10994-019-05862-7.

Full text
Abstract:
AbstractA key feature of inductive logic programming is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher-order programs by allowing for higher-order definitions to be used as background knowledge. Our theoretical results show that learning higher-order programs, rather than first-order programs, can reduce the textual complexity required to express programs, which in turn reduces the size of the hypothesis space and sample complexity. We implement our idea in two new MIL systems: the Prolog system $$\text {Metagol}_{ho}$$ Metagol ho and the ASP system $$\text {HEXMIL}_{ho}$$ HEXMIL ho . Both systems support learning higher-order programs and higher-order predicate invention, such as inventing functions for and conditions for . We conduct experiments on four domains (robot strategies, chess playing, list transformations, and string decryption) that compare learning first-order and higher-order programs. Our experimental results support our theoretical claims and show that, compared to learning first-order programs, learning higher-order programs can significantly improve predictive accuracies and reduce learning times.
APA, Harvard, Vancouver, ISO, and other styles
8

Hetzl, Stefan, Alexander Leitsch, and Daniel Weller. "CERES in higher-order logic." Annals of Pure and Applied Logic 162, no. 12 (December 2011): 1001–34. http://dx.doi.org/10.1016/j.apal.2011.06.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Awodey, S., and C. Butz. "Topological completeness for higher-order logic." Journal of Symbolic Logic 65, no. 3 (September 2000): 1168–82. http://dx.doi.org/10.2307/2586693.

Full text
Abstract:
AbstractUsing recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces—so-called “topological semantics”. The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.
APA, Harvard, Vancouver, ISO, and other styles
10

Simons, Peter. "Who's Afraid of Higher-Order Logic?" Grazer Philosophische Studien 44 (1993): 253–64. http://dx.doi.org/10.5840/gps19934443.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Higher-order logic"

1

Krishnaswami, Neelakantan R. "Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/164.

Full text
Abstract:
In this thesis I show is that it is possible to give modular correctness proofs of interesting higher-order imperative programs using higher-order separation logic. To do this, I develop a model higher-order imperative programming language, and develop a program logic for it. I demonstrate the power of my program logic by verifying a series of examples. This includes both realistic patterns of higher-order imperative programming such as the subject-observer pattern, as well as examples demonstrating the use of higher-order logic to reason modularly about highly aliased data structures such as the union-find disjoint set algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Nesi, Monica. "Formalising process calculi in higher order logic." Thesis, University of Cambridge, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Camilleri, Albert John. "Executing behavioural definitions in Higher Order Logic." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.232795.

Full text
Abstract:
Over the past few years, computer scientists have been using formal verification techniques to show the correctness of digital systems. The verification process, however, is complicated and expensive. Even proofs of simple circuits can involve thousands of logical steps. Often it can be extremely difficult to find correct device specifications and it is desirable that one sets off to prove a correct specification from the start, rather than repeatedly backtrack from the verification process to modify the original definitions after discovering they were incorrect or inaccurate. The main idea presented in the thesis is to amalgamate the techniques of simulation and verification, rather than have the latter replace the former. The result is that behavioural definitions can be simulated until one is reasonably sure that the specification is correct. Furthermore, providing the correctness with respect to these simulated specifications avoids the inadequacies of simulation, where it may not be computationally feasible to demonstrate correctness by exhaustive testing. Simulation here has a different purpose: to get specifications correct as early as possible in the verification process. Its purpose is not to demonstrate the correctness of the implementation - this is done in the verification stage when the very same specifications that were simulated are proven correct. The thesis discusses the implementation of an executable subset of the HOL logic, the version of Higher Order Logic embedded in the HOL theorem prover. It is shown that hardware can be effectively described using both relations and functions; relations being suitable for abstract specification, and functions being suitable for execution. The differences between relational and functional specifications are discussed and illustrated by the verification of an n-bit adder. Techniques for executing functional specifications are presented and various optimisation stratagies are shown which make the execution of the logic efficient. It is further shown that the process of generating optimised functional definitions from relational definitions can be automated. Example simulations of three hardware devices (a factorial machine, a small computer and a communications chip) are presented.
APA, Harvard, Vancouver, ISO, and other styles
4

Sultana, Nikolai. "Higher-order proof translation." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/247345.

Full text
Abstract:
The case for interfacing logic tools together has been made countless times in the literature, but it is still an important research question. There are various logics and respective tools for carrying out formal developments, but practitioners still lament the difficulty of reliably exchanging mathematical data between tools. Writing proof-translation tools is hard. The problem has both a theoretical side (to ensure that the translation is adequate) and a practical side (to ensure that the translation is feasible and usable). Moreover, the source and target proof formats might be less documented than desired (or even necessary), and this adds a dash of reverse-engineering to what should be a system integration task. This dissertation studies proof translation for higher-order logic. We will look at the qualitative benefits of locating the translation close to the source (where the proof is generated), the target (where the proof is consumed), and in between (as an independent tool from the proof producer and consumer). Two ideas are proposed to alleviate the difficulty of building proof translation tools. The first is a proof translation framework that is structured as a compiler. Its target is specified as an abstract machine, which captures the essential features of its implementations. This framework is designed to be performant and extensible. Second, we study proof transformations that convert refutation proofs from a broad class of consistency-preserving calculi (such as those used by many proof-finding tools) into proofs in validity-preserving calculi (the kind used by many proof-checking tools). The basic method is very simple, and involves applying a single transformation uniformly to all of the source calculi's inferences, rather than applying ad hoc (rule specific) inference interpretations.
APA, Harvard, Vancouver, ISO, and other styles
5

Fritz, Peter. "Intensional type theory for higher-order contingentism." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd.

Full text
Abstract:
Things could have been different, but could it also have been different what things there are? It is natural to think so, since I could have failed to be born, and it is natural to think that I would then not have been anything. But what about entities like propositions, properties and relations? Had I not been anything, would there have been the property of being me? In this thesis, I formally develop and assess views according to which it is both contingent what individuals there are and contingent what propositions, properties and relations there are. I end up rejecting these views, and conclude that even if it is contingent what individuals there are, it is necessary what propositions, properties and relations there are. Call the view that it is contingent what individuals there are first-order contingentism, and the view that it is contingent what propositions, properties and relations there are higher-order contingentism. I bring together the three major contributions to the literature on higher-order contingentism, which have been developed largely independently of each other, by Kit Fine, Robert Stalnaker, and Timothy Williamson. I show that a version of Stalnaker's approach to higher-order contingentism was already explored in much more technical detail by Fine, and that it stands up well to the major challenges against higher-order contingentism posed by Williamson. I further show that once a mistake in Stalnaker's development is corrected, each of his models of contingently existing propositions corresponds to the propositional fragment of one of Fine's more general models of contingently existing propositions, properties and relations, and vice versa. I also show that Stalnaker's theory of contingently existing propositions is in tension with his own theory of counterfactuals, but not with one of the main competing theories, proposed by David Lewis. Finally, I connect higher-order contingentism to expressive power arguments against first-order contingentism. I argue that there are intelligible distinctions we draw with talk about "possible things", such as the claim that there are uncountably many possible stars. Since first-order contingentists hold that there are no possible stars apart from the actual stars, they face the challenge of paraphrasing such talk. I show that even in an infinitary higher-order modal logic, the claim that there are uncountably many possible stars can only be paraphrased if higher-order contingentism is false. I therefore conclude that even if first-order contingentism is true, higher-order contingentism is false.
APA, Harvard, Vancouver, ISO, and other styles
6

Haftmann, Florian. "Code generation from specifications in higher-order logic." kostenfrei, 2009. https://mediatum2.ub.tum.de/node?id=886023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Berghofer, Stefan. "Proofs, programs and executable specifications in higher order logic." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969627661.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Grellois, Charles. "Semantics of linear logic and higher-order model-checking." Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC024.

Full text
Abstract:
Dans cette thèse, nous envisageons des problèmes de model-checking d'ordre supérieur à l'aide d'approches issues de la sémantique et de la logique. Le model-checking d'ordre supérieur étudie la vérification de propriétés, exprimées en logique monadique du second ordre, sur des arbres infinis générés par une classe de systèmes de réécriture appelés schémas de récursion d'ordre supérieur. Ces systèmes sont équivalents au lambda-calcul simplement typé avec récursion, et peuvent donc être étudiés à l'aide d'outils sémantiques. Plus précisément, l'objet de cette thèse est de relier le model-checking d'ordre supérieur à une série de concepts de premier plan en sémantique contemporaine, tels que la logique linéaire et sa sémantique relationnelle, la logique linéaire indexée, les lois distributives entre comonades, les comonades paramétrées et la logique tensorielle. Nous verrons que ces concepts contribuent de façon particulièrement naturelle à l'étude du model-checking d'ordre supérieur. Notre approche débute par une étude du système de types intersection de Kobayashi et Ong, qui permet de typer un schéma de récursion d'ordre supérieur avec les états d'un automate donné encodant une formule de la logique monadique du second ordre. Le schéma admet pour type l'état initial de l'automate si et seulement si l'arbre infini qu'il représente satisfait la propriété encodée par l'automate. En dépit de cette adéquation, le système de types de Kobayashi et Ong a été pensé indépendamment de la connexion existant entre les types intersections et les modèles de la logique linéaire, relation observée par Bucciarelli, Ehrhard, de Carvalho et Terui. Nous avons donc cherché à relier ces deux domaines. Notre analyse nous a permis de définir un système de types intersection dérivé de celui de Kobayashi et Ong, capturant lui aussi le model-checking d'ordre supérieur de façon adéquate. Contrairement au système original, notre système est formulé de façon modale, et correspond à une sémantique finitaire de la logique linéaire obtenue en composant la modalité exponentielle usuelle avec une comonade colorant les formules. Nous équipons cette sémantique de la logique linéaire avec un opérateur de point fixe inductif-coinductif, et obtenons ainsi un modèle du lambda-calcul avec récursion dans lequel l'interprétation d'un schéma de récursion d'ordre supérieur est l'ensemble des états depuis lesquels l'arbre infini qu'il représente est accepté. La finitude de la sémantique nous permet de donner de nouvelles preuves de plusieurs résultats de décidabilité pour des problèmes de model-checking d'ordre supérieur, dont le problème de la sélection formulé récemment par Carayol et Serre. La sémantique finitaire que nous définissons est inspirée du théorème d'écrasement extensionnel d'Ehrhard, qui montre que l'écrasement extensionnel du modèle relationnel de la logique linéaire correspond à sa sémantique finitaire donnée par le modèle de Scott. Ce résultat nous permet de définir dans un premier temps la comonade de coloration et l'opérateur de point fixe inductif-coinductif dans une sémantique quantitative correspondant à une variante infinie (et non-continue) du modèle relationnel de la logique linéaire
This thesis studies problems of higher-order model-checking from a semantic and logical perspective. Higher-order model-checking is concerned with the verification of properties expressed in monadic second-order logic, specified over infinite trees generated by a class of rewriting systems called higher-order recursion schemes. These systems are equivalent to lambda-terms with recursion, and can therefore be studied using semantic methods. The more specific purpose of this thesis is to connect higher-order model-checking to a series of advanced ideas in contemporary semantics, such as linear logic and its relational semantics, indexed linear logic, distributive laws between comonads, parametric comonads and tensorial logic. As we will see, all these ingredients meet and combine surprisingly well with higher-order model-checking. The starting point of our approach is the study of the intersection type system of Kobayashi and Ong. This intersection type system enables one to type a higher-order recursion scheme with states of a given automaton, associated with a formula of monadic second-order logic. The recursion scheme is typable with the initial state of the automaton if and only if the infinite tree it represents satisfies the formula of interest. In spite of this soundness-and-completeness result, the original type system by Kobayashi and Ong was not designed with the connection between intersection types and models of linear logic observed by Bucciarelli, Ehrhard, de Carvalho and Terui in mind. Our work has thus been to connect these two fields. Our analysis leads us to the definition of an alternative intersection type system, which enjoys a similar soundness-and-completeness theorem with respect to higher-order model-checking. In contrast to the original type system by Kobayashi and Ong, our modal formulation is the proof-theoretic counterpart of a finitary semantics of linear logic, obtained by composing the traditional exponential modality with a coloring comonad. We equip the semantics of linear logic with an inductive-coinductive fixpoint operator. We obtain in this way a model of the lambda-calculus with recursion in which the interpretation of a higher-order recursion scheme is the set of states from which the infinite tree it represents is accepted. The finiteness of the semantics enables us to reestablish several results of decidability for higher-order model-checking problems, among which the selection problem recently formulated and proved by Carayol and Serre. This finitary semantics are inspired from the extensional collapse theorem of Ehrhard, who shows that the relational semantics of linear logic collapses extensionally to the finitary semantics provided by Scott lanices. For that reason, we start in a preliminary approach to define the coloring comonad and the inductive-coinductive fixpoint operator in the quantitative semantics provided by an infinitary (and non-continuous) version of the relational model of linear logic
APA, Harvard, Vancouver, ISO, and other styles
9

Bruse, Florian [Verfasser]. "Extremal fixpoints for higher-order modal logic / Florian Bruse." Kassel : Universitätsbibliothek Kassel, 2020. http://d-nb.info/1220854093/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Melham, Thomas Frederick. "Formalizing abstraction mechanisms for hardware verification in higher order logic." Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334206.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Higher-order logic"

1

Gopalan, Nadathur, ed. Programming with higher-order logic. Cambridge: Cambridge University Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Paulson, Lawrence C. The representation of logics in higher-order logic. Cambridge: University of Cambridge, Computer Laboratory, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Higher order logic and hardware verification. Cambridge: Cambridge University Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Camilleri, Albert. Hardware verification using higher-order logic. Cambridge: University of Cambridge, Computer Laboratory, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

J, Scott P., ed. Introduction to higher order categorical logic. Cambridge [Cambridgeshire]: Cambridge University Press, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lambek, J. Introduction to higher order catagorical logic. Cambridge: CUP, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Heering, Jan, Karl Meinke, Bernhard Möller, and Tobias Nipkow, eds. Higher-Order Algebra, Logic, and Term Rewriting. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58233-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dowek, Gilles, Jan Heering, Karl Meinke, and Bernhard Möller, eds. Higher-Order Algebra, Logic, and Term Rewriting. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61254-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Solving higher-order equations: From logic to programming. Boston: Birkhauser, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Joyce, Jeffrey. Proving a computer correct in higher order logic. Cambridge: University of Cambridge, Computer Laboratory, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Higher-order logic"

1

Falkenstein, Lorne, Scott Stapleford, and Molly Kao. "Higher-Order Logic." In Logic Works, 618–32. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781003026532-27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Back, Ralph-Johan, and Joakim Wright. "Higher-Order Logic." In Refinement Calculus, 57–67. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1674-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Van Benthem, Johan, and Kees Doets. "Higher-Order Logic." In Handbook of Philosophical Logic, 189–243. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9833-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bosch, Antal van den, Bernhard Hengst, John Lloyd, Risto Miikkulainen, Hendrik Blockeel, and Hendrik Blockeel. "Higher-Order Logic." In Encyclopedia of Machine Learning, 502–6. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-30164-8_365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lloyd, John. "Higher-Order Logic." In Encyclopedia of Machine Learning and Data Mining, 1–7. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4899-7502-7_126-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lloyd, John. "Higher-Order Logic." In Encyclopedia of Machine Learning and Data Mining, 619–24. Boston, MA: Springer US, 2017. http://dx.doi.org/10.1007/978-1-4899-7687-1_126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lloyd, John W. "Higher-Order Computational Logic." In Computational Logic: Logic Programming and Beyond, 105–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45628-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Antoy, Sergio, and Andrew Tolmach. "Typed Higher-Order Narrowing without Higher-Order Strategies." In Functional and Logic Programming, 335–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/10705424_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Qian, Zhenyu. "Higher-order order-sorted algebras." In Algebraic and Logic Programming, 86–100. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-53162-9_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Goertzel, Ben, Matthew Iklé, Izabela Freire Goertzel, and Ari Heljakka. "Higher-Order Extensional Inference." In Probabilistic Logic Networks, 1–37. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-76872-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Higher-order logic"

1

Charalambidis, Angelos, Panos Rondogiannis, and Antonis Troumpoukis. "Higher-order logic programming." In PPDP '16: 18th International Symposium on Principles and Practice of Declarative Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2967973.2968607.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Howe, Douglas J. "Higher-order abstract syntax in classical higher-order logic." In the Fourth International Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1577824.1577826.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Linna, and Wei Zhang. "Higher-Order Logic Recommender System." In 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. IEEE, 2008. http://dx.doi.org/10.1109/wiiat.2008.196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Qian, Zhenyu. "Higher-order equational logic programming." In the 21st ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/174675.177889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Haftmann, Florian. "From higher-order logic to Haskell." In the ACM SIGPLAN 2010 workshop. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1706356.1706385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mellies, Paul-Andre. "Higher-order parity automata." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kobayashi, Naoki, Étienne Lozes, and Florian Bruse. "On the relationship between higher-order recursion schemes and higher-order fixpoint logic." In POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3009837.3009854.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Might, Matthew. "Logic-flow analysis of higher-order programs." In the 34th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1190216.1190247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Purgał, Stanisław J., David M. Cerna, and Cezary Kaliszyk. "Learning Higher-Order Logic Programs From Failures." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/378.

Full text
Abstract:
Learning complex programs through inductive logic programming (ILP) remains a formidable challenge. Existing higher-order enabled ILP systems show improved accuracy and learning performance, though remain hampered by the limitations of the underlying learning mechanism. Experimental results show that our extension of the versatile Learning From Failures paradigm by higher-order definitions significantly improves learning performance without the burdensome human guidance required by existing systems. Our theoretical framework captures a class of higher-order definitions preserving soundness of existing subsumption-based pruning methods.
APA, Harvard, Vancouver, ISO, and other styles
10

Charguéraud, Arthur. "Higher-order representation predicates in separation logic." In CPP 2016: Certified Proofs and Programs. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2854065.2854068.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Higher-order logic"

1

Koopmann, Patrick. Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.242.

Full text
Abstract:
Especially in the field of stream reasoning, there is an increased interest in reasoning about temporal data in order to detect situations of interest or complex events. Ontologies have been proved a useful way to infer missing information from incomplete data, or simply to allow for a higher order vocabulary to be used in the event descriptions. Motivated by this, ontology-based temporal query answering has been proposed as a means for the recognition of situations and complex events. But often, the data to be processed do not only contain temporal information, but also probabilistic information, for example because of uncertain sensor measurements. While there has been a plethora of research on ontologybased temporal query answering, only little is known so far about querying temporal probabilistic data using ontologies. This work addresses this problem by introducing a temporal query language that extends a well-investigated temporal query language with probability operators, and investigating the complexity of answering queries using this query language together with ontologies formulated in the description logic EL.
APA, Harvard, Vancouver, ISO, and other styles
2

Archer, Myla M., Ben L. DiVito, and Cesar Munoz. Proceedings STRATA 2003. First International Workshop on Design and Application of Strategies/Tactics in Higher Order Logics; Focus on PVS Experiences. Fort Belvoir, VA: Defense Technical Information Center, November 2003. http://dx.doi.org/10.21236/ada418902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Higher-order logic' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography