• Penn Treebank

  • Referenced in 100 articles [sw08023]
  • showing rough syntactic and semantic information -- a bank of linguistic trees. We also annotate text...
  • semprop

  • Referenced in 17 articles [sw28383]
  • most promising paradigms is the semantic tree format implemented in the style of the DPLL ... restriction of the variable selection in semantic tree procedures for quantified Boolean formulas, learning methods...
  • HERBY

  • Referenced in 6 articles [sw21545]
  • factoring (Chapter 4). HERBY is a semantic-tree theorem-proving program (the theoretical foundations ... semantic tree theorem proving are presented in Chapter 5) and THEO is a resolution-refutation...
  • ITP

  • Referenced in 31 articles [sw09808]
  • verifying semantic data structures, such as ordered lists, binary search trees, priority queues, and powerlists...
  • CoALP

  • Referenced in 18 articles [sw16105]
  • abstract category theoretic semantics, developing coalgebra to characterize naturally arising trees and proceeding towards implementation...
  • CP-logic

  • Referenced in 17 articles [sw06947]
  • semantical level by Shafer in his framework of probability trees. In such a dynamic context ... used to represent a class of probability trees in a concise, flexible and modular ... offering a convenient logical representation for his semantical objects. Second, this language also has relevance...
  • PrHERBY

  • Referenced in 1 article [sw25429]
  • Exploiting parallelism: Highly competitive semantic tree theorem prover. Semantic trees have often been used ... resolutions when necessary to construct a semantic tree, leading to a strategy that combines ... construction of semantic trees with resolution-refutation. The parallel semantic tree theorem prover, called PrHERBY ... proof using fewer atoms than the semantic tree prover, HERBY and its parallel version PHERBY...
  • Abella

  • Referenced in 49 articles [sw09461]
  • which supports a transparent encoding of structural semantics rules and also enables their execution ... logics is that they exploit the λ-tree syntax approach to treating binding in object...
  • GF

  • Referenced in 32 articles [sw13667]
  • used both for linearizing syntax trees and parsing strings. GF can describe both formal ... dependent types in abstract syntax to express semantic conditions, such as well-typedness and proof ... used in authoring systems, where syntax trees are constructed in an interactive editor similar...
  • Manticore

  • Referenced in 2 articles [sw20009]
  • parallel constructs with mostly sequential semantics; a Lazy Tree Splitting (LTS) strategy for performance-robust...
  • AspCcgTk

  • Referenced in 1 article [sw09896]
  • AspCcgTk aims at producing all semantically distinct parse trees for a given sentence. Compared...
  • tree-structured-covariance

  • Referenced in 3 articles [sw23327]
  • Taxonomic prediction with tree-structured covariances. Taxonomies have been proposed numerous times in the literature ... order to encode semantic relationships between classes. Such taxonomies have been used to improve classification ... compare the performance of learned and semantically constructed taxonomies. Structured prediction in this case ... contributions: (i) We prove the equivalence between tree-structured covariance matrices and taxonomies...
  • VMEXT

  • Referenced in 5 articles [sw20981]
  • trees from parallel {sc MathML}. VMEXT simultaneously visualizes the presentation elements and the semantic structure...
  • Refiner

  • Referenced in 5 articles [sw00790]
  • semantics-preserving program transformations. Code development is recorded in the form of a refinement tree...
  • Forest

  • Referenced in 1 article [sw11313]
  • fragment of Forest in a semantics inspired by classical tree logics and prove round-tripping...
  • Ontop

  • Referenced in 15 articles [sw22931]
  • queries under the OWL 2 QL direct semantics entailment regime for data instances stored ... that by applying the Ontop technologies—the tree-witness query rewriting, -mappings compiling R2RML mappings...
  • HARP

  • Referenced in 16 articles [sw26323]
  • more readable by excising redundancies from proof trees. Domain-independent heuristics are formulated to capture ... easy to let extralogical information, e.g. semantic and world knowledge, guide the search for proofs...
  • LETOS

  • Referenced in 10 articles [sw04987]
  • operational semantics. To use letos, an operational semantics must be expressed in its meta-language ... Haskell, and versatile enough to support derivation tree browsing using Netscape. Letos has been applied...
  • SQL4X

  • Referenced in 1 article [sw03300]
  • documents with varied structures, SQL4X uses flexible semantics when querying XML. SQL4X is also ... path expressions. par Datalog${}_{4x}$ and Tree-Datalog${}_{4x}$, extensions of Datalog, are defined ... semantics is also characterized. A sufficient condition for containment of Tree-Datalog${}_{4x}$ queries...
  • ACTLW

  • Referenced in 7 articles [sw21031]
  • temporal logic ACTLW, which enhances popular computation tree logic (CTL) with the notion of actions ... Action versus logics for transition systems, in: Semantics of Systems of Concurrent Processes, Proceedings LITP...