Ontology and other logical languages are built around the idea that axioms enable the inference of new facts about the available data. In some circumstances, however, the data is meant to be complete in certain ways, and deducing new facts may be undesirable. Previous approaches to this issue have relied on syntactically specifying certain axioms as constraints or adding in new constructs for c...

A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ∈ Σ, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefixclosed, and prefix-free languages. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal,...

Sectloo One o f thls paper gives an overview of a generally accepted approach to semantic processing that goes through several levels o f representation to achieve this mapping. Although somewhat inflexible a n d cumbersome, the different levels succeed in preservln S the context sensitive information p r o v i d e d by v e r b semantics. Section Two p r e s e n t s t h e a u t h o r ' s r u l ...

Information security, which is becoming more crucial as information sharing plays an increasingly significant part in the day-to-day activities of today's people, one methods that may be used for security. For sake we present a method to linguistic steganography based on syntactic banks.

Traditionally, Epistemic Logic represents epistemic scenarios using a single model. This, however, covers only complete descriptions that specify truth values of all assertions. Indeed, many—and perhaps most—epistemic are not complete. Syntactic Logic, SEL, suggests viewing an situation as set syntactic conditions rather than This allows us to naturally capture incomplete descriptions; we discu...