1455 search results - page 14 / 291 » Programming in Logic with Constraints for Natural Language P... |
AGP
1995
IEEE
13 years 11 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
AAAI
2008
13 years 10 months ago
2008
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
COOPIS
2004
IEEE
13 years 11 months ago
2004
IEEE
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 symb...
ISMVL
2000
IEEE
14 years 1 days ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
ICLP
2003
Springer
14 years 26 days ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...