150 search results - page 24 / 30 » Dynamically Ordered Probabilistic Choice Logic Programming |
ICLP
2007
Springer
15 years 5 months ago
2007
Springer
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
117
click to vote
AAMAS
2005
Springer
14 years 11 months ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
103
click to vote
EWDW
1990
15 years 3 months ago
1990
The formal description of the semantics of object-oriented data models is still an open problem. Some characteristic features of object-oriented data models, such as methods and i...
124
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
117
click to vote
WFLP
2009
Springer
15 years 6 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...