Expressing Disjunctive and Negative Feature Constraints with Classical First-Order Logic
نویسنده
چکیده
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature s t ruc tures of uni f ica t ion g r a m m a r and constraints on them can be axiomatized in classical first-order logic, which can express disjunctive and negative constraints. Because only quantifier-free formulae are used in the axiomatization, the satisfiability problem is NPcomplete.
منابع مشابه
Logic Programs and Classical Planning with LTLConstraints
The paper deals with encoding planning problems with LTL constraints as disjunctive logic programs (LP ) and computing the plans (answer sets) under the stable model semantics. In order to encode the problem as a logic program, we use a well known SAT encoding of classical planning problems. Observing that obtaining the LP encoding for the LTL constraints results in an exponential blowup in the...
متن کاملMany-Valued First-Order Logics with Probabilistic Semantics
We present n-valued rst-order logics with a purely proba-bilistic semantics. We then introduce a new probabilistic semantics of n-valued rst-order logics that lies between the purely probabilistic semantics and the truth-functional semantics of the n-valued Lukasiewicz logics Ln. Within this semantics, closed formulas of classical rst-order logics that are logically equivalent in the classical ...
متن کاملA Semantic Tableau Version of First-Order Quasi-Classical Logic
Quasi-classical logic (QC logic) allows the derivation of non-trivial classical inferences from inconsistent information. A paraconsis-tent, or non-trivializable, logic is, by necessity, a compromise, or weakening , of classical logic. The compromises on QC logic seem to be more appropriate than other paraconsistent logics for applications in computing. In particular, the connectives behave in ...
متن کاملCLG(n): Constraint Logic Grammars
I n t r o d u c t i o n Recently a number of formalisms for grammatical description have been proposed with the aim of overcoming the expressive deficiencies of simple unification based formalisms like PATR-II. Except for the more simple, although not unproblematic, extensions to PATR-II like the ones proposed by Karttunen (1984), most of these efforts have their root in the work by Rounds, Kas...
متن کاملReasoning about Actions with CHRs and Finite Domain Constraints
We present a CLP-based approach to reasoning about actions in the presence of incomplete states. Constraints expressing negative and disjunctive state knowledge are processed by a set of special Constraint Handling Rules. In turn, these rules reduce to standard finite domain constraints when handling variable arguments of single state components. Correctness of the approach is proved against th...
متن کامل