Sciweavers

2573 search results - page 271 / 515
» Combinations of Modal Logics
Sort
View
JAR
2007
129views more  JAR 2007»
15 years 6 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
Carsten Lutz, Maja Milicic
ENTCS
2002
125views more  ENTCS 2002»
15 years 6 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
EMNLP
2010
15 years 4 months ago
Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
Tom Kwiatkowksi, Luke S. Zettlemoyer, Sharon Goldw...
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 6 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
CAV
2009
Springer
182views Hardware» more  CAV 2009»
16 years 1 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...