532 Hits in 2.0 sec

Metalogical control for logic programs

Thomas Vasak, John Potter
1985 The Journal of Logic Programming  
a D An alternative computational "model" for logic programs is proposed which is based upon control annotations written in first-order predicate calculus.  ...  The major advantage of such a model is that it is possible to write conceptually transparent programs which otherwise would not have terminated under an existing naive control mechanism. a  ...  FIGURE 2 . 2 Metalogical control for logic programs.  ... 
doi:10.1016/0743-1066(85)90019-6 fatcat:l5ut3j2re5hcterefst2tu4jey

Page 141 of Journal of Research and Practice in Information Technology Vol. 18, Issue 3 [page]

1986 Journal of Research and Practice in Information Technology  
The aims of CML are essentially the same as those of METALOG in that it seeks to provide a metalogical level of control for logic programs.  ...  In METALOG, control infor- mation, specified in another logic program, is viewed as meta-knowledge.  ... 

Page 7114 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
The aim of the paper is to provide foundations for amalgamated metalogic programming, a style of logic programming which uses a collection of computation theories that interact with one an- other by querying  ...  The paper presents a simple programming language for rewriting (hyper) graphs in a controlled manner.  ... 

On the declarative and procedural semantics of definite metalogic programs

C. Higgins
1996 Journal of Logic and Computation  
The declarative semantics is an extension of the semantics of logic programs dealing with multiple theories and names.  ...  We define the class of definite metalogic programs, based on a definite clause language, a binary demonstration predicate, and a naming scheme with both primitive and structured names.  ...  I would like to thank Rodney Topor for his comments on earlier drafts of this paper.  ... 
doi:10.1093/logcom/6.3.363 fatcat:ljdadznheza37ergsxjxeoyd2y

Towards a Rational Approach for the Logical Modelling of Inhibition in Metabolic Networks

Oliver Ray
2009 2009 International Conference on Advanced Information Networking and Applications Workshops  
Underlying this work is use of nonmonotonic logic programs to represent and reason about competing inhibitory effects on the net concentrations of metabolites in enzyme-catalysed biochemical networks.  ...  This paper makes two contributions towards the logical modelling of inhibition in metabolic networks. First it exposes the logical inconsistency of an existing state-of-the-art metabolic theory.  ...  This is facilitated by the fact that both the published and actual Metalog theories are stratified logic programs; with no recursion through negation.  ... 
doi:10.1109/waina.2009.186 dblp:conf/aina/Ray09 fatcat:kiq4mgluw5cifiyz4xhfochfdu

Page 3210 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
It is necessary to deal ex- plicitly with the control flow of such programs.  ...  Our final result justifies metalogical rea- soning: if the denotations of two @ programs are equal in # then the @ programs are in fact operationally equivalent.”  ... 

Page 3 of Journal of Research and Practice in Information Technology Vol. 15, Issue 1 [page]

1983 Journal of Research and Practice in Information Technology  
The spectrum described there was found to be appro- priate for controlling data base usage in a substantial data base design project.  ...  As we have said, the high level user may use logic as a powerful programming language to construct his queries. See Warren (1981) for examples.  ... 

Towards Concise, Machine-discovered Proofs of Gödel's Two Incompleteness Theorems [article]

Elijah Malaby, Bradley Dragun, John Licato
2020 arXiv   pre-print
To demonstrate MATR's utility, we then describe a formalized metalogic suitable for proofs of G\"odel's Incompleteness Theorems, and report on our progress using our metalogic in MATR to semi-autonomously  ...  To facilitate this research, we present MATR, a new framework for automated theorem proving explicitly designed to easily adapt to unusual logics or integrate new reasoning processes.  ...  In order to simplify the proof space, we employ four types of resolution codelets; two for the metalogic, and two for first-order logic.  ... 
arXiv:2005.02576v1 fatcat:rbtyztda5ndblg5q7fowoipzlu

Querying Class-Relationship Logic in a Metalogic Framework [chapter]

