Sciweavers

150 search results - page 24 / 30
» Dynamically Ordered Probabilistic Choice Logic Programming
Sort
View
ICLP
2007
Springer
14 years 1 months ago
Demand-Driven Indexing of Prolog Clauses
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...
Vítor Santos Costa, Konstantinos F. Sagonas...
AAMAS
2005
Springer
13 years 7 months ago
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
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...
Marcela Capobianco, Carlos Iván Chesñ...
EWDW
1990
13 years 11 months ago
Semantics of Object-Oriented Data Models - The Evolving Algebra Approach
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...
Georg Gottlob, Gerti Kappel, Michael Schrefl
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Algorithmic Verification of Single-Pass List Processing Programs
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...
Rajeev Alur, Pavol Cerný
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 2 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
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...
Michael Leuschel, Salvador Tamarit, Germán ...