A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
A semantics for weakly encapsulated search in functional logic programs
2013
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP '13
Preserved Fulltext
Encapsulated search is a key feature of (functional) logic languages. It allows the programmer to access and process different results of a non-deterministic computation within a program. ...
The semantics is also the basis of a practical implementation of search operators in the functional logic language Curry. ...
The authors are grateful to the anonymous referees for helpful comments and suggestions to improve the paper. ...
doi:10.1145/2505879.2505896
dblp:conf/ppdp/ChristiansenHRS13
fatcat:q6r4b5hmnzhspdsr3t46h47ntq
Page 4266 of Mathematical Reviews Vol. , Issue 95g
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “In this paper we introduce a semantics for general logic programs based on the notion of hypothesis much related to Geffner’s causal theories and Kakas and Mancarella’s weakly stable hypotheses ...
A has a lazy evaluation semantics and A programs can be evaluated in parallel. A also supports imperative programming in terms of assignments. ...
Context-Dependent Semantic Parsing for Temporal Relation Extraction
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
In this work, we propose SMARTER, a neural semantic parser, to extract temporal information in text effectively. ...
In the training phase, dynamic programming on denotations (DPD) technique is used to provide weak supervision on logical forms. ...
Search for Logical Forms In order to create a logical form training set for the weakly supervised training data, we have to search for correct logical forms that produce correct answers exhaustively. ...
arXiv:2112.00894v1
fatcat:6blsi6mduzeqpc5kbj7w4q4ice
Reference Type Logic Variables in Constraint-Logic Object-Oriented Programming
[chapter]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1808.08185v1 fatcat:ydyua6atzrb6vk2oeortg6u56mOther Versions
The present work contributes a concept for reference type logic variables in constraint-logic object-oriented programming that takes arbitrary class hierarchies of programs written in object-oriented languages ...
Constraint-logic object-oriented programming, for example using Muli, facilitates the integrated development of business software that occasionally involves finding solutions to constraint-logic problems ...
For example, the constraint-logic object-oriented programming language Muli augments Java with logic variables, symbolic execution, constraints, and encapsulated search using a customised symbolic Java ...
doi:10.1007/978-3-030-16202-3_8
fatcat:sfsvbh7gujcibky2cll3wqp3sm
Toward Code Generation: A Survey and Lessons from Semantic Parsing
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
We then analyze advancements in frameworks for semantic parsing for code generation. In closing, we present what we believe are some of the emerging open challenges in this domain. ...
With the growth of natural language processing techniques and demand for improved software engineering efficiency, there is an emerging interest in translating intention from human languages to programming ...
To generate these outputs, semantic parsing pipelines usually trained by some learning algorithm to produce a distribution over the output search space and then search for a best scoring logical form in ...
arXiv:2105.03317v1
fatcat:34zbwwxrfbhuth7pk2vquq6vaq
Massive parallelism for query answering in weakly integrated P2P systems
2004
Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.
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 2005; you can also visit the original URL.
The file type is application/pdf.
We present the basic elements of a new weakly-coupled semantics that correctly captures the modular structure of a data-intensive P2P system, and opens up the possibility of effective query answering techniques ...
One of the basic characteristics of peers in our approach is that they are based on Abstract Data Types which encapsulate a data integration system in order to deal with incomplete Web-based information ...
Weakly-integrated P2P system Ontologies play a prominent role on the Semantic Web. ...
doi:10.1109/dexa.2004.1333528
dblp:conf/dexaw/Majkic04
fatcat:eam5kdk6u5crrm7i6sdywmub34
Fully abstract compositional semantics for an algebra of logic programs
1995
Theoretical 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.
A simple extension of logic programming consists of introducing a set of basic program composition operations, which form an algebra of logic programs with interesting properties for reasoning about programs ...
The T(P) semantics is then related to other well known semantics for logic programs which induce coarser equivalence relations. ...
Acknowledgements We would like to thank the anonymous referees for their pertinent comments and suggestions. This work has been partly supported by the Esprit BRA 6810 Compulog 2 ...
doi:10.1016/0304-3975(95)00012-l
fatcat:atpleqwaobe4th4vz52kwlwifm
Intensional Semantics for P2P Data Integration
[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.
We present a novel proposal, based on intensional logic, and show that it adequately models this weakly-coupled framework and supports decidable query answering. ...
The traditional extensional semantics for mappings between peers destroys such epistemic independence of peers: the beliefs of other peers (also when change dynamically) are locally introduced into a given ...
Intensional equivalence Tarski's elaboration of a semantics for formal languages, Kripke's invention of a possibleworld semantics in connection with modal logic and Montague's semantics for Intensional ...
doi:10.1007/11803034_3
fatcat:n3as5yqw5zbtvnchzt5ol6ayzq
Process Makna - A Semantic Wiki for Scientific Workflows
[article]
2010
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.
Our Process Makna Semantic Wiki system is a novel combination of an business process management system adapted for scientific workflows with a Corporate Semantic Web Wiki user interface supporting knowledge ...
Virtual e-Science infrastructures supporting Web-based scientific workflows are an example for knowledge-intensive collaborative and weakly-structured processes where the interaction with the human scientists ...
Initiative for the New German Laender -Unternehmen Region. ...
arXiv:1012.1643v1
fatcat:mcnecnrhk5dzfokbo3l6wwj6oe
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
2010
Electronic Proceedings in Theoretical 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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1008.2112v1 fatcat:bliohlki5ne47i3bwtkvglwtae
Finally, we also look at a semantics in terms of delay-free resumptions supplemented with a silent divergence option. ...
After first defining a basic semantics of statements in terms of resumptions with explicit internal actions (delays), we introduce a semantics in terms of delay-free resumptions that essentially removes ...
Acknowledgments We thank Andreas Lochbihler, Nils Anders Danielsson and Thorsten Altenkirch for discussions. ...
doi:10.4204/eptcs.32.5
fatcat:wb4zhglzlrgivej7tnnbs56a64
System compositions and shared dependencies
[chapter]
1996
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 2004; you can also visit the original URL.
The file type is application/pdf.
In my paper, Version Control in the Inscape Environment" 13 , I de ned a number of concepts to be used in reasoning about substituting one component for another. ...
In this paper, I discuss the problem of shared dependencies that is, substituting one of more interdependent components in a context, propose an approach for specifying such dependencies, and show h o ...
SVCE 8 provides programming-in-the-large again, syntactic interconnections facilities for both encapsulation and system composition. ...
doi:10.1007/bfb0023086
fatcat:4zcfvlgu5vewxeuod6gh2glq7i
Towards a Logic-Based Unifying Framework for Computing
[article]
2014
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 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2013 pre-print arXiv:1301.6905v1 fatcat:vrqh3k4idzfq3hh44wnitct7fq
In this paper we propose a logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications. ...
We also extend the model with intentional predicates and composite event predicates defined by logic programs containing conditions in first-order logic, which query the current state. ...
Many thanks also to David Kinny and Ken Satoh for helpful discussions, and to Ken Satoh and Luis Pereira for their comments on an earlier draft of this paper. ...
arXiv:1301.6905v2
fatcat:ff3obn7povf2bn5zkvy4wxzqvm
A Relatively Complete Calculus for Structured Heterogeneous Specifications
[chapter]
2014
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 2018; you can also visit the original URL.
The file type is application/pdf.
We develop a relatively complete calculus for structured heterogeneous specifications that does not need interpolation. ...
Proof calculi for structured specifications have been developed independently of the underlying logical system (formalised as institution). ...
Interpolation also fails in some typical logical systems used in specification formalisms, with interpretation of some types or concepts fixed semantically; for instance, interpolation fails for the logic ...
doi:10.1007/978-3-642-54830-7_29
fatcat:3lv3kuk2o5ci3pysqutngdywdi
A Framework for Teaching Programming on the Internet: A Web-Based Simulation Approach
2012
Journal of 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.
Problem statement: This research study describes the process of developing a web-based framework for simulating programming language activities on the Internet, in an interactive way, by enabling executable ...
programs to perform automatically their function. ...
In functional languages a variable may be linked to a value exactly once. In logical programming, variables may be re-linked to values at specific points (choice points) in the program. ...
doi:10.3844/jcssp.2012.410.419
fatcat:7foe5tuzmfehfbcjq2hm3fjfc4
The overall structure of the Web data Mining Repository
2015
ScienceRise
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.
This approach will allow a meaningful way to select a required datasets according to the given problem domain, as well as add new data sets using their meta descriptions У статті розглядається підхід многоагентних ...
Interface of program components provides encapsulation of implementation details of specific component from other components. ...
and recovery of RDF models; Making queries to the RDF model, using the circuit graph; A query RDF (SPARQL) with other operators in SQL; A logical conclusion based on RDFS (RDF schema) rules; The logical ...
doi:10.15587/2313-8416.2015.36747
fatcat:gzigkgjibrdzjfsjv3lhzrk6aq
« Previous
Showing results 1 — 15 out of 1,490 results