Jørgen Fischer Nilsson
2011 Lecture Notes in Computer Science  
We introduce a class relationship logic for stating various forms of logical relationships between classes. This logic is intended for ontologies and knowledge bases and combinations thereof.  ...  Reasoning and querying is conducted in the Datalog logical language, which serves as an embracing decidable and tractable metalogic.  ...  I would like to thank Hans Bruun, Jacobo Rouces, and Jørgen Villadsen for helpful comments.  ... 
doi:10.1007/978-3-642-24764-4_9 fatcat:qs2ruywjovhild6czyuiifj3uq

CMU Computer science—a 25th anniversary commemorative

Friedrich L. Bauer
1992 Science of Computer Programming  
Control 2 (5) (1971) 45-50. [3] R.A. Kowalski, Predicate Logic as Programming Language, in: J.L. Rosenfeld, ed., Information Processing 74 (North-Holland, Amsterdam, 1974).  ...  The authors write a pure interpreter for pure Prolog that is not all that pure well and again we see some good Prolog programs.Just as good literature is good for authors; good programs are good for programmers  ...  All of that could be used for an interesting argument about politics as seen from a logical base, but here I want to discuss it with respect to evaluation of people.  ... 
doi:10.1016/0167-6423(92)90023-5 fatcat:4zsrurttlbbhjivmvuizzuafnq

Program Development Schemata as Derived Rules

Penny Anderson, David Basin
2000 Journal of symbolic computation  
Practically, our formalization yields a simple methodology for carrying out development using existing logical frameworks; we illustrate this in the domain of logic program synthesis and transformation  ...  We show how the formalization and application of schemata for program development can be reduced to the formalization and application of derived rules of inference.  ...  We propose the use of logical frameworks based on formal metalogics for this task.  ... 
doi:10.1006/jsco.1999.0346 fatcat:5ib6yzqnenf7dc6a2iijqmdwje

Multimodal Separation Logic for Reasoning About Operational Semantics

Robert Dockins, Andrew W. Appel, Aquinas Hobor
2008 Electronical Notes in Theoretical Computer Science  
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic.  ...  The result is a powerful and elegant system for reasoning about programming languages and their semantics. The techniques are quite general and can be adopted to a wide variety of settings.  ...  The control continuations κ are "control stacks," abstract representations of the program stack of an ordinary C program.  ... 
doi:10.1016/j.entcs.2008.10.002 fatcat:vi5buoqlavcojmj3kp6toxq3vu

Metalogic, Qualia, and Identity on Neptune's Great Moon: Meaning and Mathematics in the Works of Joseph A. Goguen and Samuel R. Delany [chapter]

D. Fox Harrell
2006 Lecture Notes in Computer Science  
This essay attempts to draw out some of the parallels between the works of these two authors, in particular regarding metalogic, qualia, and identity, using illustrative examples from the works of both  ...  I thank Delany for forging a trail in the combination of fantasy and sociology that is my passion.  ...  When I was seeking a Ph.D. program, his algebraic semiotics inspired me to cross the United States of America, to move back to the city where I was raised, to work with him on combining twin streams of  ... 
doi:10.1007/11780274_3 fatcat:ivoeo4ia2ndv7ih3pbayl2uji4

Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes [chapter]

Andreas Hamfelt, Jørgen Fischer Nilsson
1999 Lecture Notes in Computer Science  
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic programs from examples.  ...  Keywords: logic program schemata, logical combinators, synthesis by composition and specialization of schemas, inductive synthesis, metalogic program environment. P. Flener (Ed.): LOPSTR'98  ...  For simplicity's sake the search control is abstracted in the below program outline.  ... 
doi:10.1007/3-540-48958-4_8 fatcat:ndvfpzjkb5gkxgzeujadumtr34

Generic system support for deductive program development [chapter]

Abdelwaheb Ayari, David A. Basin
1996 Lecture Notes in Computer Science  
Within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development that can simulate those of the deductive tableau proposed by Manna and  ...  We report on a case study in using logical frameworks to support the formalization of programming calculi and their application to deduction-based program synthesis.  ...  Resolution, controlled by the interactive or tactic (these are programs which construct proofs) guided application of proof rules, gives us a means not only to verify programs, but also to interactively  ... 
doi:10.1007/3-540-61042-1_52 fatcat:c7xvlbxl6zfybgt2rutkwuedg4
« Previous Showing results 1 — 15 out of 532 results