Feature-constraint logics for unification grammars

Smolka, Gert

doi:10.1016/0743-1066(92)90039-6

Cited by 104 publications

(97 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The nodes of a feature graph represent objects whereby atoms are drawn as rectangles. The edges of the graph represent the defined features (Smolka 1992).…”

Section: Modeling Tasks and Constraints Using Feature Logicmentioning

confidence: 99%

“…Within this approach the operations existence, selection, extraction, and agreement are useful. All available feature terms and their description are presented in (Smolka 1992). Formula 1 compares objects based on their feature existence.…”

Section: Generating Workflow Graphs Using Feature Logicmentioning

confidence: 99%

“…In order to use these methods, it is necessary to provide operations for selecting tasks with respect to their constraints. Within this approach constraints are modeled on the basis of Feature Logic (Smolka 1992). …”

Section: Modeling Tasks and Constraints Using Feature Logicmentioning

confidence: 99%

See 2 more Smart Citations

Generating Construction Schedules with Case-Based Reasoning Support

Tauscher¹,

Mikulakova²,

König³

et al. 2007

Computing in Civil Engineering (2007)

View full text Add to dashboard Cite

Current construction practice usually provides a variety of different execution alternatives for each project objective. Normally, only one possible construction schedule is selected and defined manually. Thus, decisions are often narrowed down and made at a stage where this cannot be done in a reliable way. In many cases it would be useful if more than one alternative solution could be investigated. However, modeling solution alternatives is very tedious and is not supported by standard solution approaches. This paper presents an approach for generating a construction schedule that includes various alternatives within a single model as well as provisions for the reuse of experiences from former projects. The schedule can be generated on the basis of independent construction tasks. Associated constraints are formally described by the use of Feature Logic theory. Thus, a schedule can be generated automatically at any time in the process. This should lead to a higher degree of flexibility and the application of proven solutions to problems that might occur on construction sites. In such cases, a faster reaction can be achieved by responding with predefined, tested alternatives. For practical reasons the reuse of already predefined solutions is extremely significant. Therefore, the application of case-based reasoning is investigated in this work. Partial construction solutions can be stored, retrieved, and re-used using a casebased system.

show abstract

“…The nodes of a feature graph represent objects whereby atoms are drawn as rectangles. The edges of the graph represent the defined features (Smolka 1992).…”

Section: Modeling Tasks and Constraints Using Feature Logicmentioning

confidence: 99%

Section: Generating Workflow Graphs Using Feature Logicmentioning

confidence: 99%

See 1 more Smart Citation

Generating Construction Schedules with Case-Based Reasoning Support

Tauscher¹,

Mikulakova²,

König³

et al. 2007

Computing in Civil Engineering (2007)

View full text Add to dashboard Cite

show abstract

“…The Knowledge Interchange Format KIF ( [9]) and the tool Ontolingua [8] extend first order logic with variable arity function symbols and apply it to knowledge management. Feature terms [21] can also be used to denote terms with flexible arity and have been used in logic programming, unification grammars and knowledge representation. Unification for flexible terms has as particular instances previous work on word unification ( [11,20]), equations over lists of atoms with a concatenation operator ( [7]) and equations over free semigroups ([16]).…”

Section: Related Workmentioning

confidence: 99%

CLP(Flex): Constraint Logic Programming Applied to XML Processing

Coelho

Florido

2004

On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE

View full text Add to dashboard Cite

In this paper we present an implementation of a constraint solving module, CLP(Flex), for dealing with unification in an equality theory for terms with flexible arity function symbols. Then we present an application of CLP(Flex) to XML-processing where XML documents are abstracted by terms with flexible arity symbols. This gives a highly declarative model for XML processing yielding a substantial degree of flexibility in programming.

show abstract

“…In the second tree in Figure 1, however, different nodes have a different number of children. Although unranked trees have been considered in the 60s and 70s [PQ68,Tak75,Tha67], and are related to feature trees over an infinite set of features [Smo92] which are a particular kind of feature structures that [Bla94,Car92,RK86], their systematic study was initiated by the development of XML (eXtensible Markup Language). XML is a data format which has become the lingua franca for information exchange on the World Wide Web.…”

Section: Introductionmentioning

confidence: 99%

Logics for Unranked Trees: An Overview

Libkin

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.

show abstract

Feature-constraint logics for unification grammars

Cited by 104 publications

References 10 publications

Generating Construction Schedules with Case-Based Reasoning Support

Generating Construction Schedules with Case-Based Reasoning Support

CLP(Flex): Constraint Logic Programming Applied to XML Processing

Logics for Unranked Trees: An Overview

Contact Info

Product

Resources

About