2722 search results - page 408 / 545 » Automating Language Evolution |
140
Voted
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
103
Voted
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
We introduce a proposal to give argumentation capacity to databases. A database is said to have argumentation capacity if it can extract from the information available to it a set ...
140
Voted
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
144
Voted
IDEAS
2002
IEEE
15 years 8 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
121
click to vote
FASE
2010
Springer
15 years 8 months ago
2010
Springer
Software design models are routinely adapted to domains, companies, and applications. This requires customizable consistency checkers that allow engineers to dynamically adapt mode...