Sciweavers

6554 search results - page 342 / 1311
» Constraint Logic Programming
Sort
View
ACL
2000
15 years 8 months ago
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
Alexander Koller, Kurt Mehlhorn, Joachim Niehren
CPP
2011
98views more  CPP 2011»
14 years 6 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
CORR
1998
Springer
107views Education» more  CORR 1998»
15 years 6 months ago
Computing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
Markus Walther
PADL
2005
Springer
16 years 4 days ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel
208
Voted
MATES
2005
Springer
16 years 4 days ago
Programming Cognitive Agents
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...
John-Jules Ch. Meyer