This paper introduces Stochastic Definite Clause Grammars, a stochastic variant of the wellknown Definite Clause Grammars. The grammar formalism supports parameter learning from annotated or unannotated corpora and pr...
详细信息
This paper introduces Stochastic Definite Clause Grammars, a stochastic variant of the wellknown Definite Clause Grammars. The grammar formalism supports parameter learning from annotated or unannotated corpora and provides a mechanism for parse selection by means of statistical inference. Unlike probabilistic contextfree grammars, it is a context-sensitive grammar formalism and it has the ability to model cross-serial dependencies in natural language. SDCG also provides some syntax extensions which makes it possible to write more compact grammars and makes it straight-forward to add lexicalization schemes to a grammar.
In this article we give an intensional version of first-order hybrid logic (which also can be viewed as a hybridized version of Fittings First-Order Intensional logic). We consider two different kinds of models-standa...
详细信息
In this article we give an intensional version of first-order hybrid logic (which also can be viewed as a hybridized version of Fittings First-Order Intensional logic). We consider two different kinds of models-standard models and generalized models. The standard models are the same as Fittings models for First-Order Intensional logic. As the name suggests, the generalized models are more general. We give a natural deduction system which is completete with respect to generalized models. The natural deduction system is not complete with respect to standard models, but we show how to extend it with a further rule such that completeness with respect to standard models is obtained.
In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is proof-theoretically well-behaved, in particular, it gives rise to a decision procedure for the ...
详细信息
作者：
Braüner, TorbenProgramming
Logic and Intelligent Systems Research Group Roskilde University DK-4000 Roskilde P.O. Box 260 Denmark
This is primarily a conceptual paper. The goal of the paper is to put into perspective the proof-theory of hybrid logic and in particular, try to give an answer to the following question: Why does the proof-theory of ...
详细信息
This is primarily a conceptual paper. The goal of the paper is to put into perspective the proof-theory of hybrid logic and in particular, try to give an answer to the following question: Why does the proof-theory of hybrid logic work so well compared to the proof-theory of ordinary modal logic? Roughly, there are two different kinds of proof systems for modal logic: Systems where the formulas involved in the rules are formulas of the object language, that is, ordinary modal-logical formulas, and systems where the formulas involved in the rules are metalingustic formulas obtained by attaching labels representing possible worlds to ordinary modal-logical formulas. Systems of the second kind often also involve an explicit representation of the accessibility relation. From a proof-theoretic point of view, modal-logical systems of the first kind are less well-behaved than systems of the second kind. It turns out that this can be remedied by hybridization, that is, hybridization of modal logics enables the formulation of well-behaved proof systems without involving metalinguistic machinery. What has happened is that the metalinguistic machinery has been internalized in the object language. This gives an answer to the initial question, which is that the proof-theory of hybrid logic works so well because the metalinguistic semantic machinery has been internalized in the object language.
Theories of specification are built on assumptions on the processes of development. Theories which allow for specifications from different viewpoints raise the problem of nontrivial concepts of conformance, compliance...
详细信息
ISBN:
(纸本)1402049323
Theories of specification are built on assumptions on the processes of development. Theories which allow for specifications from different viewpoints raise the problem of nontrivial concepts of conformance, compliance and consistency. We propose a general conceptual model for these concepts, which applies to situations with multiple specifications prescribing requirements of different nature.
Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. However, designing of a domain...
详细信息
Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. However, designing of a domain specific language is a difficult task. The design of a domain specific language will evolve as it is used more and more and experienced is gained by its designers. Being able to rapidly develop the implementation infrastructure (interpreter, compiler, debugger, profiler, etc.) of a domain specific language is thus of utmost importance so that as the language evolves, the implementation infrastructure can keep pace. In this paper we present a framework for automatically generating interpreters, compilers, debuggers, and profilers from semantic specification of a domain specific language. We illustrate our approach via the SCR language, a language used by the US defense department for developing control systems. Copyright 2005 ACM.
作者：
Gupta, GopalPontelli, EnricoApplied Logic
Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic
Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States
Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logi...
详细信息
Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]. Machine functions describe the operation of a ...
详细信息
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.
暂无评论