We describe a proof dedicated meta-language, called L tac , in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local automations. L tac , is essentia...
We describe a proof dedicated meta-language, called
L
tac , in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local automations.
L
tac , is essentially a small functional core with recursors and powerful pattern-matching operators for Coq terms but also for proof contexts. As
L
tac , is not complete, we describe an interface between
L
tac , and the full programmable meta-language of the system (Objective CAML), which is also the implementation language. This interface is based on a quotation system where we can use
L
tac ,'s syntax in ML files, and where it is possible to insert ML code in
L
tac , scripts by means of antiquotations. In that way, the two meta-languages are not opposed and we give an example where they fairly cooperate. Thus, this shows that a LCF-like system with a two-level meta-language is completely realistic.
We present a logicprogramming parsing methodology which we believe especially interesting for understanding implicit human-language structures. It records parsing state constituents through linear assumptions to be c...
详细信息
We show how two novel tools in logicprogramming for AI (namely, continuation-based linear and timeless assumptions, and Datalog grammars) can assist us in producing terse treatments of difficult language processing p...
详细信息
We show how two novel tools in logicprogramming for AI (namely, continuation-based linear and timeless assumptions, and Datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for Datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words) that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.
The GOLD Definition Language (GDL) is an Object Oriented (OO) formal specification language for the modeling of multidimensional databases. The OO multidimensional data model called GOLD is based on the OO paradigm, w...
详细信息
We show how several novel tools in logicprogramming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processi...
详细信息
We show how several novel tools in logicprogramming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words), that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.
LogiMOO is a BinProlog-based Virtual World running under Netscape or Internet Explorer. It is user extensible and supports distributed group-work over the Internet. Virtual places, virtual objects and agents are progr...
详细信息
ISBN:
(纸本)0897919262
LogiMOO is a BinProlog-based Virtual World running under Netscape or Internet Explorer. It is user extensible and supports distributed group-work over the Internet. Virtual places, virtual objects and agents are programmable through a "controlled English" interface.
We examine some natural language uses of a new type of logic grammars called Assumption Grammars, particularly suitable for hypothetical reasoning. They are based on intuitionistic and linear implications scoped over ...
详细信息
We examine some natural language uses of a new type of logic grammars called Assumption Grammars, particularly suitable for hypothetical reasoning. They are based on intuitionistic and linear implications scoped over the current continuation, which allow us to follow given branches of the computation under hypotheses that disappear when and if backtracking takes place. We show how Assumption Grammars can simplify the treatment of some crucial computational linguistics problems, e.g. long distance dependencies, while simultaneously facilitating more readable grammars.
Lack of machine intelligibility in human/computer interactions can be traced to present approaches in software design. From the duality principle, software involved in human/computer software interaction contains two ...
详细信息
Lack of machine intelligibility in human/computer interactions can be traced to present approaches in software design. From the duality principle, software involved in human/computer software interaction contains two distinct layers, a declarative knowledge-level layer and a lower-level functional or procedural-knowledge layer. The former supports simple deductive and inductive inferences and can be used to facilitate human-comprehensible communication between programs, while the latter is composed of normal procedurally encoded computer programs. The duality principle in software design is necessary in dealing with the demands of wide-scale computer usage in the information age and an urgent goal for computer science research.
Continuation passing binarization and specialization of the WAM to binary logic programs have been proven practical implementation techniques in the BinProlog system. In this paper we investigate the additional benefi...
详细信息
暂无评论