Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
346
search results - page 70 / 70
»
Logical omniscience as a computational complexity problem
Sort
relevance
views
votes
recent
update
View
thumb
title
30
click to vote
CSCLP
2008
Springer
264
views
Artificial Intelligence
»
more
CSCLP 2008
»
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
13 years 8 months ago
Download
pst.istc.cnr.it
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
claim paper
Read More »
« Prev
« First
page 70 / 70
Last »
Next »